Note on the multigrid \(W\)-cycle (Q1375456)
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: Note on the multigrid \(W\)-cycle |
scientific article; zbMATH DE number 1100620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the multigrid \(W\)-cycle |
scientific article; zbMATH DE number 1100620 |
Statements
Note on the multigrid \(W\)-cycle (English)
0 references
28 January 1998
0 references
The note presents a theorem which shows the equivalence of two multigrid algorithms. Both of them solve sparse linear systems by the multigrid \(W\)-cycle implemented with Galerkin schemes. It is shown that the above equivalence is based on the fact that the recalculation of the fine-level residual in the middle of the classical \(W\)-cycle can be deleted.
0 references
Galerkin method
0 references
multigrid algorithms
0 references
multigrid \(W\)-cycle
0 references
