Numerical Study of Two Sparse AMG-methods
algebraic multigridfinite elementLagrange multipliersLaplace equationnumerical experimentspreconditioningSchur complementunstructured grids
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
The author studies the construction and the properties of sparse algebraic multigrid methods (AMG) for Schur complement approximation. The motivation of this study is that sparse AMG is a cheap and accurate way to compute approximations of Schur complements of matrices arising from discretizations of some symmetric and positive definite partial differential operators. The results from numerical experiments are presented in order to give an accurate qualitative information about the properties of the method. Basing on comparison of the sparse AMG method with the sparse BPX method of \textit{J. H. Bramble, J. E. Pasciak} and \textit{J. Xu} [Math. Comput. 55, 1-22 (1990; Zbl 0703.65076)], the author advice to use the sparse BPX for Laplace-like problems on structured meshes and AMG method for Schur complement approximation and for boundary Lagrange multiplier preconditioning for some more complex operators and problems on unstructured grids.
- A capacitance matrix method for Dirichlet problem on polygon region
- A Domain Decomposition Preconditioner Based on a Change to a Multilevel Nodal Basis
- A fictitious domain method for Dirichlet problem and applications
- A moving mesh fictitious domain approach for shape optimization problems
- A multilevel AINV preconditioner
- Algebraic multi-grid for discrete elliptic second-order problems
- Efficient iterative solvers for elliptic finite element problems on nonmatching grids
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- scientific article; zbMATH DE number 3900090 (Why is no real title available?)
- scientific article; zbMATH DE number 1222736 (Why is no real title available?)
- scientific article; zbMATH DE number 1269944 (Why is no real title available?)
- scientific article; zbMATH DE number 554673 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- Multilevel preconditioners for Lagrange multipliers in domain imbedding
- On the algebraic multigrid method
- Parallel Multilevel Preconditioners
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- The finite element method with Lagrangian multipliers
This page was built for publication: Numerical Study of Two Sparse AMG-methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4423107)