Single-level multigrid (Q1109540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single-level multigrid |
scientific article; zbMATH DE number 4070235
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-level multigrid |
scientific article; zbMATH DE number 4070235 |
Statements
Single-level multigrid (English)
0 references
1988
0 references
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.
0 references
single-level multigrid
0 references
multigrid algorithm
0 references
fast solution
0 references
unigrid
0 references
one- sided V-cycle
0 references
0 references
0.7587178349494934
0 references
0.7464892864227295
0 references
0.7454580664634705
0 references
