A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems

DOI10.1137/0912062zbMath0733.65024OpenAlexW2062285720MaRDI QIDQ3359649

Esmond G. Ng

Publication date: 1991

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

Full work available at URL: https://semanticscholar.org/paper/4a59ab72b82127e468e1ee6e0caf36dffb7088aa

zbMATH Keywords

singular value decompositionupdatingorthogonal decompositionrobust algorithmsminimum-norm solutionrank-deficiencysparse linear least squares problem

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items

A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ Computing the null space of finite element problems ⋮ A survey of direct methods for sparse linear systems

Uses Software

• SPARSPAK