Single-level multigrid
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
The author presents an interesting new implementation of the multigrid algorithm for fast solution of boundary value problems, which usually requires an extensive bookkeeping. An alternative implementation, unigrid [cf. \textit{S. F. McCormick} and \textit{J. W. Ruge}, Math. Comput. 41, 43-62 (1983; Zbl 0563.65065)] is suitable for development and testing, because it uses only one grid and is easy to program, but it is much less efficient. The present method implements an algorithm which is mathematically equivalent the one-sided V-cycle. It uses only one grid and it is almost as easy to program as unigrid while incurring only a negligible performance penalty in comparison with standard multigrid implementations.
This page was built for publication: Single-level multigrid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109540)