Algebraic multigrid methods based on element preconditioning
DOI10.1080/00207160108805133zbMath1027.65169OpenAlexW2117562284MaRDI QIDQ2776796
Joachim Schöberl, Ulrich Langer, Gundolf Haase, Stefan Reitzinger
Publication date: 19 June 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805133
algorithmsnumerical experimentsfinite elementconjugate gradient methodsparse matrixalgebraic multigridsecond order elliptic equationpreconditioning stiffness matrix
Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) 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)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Additive multilevel preconditioners based on bilinear interpolation, matrix-dependent geometric coarsening and algebraic multigrid coarsening for second-order elliptic PDEs
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- Algebraic multigrid theory: The symmetric case
- Towards algebraic multigrid for elliptic problems of second order
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- The non-overlapping domain decomposition multiplicative schwarz method
This page was built for publication: Algebraic multigrid methods based on element preconditioning