Numerical experiments with two approximate inverse preconditioners
The solution of a large and sparse system of linear equations \(Ax=b\) by iterative technique combined with preconditioner is considered. There is interest in an alternative form of preconditioning based on approximating the matrix inverse \(A^{-1}\). With this kind of preconditioner the computation can be performed in parallel. The most popular approach to approximate inverse preconditioning -- the SPAI algorithm -- is based on the idea of Frobenius norm minimization. Another approach for computing a factorized approximate inverse, suggested by the authors, is based on incomplete biconjugation. For general sparse matrices it is very difficult to prescribe the sparsity pattern in advance and so SPAI becomes very expensive. The construction of the AINV preconditioner does not require that the sparsity pattern be known in advance, and applicable to general sparse matrices. The authors present the results of numerical experiments aimed at comparing SPAI and AINV, performed on a set of sparse matrices. Results for a standard ILU preconditioner are also included. From the point of view of robustness and rates of convergence, SPAI and AINV are comparable and AINV is somewhat better on average.
- A comparative study of sparse approximate inverse preconditioners
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Approximate inverse preconditionings for sparse linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- Orderings for Factorized Sparse Approximate Inverse Preconditioners
- Parallel Preconditioning with Sparse Approximate Inverses
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Sparse matrix test problems
- Wavelet sparse approximate inverse preconditioners
- A comparative study of sparse approximate inverse preconditioners
- Numerical experiments to optimize the use of (I)LU preconditioning in the iterative linear solver package LINSOL
- Factorized sparse approximate inverses for preconditioning
- A comparative study on dynamic and static sparsity patterns in parallel sparse approximate inverse preconditioning
- An efficient computation of generalized inverse of a matrix
- A block version algorithm to approximate inverse factors
- Preconditioning techniques for large linear systems: A survey
- A generalization of the optimal diagonal approximate inverse preconditioner
- Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
- Towards a complete FEM-based simulation toolkit on GPUs: unstructured grid finite element geometric multigrid solvers with strong smoothers based on sparse approximate inverses
- AINV and BILUM preconditioning techniques
- A fast computational algorithm for computing outer pseudo-inverses with numerical experiments
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
- Iterative solutions methods for elasticity equations in mechanics and biomechanics, IMMB'98: Part 2.
- A convergence improvement of the BSAIC preconditioner by deflation
- An approach to making SPAI and PSAI preconditioning effective for large irregular sparse linear systems
- Generic approximate sparse inverse matrix techniques
- A power sparse approximate inverse preconditioning procedure for large sparse linear systems
- Data mining and prediction of SAI type matrix preconditioner
- A two-level sparse approximate inverse preconditioner for unsymmetric matrices
- Two level parallel preconditioning derived from an approximate inverse based on the Sherman-Morrison formula
- scientific article; zbMATH DE number 5759390 (Why is no real title available?)
- Approximate inverse preconditionings for sparse linear systems
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- scientific article; zbMATH DE number 2098313 (Why is no real title available?)
- A note on adaptivity in factorized approximate inverse preconditioning
- A performance study of normalized explicit finite element approximate inverse preconditioning on uniprocessor and multicomputer systems
- A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
- Frobenius norm minimization and probing for preconditioning
- On Least-Squares Approximate Inverse-Based Preconditioners
- Approximate factoring of the inverse
- On the performance of SPAI and ADI-like preconditioners for core collapse supernova simulations in one spatial dimension
- A rapid numerical algorithm to compute matrix inversion
- A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations
- On the relation between the AINV and the FAPINV algorithms
This page was built for publication: Numerical experiments with two approximate inverse preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267015)
