Content deleted Content added
Brews ohare (talk | contribs) re-order sections |
Brews ohare (talk | contribs) →Algorithm: add in-line source |
||
Line 10:
== Algorithm ==
There are many variations of multigrid algorithms, but the common features are that a hierarchy of discretizations (grids) is considered. The important steps are:<ref name=Wesseling>{{cite book |title=An Introduction to Multigrid Methods |author=P Wesseling |year=1992 |publisher=Wiley |isbn= 0471930830 |url=http://books.google.com/books?id=ywOzQgAACAAJ&dq=isbn:0471930830&lr=&as_drrb_is=q&as_minm_is=0&as_miny_is=&as_maxm_is=0&as_maxy_is=&as_brr=0}}</ref>
* '''Smoothing''' – reducing high frequency errors, for example using a few iterations of the [[Gauss–Seidel method]].
* '''Restriction''' – downsampling the [[residual (numerical analysis)|residual]] error to a coarser grid.
| |||