Colouring the discretization graphs arising in the multigrid method
DOI10.1016/0898-1221(91)90181-3zbMath0728.65094OpenAlexW2045258105MaRDI QIDQ805184
Publication date: 1991
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(91)90181-3
numerical experimentsfinite elementmultigrid methodtriangulation graphsgraph colouringslinear-time 6-, 5- and 4-colour algorithms
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) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)
Cites Work
- The four color proof suffices
- An adaptive, multi-level method for elliptic boundary value problems
- On the multi-grid method applied to difference equations
- The Use of Linear Graphs in Gauss Elimination
- Design and data structure of fully adaptive, multigrid, finite-element software
- Parallel Networks for Multi-Grid Algorithms: Architecture and Complexity
- Multicolor ICCG Methods for Vector Computers
- 25 pretty graph colouring problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Colouring the discretization graphs arising in the multigrid method