More accurate bidiagonal reduction for computing the singular value decomposition
From MaRDI portal
Recommendations
Cited in
(19)- Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
- A new stable bidiagonal reduction algorithm
- An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
- One-sided reduction to bidiagonal form
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Improving the Accuracy of Computed Singular Values
- Accurate Singular Values of Bidiagonal Matrices
- scientific article; zbMATH DE number 18990 (Why is no real title available?)
- Reducing the Computations of the Singular Value Decomposition Array Given by Brent and Luk
- The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- scientific article; zbMATH DE number 2163272 (Why is no real title available?)
- scientific article; zbMATH DE number 4001323 (Why is no real title available?)
- Growth factors of orthogonal matrices and local behavior of Gaussian elimination with partial and complete pivoting
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- A QR-method for computing the singular values via semiseparable matrices
- Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices
- The ERES method for computing the approximate GCD of several polynomials
This page was built for publication: More accurate bidiagonal reduction for computing the singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784379)