No label defined (Q3729951)
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 3960917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3960917 |
Statements
1983
0 references
multi-grid methods
0 references
multi-grid method
0 references
smoothing step
0 references
coarse-grid correction
0 references
iterative process
0 references
multi-grid iteration
0 references
nested iteration
0 references
0.8398250341415405
0 references
0.8274602890014648
0 references
0.8268142938613892
0 references
[For the entire collection see Zbl 0516.00027.] We describe multi-grid algorithms for solving discretized boundary value problems. The characteristic feature of the multi-grid method is the combination of a smoothing step and a coarse-grid correction. During the smoothing step the defect \((=residuum)\) is not necessarily decreased but ''smoothed''. By the following correction step the discrete solution is improved by means of an auxiliary equation in a coarser grid. It results an iterative process, that, usually, is very fast and effective. We introduce the multi-grid algorithm in {\S} 2 for a very simple boundary value problem, in order to explain the behaviour of the smoothing step and the coarse-grid correction. Moreover, we restrict our considerations to the case of two grids (two-grid method). The general multi-grid iteration is defined in {\S} 3. Usually, the multi-grid iteration is initialized in a special manner. This nested iteration technique is described in {\S} 6. The multigrid algorithm is not uniquely defined. The ''smoother'' applied in the smoothing step can be chosen suitably. The smoothing techniques are discussed in {\S} 4.
0 references