On the convergence of Stewart's QLP algorithm for approximating the SVD

DOI10.1023/A:1024082314087zbMath1035.65034WikidataQ57397355 ScholiaQ57397355MaRDI QIDQ1397933

Tony F. Chan, David A. Huckaby

Publication date: 6 August 2003

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencenumerical examplessingular value decomposition (SVD)pivoted QLP decomposition

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (10)

Randomized quaternion QLP decomposition for low-rank approximation ⋮ Randomized QLP decomposition ⋮ A note on the matrix-scaled total least squares problems with multiple solutions ⋮ Randomized QR with Column Pivoting ⋮ An efficient randomized QLP algorithm for approximating the singular value decomposition ⋮ Pass-efficient truncated UTV for low-rank approximations ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Single-pass randomized QLP decomposition for low-rank approximation

This page was built for publication: On the convergence of Stewart's QLP algorithm for approximating the SVD