A generalized LSQR algorithm
DOI10.1002/NLA.611zbMATH Open1212.65170OpenAlexW2070563946MaRDI QIDQ3588932FDOQ3588932
Authors: 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
Recommendations
- Solving Generalized Least-Squares Problems with LSQR
- An augmented LSQR method
- scientific article; zbMATH DE number 7339296
- An improved algorithm for generalized least squares estimation
- A matrix LSQR algorithm for solving constrained linear operator equations
- A Practical Version of the Generalized Lagrange Algorithm
- LSQR iterative method for generalized coupled Sylvester matrix equations
- A generalized conjugate gradient, least square method
- scientific article; zbMATH DE number 1043089
numerical examplesiterative methodsystem of linear equationslinear discrete ill-posed problemleast-squares problemLSQR algorithm
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Title not available (Why is that?)
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- The triangle method for finding the corner of the L-curve
- Iterative methods for ill-posed problems and semiconvergent sequences
- Enriched Krylov subspace methods for ill-posed problems
Cited In (9)
- Matrix iterative algorithms for least-squares problem in quaternionic quantum theory
- Some properties of LSQR for large sparse linear least squares problems
- Title not available (Why is that?)
- A tridiagonalization method for symmetric saddle-point systems
- Estimating the Backward Error in LSQR
- On tridiagonal matrices unitarily equivalent to normal matrices
- Implicitly restarting the LSQR algorithm
- BiLQ: an iterative method for nonsymmetric linear systems with a quasi-minimum error property
- An augmented LSQR method
Uses Software
This page was built for publication: A generalized LSQR algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588932)
