A generalized LSQR algorithm

DOI10.1002/nla.611zbMath1212.65170OpenAlexW2070563946MaRDI QIDQ3588932

Qiang Ye, Lothar Reichel

Publication date: 10 September 2010

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.611

zbMATH Keywords

numerical examplesiterative methodsystem of linear equationslinear discrete ill-posed problemleast-squares problemLSQR algorithm

Mathematics Subject Classification ID

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 (5)

An augmented LSQR method ⋮ BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ A Tridiagonalization Method for Symmetric Saddle-Point Systems ⋮ Matrix iterative algorithms for least-squares problem in quaternionic quantum theory

Uses Software

• LSQR
• Regularization tools

Cites Work

• Unnamed Item
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• The triangle method for finding the corner of the L-curve
• Enriched Krylov subspace methods for ill-posed problems
• Iterative methods for ill-posed problems and semiconvergent sequences
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
• Rank-Deficient and Discrete Ill-Posed Problems
• Calculating the Singular Values and Pseudo-Inverse of a Matrix

This page was built for publication: A generalized LSQR algorithm