New methods for adapting and for approximating inverses as preconditioners

DOI10.1016/S0168-9274(01)00117-9zbMath0995.65055MaRDI QIDQ1349143

Claus Koschinski

Publication date: 21 May 2002

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical experimentspreconditioningparallel computingprojection methodsKrylov subspace methodsiterative solversparse approximate inverse

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (1)

Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection

Cites Work

• A comparative study of sparse approximate inverse preconditioners
• Sparse matrix test problems
• Approximate inverse preconditionings for sparse linear systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• An assessment of some preconditioning techniques in shell problems
• Parallel Preconditioning with Sparse Approximate Inverses
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New methods for adapting and for approximating inverses as preconditioners