Note on the multigrid \(W\)-cycle (Q1375456): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q991113 |
||
| Property / reviewed by | |||
| Property / reviewed by: Marián Vajteršic / rank | |||
Revision as of 17:38, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the multigrid \(W\)-cycle |
scientific article |
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
