A Block Constant Approximate Inverse for Preconditioning Large Linear Systems

DOI10.1137/S0895479802401515zbMath1036.65043OpenAlexW2001463213MaRDI QIDQ4443776

Alain Huard, Philippe Guillaume, Caroline Le Calvez

Publication date: 18 January 2004

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479802401515

zbMATH Keywords

comparison of methodsnumerical examplespreconditioningiterative methodmultigrid methodselliptic boundary value problemsapproximate inversefast multipole methodsincompelte Cholesky factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (3)

Geometrical inverse preconditioning for symmetric positive definite matrices ⋮ 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

This page was built for publication: A Block Constant Approximate Inverse for Preconditioning Large Linear Systems