Local refinement techniques for elliptic problems on cell-centered grids. III: Algebraic multilevel BEPS preconditioners
DOI10.1007/BF01385790zbMath0726.65137OpenAlexW1553070284MaRDI QIDQ804273
Richard E. Ewing, Panayot S. Vassilevski, Raytcho D. Lazarov
Publication date: 1991
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133559
finite differencescondition numbersoptimal rate of convergencelocal refinementcell-centered gridsV-cycle multilevel BEPS preconditioners
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) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of multilevel preconditioned iterative methods
- Multi-level domain decomposition methods
- On the multi-level splitting of finite element spaces
- A preconditioning technique for the efficient solution of problems with local grid refinement
- The hierarchical basis multigrid method
- A second order finite difference analog of the first biharmonic boundary value problem
- Algebraic Multilevel Preconditioning Methods, II
- Local Refinement Techniques for Elliptic Problems on Cell-Centered Grids I. Error Analysis
- A New Convergence Proof for the Multigrid Method Including the V-Cycle
- The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
- Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
- Local refinement techniques for elliptic problems on cell‐centered grids; II. Optimal order two‐grid iterative methods