Generalized approximate inverse preconditioners for least squares problems

DOI10.1007/BF03167543zbMath1171.65390MaRDI QIDQ2270594

Xiaoke Cui, Ken Hayami

Publication date: 28 July 2009

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jjiam/1244209203

zbMATH Keywords

numerical experimentspreconditioningrandom matricesrectangular matrixapproximate inverselarge sparse least squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Geometrical inverse matrix approximation for least-squares problems and acceleration strategies, A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations, Preconditioners for Krylov subspace methods: An overview, Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparative study of sparse approximate inverse preconditioners
• Multilevel ILU decomposition
• Preconditioning techniques for large linear systems: A survey
• GMRES On (Nearly) Singular Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Sparse matrix test problems
• Approximate inverse preconditionings for sparse linear systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Parallel Preconditioning with Sparse Approximate Inverses
• Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations