Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems

DOI10.1137/070698725MaRDI QIDQ3561178zbMATH OpenOpenAlexWikidataFDO

Authors 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

sparse matriceseigenvaluesnumerical resultseigenvectorsnormal equationscondition numberill-posednessiterative methodsconjugate gradientspseudoinverseoverdetermined 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)

Recommendations

• Solving separable nonlinear least squares problems using the QR factorization
• Publication:4320128
• Publication:4530436
• Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
• QR factorization for the regularized least squares problem on hypercubes
• Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
• Factorized quasi-Newton methods for nonlinear least squares problems
• Updating QR factorization procedure for solution of linear least squares problem with equality constraints
• Publication:4668660
• Publication:4876333

Cited in

(14)

• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
• Sparse linear least-squares problems
• Approximating sparse Hessian matrices using large-scale linear least squares
• 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
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
• Solving Rank-Deficient and Ill-posed Problems Using UTV and QR Factorizations
• scientific article; zbMATH DE number 1183040 (Why is no real title available?)
• Flexible modified LSMR for least squares problems
• Computing the null space of finite element problems
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
• scientific article; zbMATH DE number 2130409 (Why is no real title available?)
• scientific article; zbMATH DE number 2156164 (Why is no real title available?)

This page was built for publication: Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561178)