New methods for adapting and for approximating inverses as preconditioners
type: Item
instance of: scholarly article
title: New methods for adapting and for approximating inverses as preconditioners
zbMATH Open document ID: 0995.65055
DOI: 10.1016/S0168-9274(01)00117-9
author: Claus Koschinski
published in: Applied Numerical Mathematics
publication date: 2002-05-21T00:00:00Z
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 1743065
zbMATH Keywords: preconditioning
zbMATH Keywords: sparse approximate inverse
zbMATH Keywords: iterative solver
zbMATH Keywords: parallel computing
zbMATH Keywords: projection methods
zbMATH Keywords: Krylov subspace methods
zbMATH Keywords: numerical experiments
describes a project that uses: SparseMatrix
describes a project that uses: Harwell-Boeing sparse matrix collection
MaRDI profile type: Publication
cites work: An assessment of some preconditioning techniques in shell problems
cites work: A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
cites work: A comparative study of sparse approximate inverse preconditioners
cites work: Approximate inverse preconditionings for sparse linear systems
cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
cites work: Sparse matrix test problems
cites work: Parallel Preconditioning with Sparse Approximate Inverses
cites work: Q3137753
cites work: Q4721493
cites work: Factorized Sparse Approximate Inverse Preconditionings I. Theory
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Q4895322
description: scientific article; zbMATH DE number 1743065