A block QR algorithm and the singular value decomposition

DOI10.1016/0024-3795(93)90493-8MaRDI QIDQ2365660zbMATH OpenOpenAlexFDO

Authors 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

iterative algorithmconvergencesingular value decompositionsingular valuesQR algorithmtriangular matrixsingular subspacesrank-revealing triangular decompositions

Mathematics Subject Classification ID

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

Recommendations

• A QR-method for computing the singular values via semiseparable matrices
• Analysis of a QR Algorithm for Computing Singular Values
• An accurate SVD algorithm for 2 by 2 triangular matrices
• The QRPS algorithm: A generalization of the QR algorithm for the singular value decomposition of rectangular matrices
• Convergence to singular triplets in the two-sided block-Jacobi SVD algorithm with dynamic ordering

Cites work

• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• Matrix Analysis
• Perturbation bounds in connection with singular value decomposition
• Updating URV decompositions in parallel
• Updating a Rank-Revealing ULV Decomposition

Cited in

(13)

• On the QR algorithm and updating the SVD and the URV decomposition in parallel
• Block factorizations and qd-type transformations for the \(\mathrm{MR}^3\) algorithm
• Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics
• Randomized numerical linear algebra: Foundations and algorithms
• An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
• scientific article; zbMATH DE number 833735 (Why is no real title available?)
• Combinatorial optimization of special graphs for nodal ordering and graph partitioning
• Randomized quaternion QLP decomposition for low-rank approximation
• Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
• Modifiable low-rank approximation to a matrix
• Convergence analysis of the block Householder diagonalization algorithm
• The QRPS algorithm: A generalization of the QR algorithm for the singular value decomposition of rectangular matrices
• An efficient randomized QLP algorithm for approximating the singular value decomposition

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365660)