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

Authors:
Michele Benzi;Miroslav Tuma
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2003

Citing 0
Cited 6

Numerical study on incomplete orthogonal factorization preconditioners

Journal of Computational and Applied Mathematics
A new method for computing Moore-Penrose inverse matrices

Journal of Computational and Applied Mathematics
Greville's method for preconditioning least squares problems

Advances in Computational Mathematics
GMRES Methods for Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Efficient Preconditioner Updates for Shifted Linear Systems

SIAM Journal on Scientific Computing
An augmented LSQR method

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a technique for constructing robust preconditioners for the CGLS method applied to the solution of large and sparse least squares problems. The algorithm computes an incomplete LDLT factorization of the normal equations matrix without the need to form the normal matrix itself. The preconditioner is reliable (pivot breakdowns cannot occur) and has low intermediate storage requirements. Numerical experiments illustrating the performance of the preconditioner are presented. A comparison with incomplete QR preconditioners is also included.