A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems

DOI10.1137/S106482750240649XzbMath1042.65030OpenAlexW2043448909MaRDI QIDQ4442481

Miroslav Tůma, Michele Benzi

Publication date: 20 January 2004

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s106482750240649x

zbMATH Keywords

algorithmcomparison of methodsnumerical experimentspreconditioningnormal equationsCGLSconjugate gradient least squares methodrobust incomplete factorizationlarge sparse least squares problemsincomplete QR factorizationincomplete \(C\)-orthogonalization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (20)

A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix ⋮ Hierarchical orthogonal factorization: sparse least squares problems ⋮ The block preconditioned \textit{LSQR} and \textit{GL}-\textit{LSQR} algorithms for the block partitioned matrices ⋮ LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory ⋮ An augmented LSQR method ⋮ A block preconditioner for the Gl-LSMR algorithm ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Greville's method for preconditioning least squares problems ⋮ Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems ⋮ Preconditioned GMRES methods for least squares problems ⋮ Numerical study on incomplete orthogonal factorization preconditioners ⋮ Fractional step like schemes for free surface problems with thermal coupling using the Lagrangian PFEM ⋮ A new method for computing Moore-Penrose inverse matrices ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ A class of incomplete orthogonal factorization methods. II: Implemetation and results ⋮ Full rank Cholesky factorization for rank deficient matrices ⋮ A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices ⋮ Preconditioning techniques for large linear systems: A survey ⋮ Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems

This page was built for publication: A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems