A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices

DOI10.1016/S0096-3003(01)00069-8zbMath1028.65044OpenAlexW2014633779MaRDI QIDQ1855724

Jun Zhang

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(01)00069-8

zbMATH Keywords

numerical experimentspreconditioningparallel computationKrylov subspace methodsincomplete LU factorizationsparse 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) Parallel numerical computation (65Y05)

Related Items (12)

Recursive two-level ILU preconditioner for nonsymmetric M-matrices ⋮ ILU preconditioning based on the FAPINV algorithm ⋮ A short survey on preconditioning techniques for large-scale dense complex linear systems in electromagnetics ⋮ Factored approximate inverse preconditioners with dynamic sparsity patterns ⋮ A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations ⋮ On the preconditioning of the block tridiagonal linear system of equations ⋮ On the relation between the AINV and the FAPINV algorithms ⋮ A new approach to compute sparse approximate inverse factors of a matrix ⋮ A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices ⋮ FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002) ⋮ Multigrid treatment and robustness enhancement for factored sparse approximate inverse preconditioning ⋮ Comparison of time and spatial collocation methods for the heat equation

Uses Software

• BILUM
• BILUTM
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An incomplete inverse as a preconditioner for the conjugate gradient method
• A comparative study of sparse approximate inverse preconditioners
• Wavelet sparse approximate inverse preconditioners
• Preconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications
• A new class of decomposition for inverting asymmetric and indefinite matrices
• A sparsity for decomposing a symmetric matrix
• Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix
• An approximate inverse based multigrid approach to the biharmonic problem
• How Fast are Nonsymmetric Matrix Iterations?
• Approximate inverse preconditionings for sparse linear systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• An approximate inverse matrix technique for arrowhead matrices
• Parallel Preconditioning with Sparse Approximate Inverses
• Approximate Inverse Techniques for Block-Partitioned Matrices
• Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
• Toward an Effective Sparse Approximate Inverse Preconditioner
• BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
• BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems

This page was built for publication: A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices