Multilevel Gauss-Seidel-algorithms for full and sparse grid problems
DOI10.1007/BF02238610zbMath0771.65084OpenAlexW1503816847MaRDI QIDQ2366295
Stefan Zimmer, Christoph Zenger, Michael Griebel
Publication date: 29 June 1993
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238610
sparse gridsmultigrid methodsparallelizationanisotropic problemssemidefinite systemblock-Gauss-Seidel iterationdomain-oriented multilevel methodsGauss-Seidel-algorithmshiearchical basispoint-oriented methods
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)
Related Items
Cites Work
- The hierarchical basis multigrid method
- A new multigrid approach to convection problems
- The frequency decomposition multi-grid method. I: Application to anisotropic equations
- On additive Schwarz preconditioners for sparse grid discretizations
- Multilevel Gauss-Seidel-algorithms for full and sparse grid problems
- The Improved Robustness of Multigrid Elliptic Solvers Based on Multiple Semicoarsened Grids
- Multilevel Algorithms Considered as Iterative Methods on Semidefinite Systems
- Nested Dissection of a Regular Finite Element Mesh
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item