Toward an Effective Sparse Approximate Inverse Preconditioner
condition numberfinite differencefinite elementnumerical resultsparallel computationperformancesparse approximate inverse preconditioners
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Parallel numerical computation (65Y05)
The author considers several techniques to improve the performance of so-called sparse approximate inverse preconditioners (SAIPs) \(M\) for matrices \(A\) derived from the finite difference, or the finite element discretization of partial differential equations. The SAIP matrix \(M\) should directly approximate \(A^{-1}\) in such a way that on the one hand the construction of \(M\) is not expansive, and on the other hand the preconditioning operation \(M*d\) (matrix \(\times\) vector) is cheap (i.e. \(M\) should be sparse) and the condition number of the preconditioned matrix \(MA\) is small. Since the \(i\)-th column of \(M\) should approximate the corresponding discrete Green's functions, one should incorporate some global coupling into the SAIP \(M\). The author proposes some refinement techniques that aim at a substantial improvement of the SAIPs for a wide class of problems. The numerical results given in the paper confirm these expected improvements.
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- Sparse approximate inverse smoothers for geometric and algebraic multigrid
- Wavelet sparse approximate inverse preconditioners
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Sparsity preserving optimal control of discretized PDE systems
- A robust adaptive algebraic multigrid linear solver for structural mechanics
- Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
- Scalable preconditioning for the stabilized contact mechanics problem
- Superresolution image reconstruction using fast inpainting algorithms
- On the Gauss, Cholesky and Householder algorithms
- Software rejuvenation for resource optimization based on explicit approximate inverse preconditioning
- Preconditioners for the resolution of the linear systems Ax=b
- Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
- Algebraic multigrid methods for elastic structures with highly discontinuous coefficients
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
- A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures
- Multiresolution approximate inverse preconditioners
- A convergence improvement of the BSAIC preconditioner by deflation
- A power sparse approximate inverse preconditioning procedure for large sparse linear systems
- Multilevel preconditioning and adaptive sparse solution of inverse problems
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning
- An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- scientific article; zbMATH DE number 1873440 (Why is no real title available?)
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A probing method for computing the diagonal of a matrix inverse.
- scientific article; zbMATH DE number 1406961 (Why is no real title available?)
- Preconditioning parametrized linear systems
- A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
- Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings
- An Implicit Wavelet Sparse Approximate Inverse Preconditioner
- Dirichlet degrees of freedom need not be eliminated
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
This page was built for publication: Toward an Effective Sparse Approximate Inverse Preconditioner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702239)