Some properties of LSQR for large sparse linear least squares problems

DOI10.1007/S11424-010-7190-1zbMATH Open1209.90285OpenAlexW2111908754MaRDI QIDQ625665FDOQ625665

Authors: Zhongxiao Jia 

Publication date: 25 February 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-010-7190-1

Recommendations

• scientific article; zbMATH DE number 7339296
• Estimating the Backward Error in LSQR
• Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
• A generalized LSQR algorithm
• Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cites Work

• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Matrix algorithms. Vol. 2: Eigensystems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• Title not available (Why is that?)
• Numerical methods for large eigenvalue problems

Cited In (6)

• Convergence analysis of LSQR for compact operator equations
• Solving linearly constrained matrix least squares problem by LSQR
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• Projected Newton method for noise constrained Tikhonov regularization
• A Sparse QS-Decomposition for Large Sparse Linear System of Equations
• An augmented LSQR method

Uses Software

• LSQR
• CRAIG

This page was built for publication: Some properties of LSQR for large sparse linear least squares problems

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