Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems

DOI10.1137/070698725zbMath1195.65048OpenAlexW2072566752WikidataQ114074386 ScholiaQ114074386MaRDI QIDQ3561178

Haim Avron, Sivan Toledo, Esmond G. Ng

Publication date: 25 May 2010

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

numerical resultseigenvalueseigenvectorscondition numberiterative methodssparse matricespseudoinversenormal equationsconjugate gradientsill-posednessoverdetermined systemslow-rank perturbationKrylov-subspace solverssparse QR factorizations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)

Related Items

Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, A Rayleigh-Ritz style method for large-scale discriminant analysis, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Computing the null space of finite element problems, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems