An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
From MaRDI portal
Publication:1855431
DOI10.1016/S0024-3795(01)00398-6zbMath1027.65047MaRDI QIDQ1855431
Publication date: 5 February 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items (4)
Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values. ⋮ A fast symmetric SVD algorithm for square Hankel matrices ⋮ Fast linear inversion for highly overdetermined inverse scattering problems ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computation of an eigenvector of a symmetric tridiagonal matrix
- Accurate singular values and differential qd algorithms
- Fernando's solution to Wilkinson's problem: An application of double factorization
- Invariant subspaces for tightly clustered eigenvalues of tridiagonals
- Relatively robust representations of symmetric tridiagonals
- An implementation of the dqds algorithm (positive case)
- Der Quotienten-Differenzen-Algorithmus
- Accurate Singular Values of Bidiagonal Matrices
- Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Orthogonal Eigenvectors and Relative Gaps
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
This page was built for publication: An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
