One-sided reduction to bidiagonal form
The author presents an idea for reducing a rectangular matrix \(A\) to bidiagonal form which is based on the implicit reduction of the symmetric positive semidefinite matrix \(A^t A\) to tridiagonal form. A method based upon this idea may become a serious competitor (in terms of speed) for computing the singular values of large matrices and it is well suited for parallel processing. He gives also numerical evidence of the ability of his algorithm to accurately reduce to bidiagonal form \(A = DX\), where \(D\) is diagonal and \(X\) is wellconditioned.
- A new stable bidiagonal reduction algorithm
- scientific article; zbMATH DE number 4001323
- Efficient parallel reduction to bidiagonal form.
- More accurate bidiagonal reduction for computing the singular value decomposition
- A Parallel Algorithm for the Reduction to Tridiagonal Form for Eigendecomposition
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Accurate Eigensystem Computations by Jacobi Methods
- Accurate singular values and differential qd algorithms
- Accurate Singular Values of Bidiagonal Matrices
- Algorithm 694
- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
- An Improved Algorithm for Computing the Singular Value Decomposition
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
- Experiments on Gram-Schmidt Orthogonalization
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 852525 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Iterative algorithms for Gram-Schmidt orthogonalization
- Jacobi’s Method is More Accurate than QR
- Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
- More accurate bidiagonal reduction for computing the singular value decomposition
- Numerical aspects of Gram-Schmidt orthogonalization of vectors
- Numerics of Gram-Schmidt orthogonalization
- Rang revealing QR factorizations
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Singular value decomposition and least squares solutions
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Tridiagonalization of a symmetric band matrix
This page was built for publication: One-sided reduction to bidiagonal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855440)
