Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
From MaRDI portal
Recommendations
- Accuracy of preconditioned CG-type methods for least squares problems.
- Numerical aspects of the generalized CG-method applied to least squares problems
- The Lanczos and Conjugate Gradient Algorithms
- Preconditioned Conjugate Gradient Method and Generalized Successive Overrelaxation Method for the Least Squares Problems
Cited in
(34)- Accuracy of preconditioned CG-type methods for least squares problems.
- Accurate conjugate gradient methods for families of shifted systems
- The triangle method for finding the corner of the L-curve
- Extension of Tikhonov regularization method using linear fractional programming
- A new consistent splitting scheme for incompressible Navier-Stokes flows: a least-squares spectral element implementation
- LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- Stability of the MGS-like elimination method for equality constrained least squares problems
- scientific article; zbMATH DE number 671777 (Why is no real title available?)
- The adaptive s-step conjugate gradient method
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Total variation superiorized conjugate gradient method for image reconstruction
- Inexact half-quadratic optimization for linear inverse problems
- Composite Step Product Methods for Solving Nonsymmetric Linear Systems
- Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
- scientific article; zbMATH DE number 852354 (Why is no real title available?)
- Conditional stability of Larkin methods with non-uniform grids
- Block conjugate gradient algorithms for least squares problems
- A new Lanczos-type algorithm for systems of linear equations
- scientific article; zbMATH DE number 7280152 (Why is no real title available?)
- On iterative solution of the extended normal equations
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- LNLQ: an iterative method for least-norm problems with an error minimization property
- scientific article; zbMATH DE number 6604147 (Why is no real title available?)
- Landweber-type method with uniformly convex constraints under conditional stability assumptions
- Some properties of LSQR for large sparse linear least squares problems
- Efficient solution of parameter identification problems with H¹ regularization
- Estimating error norms in CG-like algorithms for least-squares and least-norm problems
- Cholesky-like preconditioner for Hodge Laplacians via heavy collapsible subcomplex
- Computing projections with LSQR
- Divergence-free and curl-free moving least squares approximations
- Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression
This page was built for publication: Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389103)
