A Block Constant Approximate Inverse for Preconditioning Large Linear Systems
approximate inversecomparison of methodselliptic boundary value problemsfast multipole methodsincompelte Cholesky factorizationiterative methodmultigrid methodsnumerical examplespreconditioning
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
The authors propose a new class of approximate inverses for preconditioning large linear systems issued from the discretization of elliptic boundary value problems. The method proposed here is situated at the intersection of multipole, multigrid and sparse approximate inverse methods, and consists in approximating the inverse of a matrix \(A\) by a block constant matrix. An approximate inverse for preconditioning an iterative method is determined, following the multipole strategy, i.e. approximating the off-diagonal blocks of the inverse by low-rank matrices using the Green function. The block constant preconditioner is compared to a sparse approximate inverse with the same sparsity pattern as \(A\), and to the incomplete Cholesky factorization. A lot of numerical examples is performed which illustrate the proposed methods
- A multipole approach for preconditioners
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
- Preconditioning with direct approximate factoring of the inverse
- Explicit approximate inverse preconditioning techniques
- A comparative study of sparse approximate inverse preconditioners
- Approximate inverses of multidiagonal matrices and application to the block PCG method
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
- A fast multipole boundary element method for 3D multi-domain acoustic scattering problems based on the Burton-Miller formulation
- A block sparse approximate inverse with cutoff preconditioner for semi-sparse linear systems derived from molecular orbital calculations
- Fully vectorizable block preconditionings with approximate inverses for non-symmetric systems of equations
- A multipole approach for preconditioners
- Geometrical inverse preconditioning for symmetric positive definite matrices
- A scalable approximate inverse block preconditioner for an incompressible magnetohydrodynamics model problem
- scientific article; zbMATH DE number 7777281 (Why is no real title available?)
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
This page was built for publication: A Block Constant Approximate Inverse for Preconditioning Large Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443776)