A block QR algorithm and the singular value decomposition

DOI10.1016/0024-3795(93)90493-8zbMath0769.65012OpenAlexW2040528593MaRDI QIDQ2365660

Yanyan Li

Publication date: 29 June 1993

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(93)90493-8

zbMATH Keywords

convergenceiterative algorithmsingular value decompositionsingular valuesQR algorithmtriangular matrixsingular subspacesrank-revealing triangular decompositions

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (10)

Randomized numerical linear algebra: Foundations and algorithms ⋮ Randomized quaternion QLP decomposition for low-rank approximation ⋮ Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics ⋮ An efficient randomized QLP algorithm for approximating the singular value decomposition ⋮ Modifiable low-rank approximation to a matrix ⋮ An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition ⋮ Combinatorial optimization of special graphs for nodal ordering and graph partitioning ⋮ On the \(QR\) algorithm and updating the \(SVD\) and the \(URV\) decomposition in parallel ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ Convergence analysis of the block Householder diagonalization algorithm

Cites Work

• Updating URV decompositions in parallel
• Matrix Analysis
• Updating a Rank-Revealing ULV Decomposition
• Perturbation bounds in connection with singular value decomposition
• Unnamed Item

This page was built for publication: A block QR algorithm and the singular value decomposition