scientific article; zbMATH DE number 3960917

From MaRDI portal
Publication:3729951





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729951)