The Orthogonal qd-Algorithm
Copyright policy )The Orthogonal qd-Algorithm
The paper presents an algorithm to compute the singular values and the singular vectors of a square bidiagonal matrix. This algorithm uses the differential form of the generalized Givens transformation to compute the orthogonal \(qd\)-steps, and two different shift strategies based on Newton's and Laguerre's methods to compute the zeros of a polynomial. Finally, some numerical results are given.
- University of Maryland, College Park United States
- University of Maryland, College Park United States
Numerical computation of eigenvalues and eigenvectors of matrices, Numerical solutions to overdetermined systems, pseudoinverses, orthogonal qd-algorithm, singular value decomposition, generalized Givens transformation, Laguerre's method
Numerical computation of eigenvalues and eigenvectors of matrices, Numerical solutions to overdetermined systems, pseudoinverses, orthogonal qd-algorithm, singular value decomposition, generalized Givens transformation, Laguerre's method
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!