Low‐rank revealing QR factorizations

DOI10.1002/nla.1680010105zbMath0804.65027OpenAlexW2170238574WikidataQ114235441 ScholiaQ114235441MaRDI QIDQ4301270

Tony F. Chan

Publication date: 21 July 1994

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1680010105

zbMATH Keywords

algorithmsingular valuecolumn pivotinglow rank matricesrank revealing QR factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (10)

Deflated Krylov subspace methods for nearly singular linear systems ⋮ Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations ⋮ Column subset selection problem is UG-hard ⋮ Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation ⋮ Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection ⋮ Exponential inapproximability of selecting a maximum volume sub-matrix ⋮ Unnamed Item ⋮ Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm ⋮ RankRev: a Matlab package for computing the numerical rank and updating/downdating ⋮ Column subset selection via sparse approximation of SVD

Cites Work

• Unnamed Item
• Structure-Preserving and Rank-Revealing QR-Factorizations

This page was built for publication: Low‐rank revealing QR factorizations