# Multigrid method

Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not limited to) problems exhibiting multiple scales of behavior. For example, many basic relaxation methods exhibit different rates of convergence for short- and long-wavelength components, suggesting these different scales be treated differently, as in a Fourier analysis approach to multigrid.[1] MG methods can be used as solvers as well as preconditioners.

The main idea of multigrid is to accelerate the convergence of a basic iterative method by global correction from time to time, accomplished by solving a coarse problem. This principle is similar to interpolation between coarser and finer grids. The typical application for multigrid is in the numerical solution of elliptic partial differential equations in two or more dimensions.[2]

Multigrid methods can be applied in combination with any of the common discretization techniques. For example, the finite element method may be recast as a multigrid method.[3] In these cases, multigrid methods are among the fastest solution techniques known today. In contrast to other methods, multigrid methods are general in that they can treat arbitrary regions and boundary conditions. They do not depend on the separability of the equations or other special properties of the equation. They are also directly applicable to more-complicated non-symmetric and nonlinear systems of equations, like the Lamé system of elasticity or the Navier-Stokes equations.

## 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:[4][5]

• Smoothing – reducing high frequency errors, for example using a few iterations of the Gauss–Seidel method.
• Restriction – downsampling the residual error to a coarser grid.
• Interpolation or Prolongation – interpolating a correction computed on a coarser grid into a finer grid.

## Computational cost

This approach has the advantage over other methods that it often scales linearly with the number of discrete nodes used. That is: It can solve these problems to a given accuracy in a number of operations that is proportional to the number of unknowns.

Assume that one has a differential equation which can be solved approximately (with a given accuracy) on a grid i with a given grid point density Ni. Assume furthermore that a solution on any grid Ni may be obtained with a given effort Wi = ρKNi from a solution on a coarser grid i + 1. Here, ρ = Nj + 1 / Nj < 1 is the ratio of grid points on "neighboring" grids and is assumed to be constant throughout the grid hierarchy, and K is some constant modeling the effort of computing the result for one grid point.

The following recurrence relation is then obtained for the effort of obtaining the solution on grid k:

Wk = Wk + 1 + ρKNk

And in particular, we find for the finest grid N1 that

W1 = W2 + ρKN1

Combining these two expressions (and using Nk = ρk − 1N1) gives

$W_1 = K N_1 \sum_{p=0}^n \rho^p$

Using the geometric series, we then find (for finite n)

$W_1 < K N_1 \frac{1}{1 - \rho}$

that is, a solution may be obtained in O(N) time.

## Multigrid preconditioning

A multigrid method with an intentionally reduced tolerance can be used as an efficient preconditioner for an external iterative solver. The solution may still be obtained in O(N) time as well as in the case where the multigrid method is used as a solver. Multigrid preconditioning is used in practice even for linear systems. Its main advantage versus a purely multigrid solver is particularly clear for nonlinear problems, e.g., eigenvalue problems.

## Generalized multigrid methods

Multigrid methods can be generalized in many different ways. They can be applied naturally in a time-stepping solution of parabolic partial differential equations, or they can be applied directly to time-dependent partial differential equations.[6] Research on multilevel techniques for hyperbolic partial differential equations is underway.[7] Multigrid methods can also be applied to integral equations, or for problems in statistical physics.[8]

Other extensions of multigrid methods include techniques where no partial differential equation nor geometrical problem background is used to construct the multilevel hierarchy.[9] Such algebraic multigrid methods (AMG) construct their hierarchy of operators directly from the system matrix, and the levels of the hierarchy are simply subsets of unknowns without any geometric interpretation. Thus, AMG methods become true black-box solvers for sparse matrices. However, AMG is regarded as advantageous mainly where geometric multigrid is too difficult to apply.[10]

Another set of multiresolution methods is based upon wavelets. These wavelet methods can be combined with multigrid methods.[11][12] For example, one use of wavelets is to reformulate the finite element approach in terms of a multilevel method.[13]

Adaptive multigrid exhibits adaptive mesh refinement, that is, it adjusts the grid as the computation proceeds, in a manner dependent upon the computation itself.[14] The idea is to increase resolution of the grid only in regions of the solution where it is needed.

## Notes

1. ^ Roman Wienands, Wolfgang Joppich (2005). Practical Fourier analysis for multigrid methods. CRC Press. p. 17. ISBN 1584884924.
2. ^ U Trottenberg, CW Oosterlee, A Schüller (2001). Multigrid. Academic Press. ISBN 012701070X.
3. ^ Yu Zhu, Andreas C. Cangellaris (2006). Multigrid finite element methods for electromagnetic field modeling. Wiley. p. 132 ff. ISBN 0471741108.
4. ^ MT Heath (2002). "§ 11.5.7 Multigrid Methods". Scientific Computing: An Introductory Survey. McGraw-Hill Higher Education. p. 478 ff. ISBN 007112229X.
5. ^
6. ^ F Hülsemann, M Kowarschik., M Mohr and U Rüde (2006). "Parallel geometric multigrid". In Are Magnus Bruaset, Aslak Tveito. Numerical solution of partial differential equations on parallel computers. Birkhäuser. p. 165. ISBN 3540290761.
7. ^ For example,   and Achi Brandt and Rima Gandlin (2003). "Multigrid for Atmospheric Data Assimilation: Analysis". In Thomas Y. Hou, Eitan Tadmor. Hyperbolic problems: theory, numerics, applications : proceedings of the Ninth International Conference on Hyperbolic Problems of 2002. Springer. p. 369. ISBN 3540443339.
8. ^ Achi Brandt (2002). "Multiscale scientific computation: review". In Timothy J. Barth, Tony F. Chan, Robert Haimes. Multiscale and multiresolution methods: theory and applications. Springer. p. 53. ISBN 3540424202.
9. ^ Yair Shapira (2003). "Algebraic multigrid". Matrix-based multigrid: theory and applications. Springer. p. 66. ISBN 1402074859.
10. ^ U Trottenberg, CW Oosterlee, A Schüller. op. cit.. p. 417. ISBN 012701070X.
11. ^ Björn Engquist and Olof Runborg (2002). "Wavelet-based numerical homogenization with applications". In TJ Barth, TF Chan, R Hairns. Multiscale and Multiresolution Methods. Vol. 20 of Lecture notes in computational science and engineering. Springer. p. 140 ff. ISBN 3540424202.
12. ^
13. ^ Albert Cohen (2003). Numerical Analysis of Wavelet Methods. Elsevier. p. 44. ISBN 0444511245.
14. ^ U Trottenberg, CW Oosterlee, A Schüller. "Chapter 9: Adaptive Multigrid". op. cit.. p. 356. ISBN 012701070X.

## References

• G. P. Astrachancev (1971), An iterative method of solving elliptic net problems. USSR Comp. Math. Math. Phys.11, 171–182.
• N. S. Bakhvalov (1966), N. S., On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comp. Math. Math. Phis.6, 101–13.
• Achi Brandt (April 1977), "Multi-Level Adaptive Solutions to Boundary-Value Problems", Mathematics of Computation, 31: 333–90.
• William L. Briggs, Van Emden Henson, and Steve F. McCormick (2000), A Multigrid Tutorial (2nd ed.), Philadelphia: Society for Industrial and Applied Mathematics, ISBN 0-89871-462-1.
• R. P. Fedorenko (1961), A relaxation method for solving elliptic difference equations. USSR Comput. Math. Math. Phys. 1, p. 1092.
• R. P. Fedorenko (1964), The speed of convergence of one iterative process. USSR Comput. Math. Math. Phys. 4, p. 227.
• Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007). "Section 20.6. Multigrid Methods for Boundary Value Problems". Numerical Recipes: The Art of Scientific Computing (3rd ed.). New York: Cambridge University Press. ISBN 978-0-521-88068-8.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Method of lines — The method of lines (MOL, NMOL, NUMOL) (Schiesser, 1991; Hamdi, et al., 2007; Schiesser, 2009 ) is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized. MOL allows standard, general purpose… …   Wikipedia

• Additive Schwarz method — In mathematics, the additive Schwarz method, named after Hermann Schwarz, solves a boundary value problem for a partial differential equation approximately by splitting it into boundary value problems on smaller domains and adding the results.… …   Wikipedia

• Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically …   Wikipedia

• Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… …   Wikipedia

• Collocation method — In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations. The idea is to choose a finite dimensional space of candidate solutions… …   Wikipedia

• Discontinuous Galerkin method — Discontinuous Galerkin methods (DG methods) in mathematics form a class of numerical methods for solving partial differential equations. They combine features of the finite element and the finite volume framework and have been successfully… …   Wikipedia

• Schwarz alternating method — In mathematics, the Schwarz alternating method, named after Hermann Schwarz, is an iterative method to find the solution of a partial differential equations on a domain which is the union of two overlapping subdomains, by solving the equation on… …   Wikipedia

• Neumann–Dirichlet method — In mathematics, the Neumann–Dirichlet method is a domain decomposition preconditioner which involves solving Neumann boundary value problem on one subdomain and Dirichlet boundary value problem on another, adjacent across the interface between… …   Wikipedia

• Domain decomposition methods — Domain dec …   Wikipedia

• Практическое применение раскраски графов — Эту статью следует викифицировать. Пожалуйста, оформите её согласно правилам оформления статей. Раскраска графов практически применяется (постановку задачи различиных раскрасок здесь обсуждаться не будет) дл …   Википедия