Preconditioned iterative methods for solving linear least squares problems
From MaRDI portal
Recommendations
- Preconditioners for least squares problems by LU factorization
- Preconditioned GMRES methods for least squares problems
- Preconditioned iterative methods for solving weighted linear least squares problems
- Preconditioning linear least-squares problems by identifying a basis matrix
- A note on preconditioned iterative methods for least squares problems
Cited in
(33)- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Least squares preconditioning for mixed methods with nonconforming trial spaces
- A note on preconditioned iterative methods for least squares problems
- Sparse linear least-squares problems
- New IMGS-based preconditioners for least squares problems
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- scientific article; zbMATH DE number 5811385 (Why is no real title available?)
- A penalty method for PDE-constrained optimization in inverse problems
- Accuracy of preconditioned CG-type methods for least squares problems.
- scientific article; zbMATH DE number 4190984 (Why is no real title available?)
- Estimating error norms in CG-like algorithms for least-squares and least-norm problems
- Projections and preconditioning for inconsistent least-squares problems
- Preconditioning linear least-squares problems by identifying a basis matrix
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Efficient solution of parameter identification problems with $H^1$ regularization
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Some comments on preconditioning for normal equations and least squares
- Preconditioning of LSQR and CGLS: variants, properties and relations
- Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems
- Preconditioners for Krylov subspace methods: An overview
- Preconditioners for rank deficient least squares problems
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Semi-convergence analysis of the GSS iteration methods for singular saddle point problems
- Block conjugate gradient methods with error norm estimates for least squares problems
- scientific article; zbMATH DE number 1911052 (Why is no real title available?)
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- Updating preconditioners for modified least squares problems
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Preconditioned GMRES methods for least squares problems
- An ILU preconditioner for nonsymmetric positive definite matrices by using the conjugate Gram-Schmidt process
- Preconditioners for least squares problems by LU factorization
This page was built for publication: Preconditioned iterative methods for solving linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486766)
