Structure-Preserving and Rank-Revealing QR-Factorizations

DOI10.1137/0912073zbMath0739.65031OpenAlexW2020727186WikidataQ114074363 ScholiaQ114074363MaRDI QIDQ3982109

Christian H. Bischof, Per Christian Hansen

Publication date: 26 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0912073

zbMATH Keywords

algorithmsingular value decompositionnumerical experimentssparse matricesGivens rotationsHouseholder transformationsnumerical rankleast-squares problemsrank-deficient problemsincremental condition estimationrank-revealing \(QR\)-factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization, Improved bound for rank revealing LU factorizations, Low‐rank revealing QR factorizations, Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations, Structural instability analyses based on generalised path-following, Generalized QR factorization and its applications, A block algorithm for computing rank-revealing QR factorizations, An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition, Estimation of atmospheric PSF parameters for hyperspectral imaging, A survey of direct methods for sparse linear systems