The Analysis of Smoothers for Multigrid Algorithms (Q4024671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 118388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Analysis of Smoothers for Multigrid Algorithms |
scientific article; zbMATH DE number 118388 |
Statements
10 February 1993
0 references
domain decomposition
0 references
Jacobi iteration
0 references
smoothing operators
0 references
multigrid methods
0 references
Gauss-Seidel iteration
0 references
The Analysis of Smoothers for Multigrid Algorithms (English)
0 references
0 references
0 references
0 references
0.9618163
0 references
0.9336711
0 references
0.9222389
0 references
0 references
0.91856277
0 references
0.90898263
0 references
0.90408444
0 references
The authors define and analyze smoothing operators for use in multigrid methods. The smoothing operators considered are based on subspace decomposition and include point, line and block versions of Jacobi and Gauss-Seidel iteration as well as generalizations. It is shown, that these smoothers will be effective in multigrid algorithms provided that the subspace decomposition satisfies two simple conditions, which may be trivial to verify in many applications.
0 references
