A QR-method for computing the singular values via semiseparable matrices
A new iterative algorithm for computing the singular value decomposition of a real matrix is proposed. In the first phase of the algorithm the matrix is reduced into an upper triangular semiseparable matrix by using orthogonal transformations. In the second phase an iterative method is applied to the matrix obtained in the first phase in order to reduce it into a block diagonal matrix. It is shown that each iteration step is equivalent to one iteration step of the QR-method. An advantage of the algorithm in the first phase is that after a few steps of this algorithm the largest singular values are already computed with high precision. Numerical experiments show that the new method can compete with the standard method.
- Using semiseparable matrices to compute the SVD of a general matrix product/quotient
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- scientific article; zbMATH DE number 5527834
- More accurate bidiagonal reduction for computing the singular value decomposition
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form
- A note on the representation and definition of semiseparable matrices
- Accurate Singular Values of Bidiagonal Matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Chasing Algorithms for the Eigenvalue Problem
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1793704 (Why is no real title available?)
- scientific article; zbMATH DE number 953050 (Why is no real title available?)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Linear complexity algorithm for semiseparable matrices
- Linear complexity algorithms for semiseparable matrices
- On Rank-Revealing Factorisations
- Some algorithms for solving special tridiagonal block Toeplitz linear systems
- Some Applications of the Rank Revealing QR Factorization
- The Interplay of Ranks of Submatrices
- The QLP Approximation to the Singular Value Decomposition
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- Exponential dichotomy on the real line: SVD and QR methods
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- A block QR algorithm and the singular value decomposition
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- Fast QR factorization of Cauchy-like matrices
- A Lanczos-like reduction of symmetric structured matrices to semiseparable form
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- An implicit QR algorithm for symmetric semiseparable matrices
- The QIF Singular Value Decomposition Method
- Using semiseparable matrices to compute the SVD of a general matrix product/quotient
This page was built for publication: A QR-method for computing the singular values via semiseparable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706231)
