Preconditioned Iterative Methods for Solving Linear Least Squares Problems
From MaRDI portal
Publication:2930020
DOI10.1137/130931588zbMath1303.65021OpenAlexW2066051422MaRDI QIDQ2930020
No author found.
Publication date: 17 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/54661
No records found.
No records found.
Related Items (9)
Updating preconditioners for modified least squares problems ⋮ Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems ⋮ A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations ⋮ Semi-convergence analysis of the GSS iteration methods for singular saddle point problems ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ A penalty method for PDE-constrained optimization in inverse problems ⋮ Preconditioners for rank deficient least squares problems ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations
This page was built for publication: Preconditioned Iterative Methods for Solving Linear Least Squares Problems
