An O(n^2) algorithm for the bidiagonal SVD
From MaRDI portal
Publication:1855431
The authors propose an agorithm which extends the relatively robust representations to the bidiagonal singular value decomposition (SVD) \(B=U\Sigma V^{T}\). The obtained numerical results are also compared with the LAPACK routines.
Recommendations
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- More accurate bidiagonal reduction for computing the singular value decomposition
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics
- The \(\mathrm{MR}^{3}\)-GK algorithm for the bidiagonal SVD
Cites work
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- Accurate singular values and differential qd algorithms
- Accurate Singular Values of Bidiagonal Matrices
- Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices
- An implementation of the dqds algorithm (positive case)
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computation of an eigenvector of a symmetric tridiagonal matrix
- Der Quotienten-Differenzen-Algorithmus
- Fernando's solution to Wilkinson's problem: An application of double factorization
- scientific article; zbMATH DE number 438985 (Why is no real title available?)
- scientific article; zbMATH DE number 1067634 (Why is no real title available?)
- Invariant subspaces for tightly clustered eigenvalues of tridiagonals
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Orthogonal Eigenvectors and Relative Gaps
- Relatively robust representations of symmetric tridiagonals
Cited in
(10)- Accuracy of two SVD algorithms for \(2\times 2\) triangular matrices
- Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- The \(\mathrm{MR}^{3}\)-GK algorithm for the bidiagonal SVD
- A fast symmetric SVD algorithm for square Hankel matrices
- Bidiagonal SVD Computation via an Associated Tridiagonal Eigenproblem
- Fast linear inversion for highly overdetermined inverse scattering problems
- On Symmetric Eigenproblems Induced by the Bidiagonal SVD
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- The eigenvalue decomposition of normal matrices by the skew-symmetric part
This page was built for publication: An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855431)
