Preconditioned iterative methods for solving linear least squares problems

DOI10.1137/130931588MaRDI QIDQ6486766zbMATH OpenOpenAlexFDO

Authors R. Bru, José Marín, J. Mas, Miroslav Tuma

Publication date 17 November 2014

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

Full work available at URL http://hdl.handle.net/10251/54661

zbMATH Keywords

preconditioningnumerical experimentsiterative methodslinear least squaresnormal equationbalanced incomplete factorizationapproximate inversesincomplete decompositionsconjugate gradient for least squares methodoverdetermined large and sparse linear least squares problems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Recommendations

• Preconditioners for least squares problems by LU factorization
• Preconditioned GMRES methods for least squares problems
• Preconditioned iterative methods for solving weighted linear least squares problems
• Preconditioning linear least-squares problems by identifying a basis matrix
• A note on preconditioned iterative methods for least squares problems

This page was built for publication: Preconditioned iterative methods for solving linear least squares problems

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