A comparative study of sparse approximate inverse preconditioners
Numerical analysis practitioners are well aware of the increasing number of preconditioners available to solve the large linear systems that arise in many applications. They also encounter difficulties when it comes to decide which approach might prove more suitable for a specific problem in a given computational environment. After more than two decades since the pioneering paper by \textit{J. A. Meijerink} and \textit{H. A. van der Vorst} [Math. Comput. 31, 148-162 (1977; Zbl 0349.65020)], introducing the subject via the incomplete factorizations, here is a systematic attempt to organize those newcomers based on sparse approximate inverses, which also takes into account the differences that may arise between serial and parallel processing. From the start the authors take the view that sparse approximate inverse methods will become an increasingly important tool for high-performance preconditioning of large linear systems. Accordingly, these methods are carefully classified into three main groups, which are generically described as methods based on Frobenius norm minimization, methods with factorized sparse approximate inverses, and those which consider incomplete factorizations followed by an approximate inversion of the incomplete factors. A large number of numerical experiments have been carried out on both symmetric positive definite systems and nonsymmetric ones. The systems have been taken from well-known benchmarks and cover a wide spectrum of problems arising from applications such as structural analysis, oil reservoir simulation, circuit modelling and power system network. The approximate inverse methods are thoroughly compared with the classic preconditioning methods based on incomplete factorizations and also polynomial preconditioning based on truncated Neumann series is considered. As general heuristical conclusions it is stated that on circuit problems, approximate inverse techniques can be more effective than incomplete factorizations, while the reverse is more often true for all other problems. The wealth of experiments performed on a Cray C98 whose conclusions are summarized in the paper could prove very useful for those practitioners mentioned above, by providing them with many practical guidelines. Some recent papers with similar objectives or that are a complement to those in this paper are mentioned in its extensive bibliography.
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
- Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations
- Numerical experiments with two approximate inverse preconditioners
- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- A parallel solver for large-scale Markov chains
- New methods for adapting and for approximating inverses as preconditioners
- Wavelet sparse approximate inverse preconditioners
- The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems
- Factorized sparse approximate inverses for preconditioning
- Vaidya's preconditioners: Implementation and experimental study
- A comparative study on dynamic and static sparsity patterns in parallel sparse approximate inverse preconditioning
- Factorized sparse approximate inverse preconditionings. III: Iterative construction of preconditioners
- H-FAINV: hierarchically factored approximate inverse preconditioners
- A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
- A block version algorithm to approximate inverse factors
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Polynomial preconditioners based on factorized sparse approximate inverses
- Preconditioning techniques for large linear systems: A survey
- Recursive two-level ILU preconditioner for nonsymmetric M-matrices
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics
- A generalization of the optimal diagonal approximate inverse preconditioner
- Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
- Supporting theory for a block approximate inverse preconditioner
- On the preconditioners for fast multipole boundary element methods for 2D multi-domain elastostatics
- Generalized approximate inverse preconditioners for least squares problems
- Distributed algebraic tearing and interconnecting techniques
- Fast methods for computing centroidal Voronoi tessellations
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
- On the capabilities of the polynomial chaos expansion method within SFE analysis -- an overview
- Towards a complete FEM-based simulation toolkit on GPUs: unstructured grid finite element geometric multigrid solvers with strong smoothers based on sparse approximate inverses
- Improving approximate inverses based on Frobenius norm minimization
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- Optimal regularized low rank inverse approximation
- AINV and BILUM preconditioning techniques
- Rapid calculation of large-scale acoustic scattering from complex targets by a dual-level fast direct solver
- Balanced incomplete factorization preconditioner with pivoting
- On relaxed nested factorization and combination preconditioning
- Regularized computation of approximate pseudoinverse of large matrices using low-rank tensor train decompositions
- Factorized approximate inverses with adaptive dropping
- A block sparse approximate inverse with cutoff preconditioner for semi-sparse linear systems derived from molecular orbital calculations
- Three optimization models for multisplitting preconditioner
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices.
- Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models
- Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid
- A power sparse approximate inverse preconditioning procedure for large sparse linear systems
- Kronecker product approximation preconditioners for convection-diffusion model problems
- Data mining and prediction of SAI type matrix preconditioner
- Sparse approximate inverse preconditioner for contact problems on the Earth Simulator using OpenMP
- A two-level sparse approximate inverse preconditioner for unsymmetric matrices
- Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations
- ILU preconditioning based on the FAPINV algorithm
- A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
- On sparse approximate inverse matrix techniques and Evans preconditions methods
- On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
- An assessment of some preconditioning techniques in shell problems
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A parallel wavelet-based algebraic multigrid black-box solver and preconditioner
- A Block Constant Approximate Inverse for Preconditioning Large Linear Systems
- Numerical Methods for Large-Scale Lyapunov Equations with Symmetric Banded Data
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- Comparison of approximate inverse preconditioners for the fractional step Navier-Stokes equations
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
- AILU: a preconditioner based on the analytic factorization of the elliptic operator
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Revisiting the matrix-free solution of Markov regenerative processes.
- A probing method for computing the diagonal of a matrix inverse.
- On eigenvalue distribution of constraint-preconditioned symmetric saddle point matrices.
- Block regularization Kaczmarz method
- Об одной вычислительной реализации блочного метода Гаусса-Зейделя для нормальных систем уравнений
- A class of symmetric factored approximate inverses and hybrid two-level solver
- Preconditioning parametrized linear systems
- Sparse Cholesky Factorization by Kullback--Leibler Minimization
- scientific article; zbMATH DE number 7616072 (Why is no real title available?)
- Geometrical inverse preconditioning for symmetric positive definite matrices
- A class of approximate inverse preconditioners for solving linear systems
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Fast solvers for charge distribution models on shared memory platforms
- A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units
- Numerical solution of a regularized weighted mean curvature flow problem for electrical conductivity imaging
- Fine-grained parallel incomplete LU factorization
- FSAIPACK: a software package for high-performance factored sparse approximate inverse preconditioning
- A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
- Approximate inverse computation using Frobenius inner product
- Preconditioning with direct approximate factoring of the inverse
- Smoothing and regularization with modified sparse approximate inverses
- An Implicit Wavelet Sparse Approximate Inverse Preconditioner
- Accelerated preconditioner updates for solving shifted linear systems
- New updates of incomplete LU factorizations and applications to large nonlinear systems
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Learning Optimal Multigrid Smoothers via Neural Networks
- A novel method for the numerical solution of a hybrid inverse problem of electrical conductivity imaging
- Efficient solution for Galerkin-based polynomial chaos expansion systems
Uses Software
This page was built for publication: A comparative study of sparse approximate inverse preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294601)
