A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
From MaRDI portal
Publication:4442481
DOI10.1137/S106482750240649XzbMath1042.65030MaRDI QIDQ4442481
Publication date: 20 January 2004
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithm; comparison of methods; numerical experiments; preconditioning; normal equations; CGLS; conjugate gradient least squares method; robust incomplete factorization; large sparse least squares problems; incomplete QR factorization; incomplete \(C\)-orthogonalization
65F50: Computational methods for sparse matrices
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Greville's method for preconditioning 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 techniques for large linear systems: A survey, A class of incomplete orthogonal factorization methods. II: Implemetation and results