Content deleted Content added
bypass disambiguation page |
m →Algorithm: en-dash for Gauss-Seidel |
||
Line 11:
== Algorithm ==
There are many variations of multigrid algorithms, but the common features are that a hierarchy of discretisations (grids) is considered. The important steps are:
* '''Smoothing''' – reducing high frequency errors, for example using a few iterations of the [[
* '''Restriction''' – downsampling the [[residual (numerical analysis)|residual]] error to a coarser grid.
* '''Prolongation''' – interpolating a correction computed on a coarser grid into a finer grid.
== Convergence rate ==
|