Some properties of LSQR for large sparse linear least squares problems

DOI10.1007/s11424-010-7190-1zbMath1209.90285OpenAlexW2111908754MaRDI QIDQ625665

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

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (4)

Solving linearly constrained matrix least squares problem by LSQR ⋮ An augmented LSQR method ⋮ Projected Newton method for noise constrained Tikhonov regularization ⋮ Convergence analysis of LSQR for compact operator equations

Uses Software

• LSQR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix Algorithms
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods

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