Multigrid method

Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. The typical application for multigrid is in the numerical solution of elliptic partial differential equations in two or more dimensions.

MG can be applied in combination with any of the common discretization techniques. In these cases, multigrid is among the fastest solution techniques known today. In contrast to other methods, multigrid is general in that it can treat arbitrary regions and boundary conditions. It does not depend on the separability of the equations or other special properties of the equation. MG is also directly applicable to more-complicated non-symmetric and nonlinear systems of equations, like the Lamé system of elasticity or the Navier-Stokes equations.

Multigrid can be generalized in many different ways. It can be applied naturally in a time-stepping solution of parabolic equations, or it can be applied directly to time-dependent partial differential equations. Research on multilevel techniques for hyperbolic equations is under way. Multigrid can also be applied to integral equations, or for problems in statistical physics.

Other extensions of multigrid include techniques where no PDE and no geometrical problem background is used to construct the multilevel hierarchy. Such algebraic multigrid methods (AMG) construct their hierarchy of operators directly from the system matrix and thus become true black-box solvers for sparse matrices.

Convergence rate

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 ${\displaystyle i}$  with a given grid point density ${\displaystyle N_{i}}$ . Assume furthermore that a solution on any grid ${\displaystyle N_{i}}$  may be obtained with a given effort ${\displaystyle W_{i}=\rho KN_{i}}$  from a solution on a coarser grid ${\displaystyle i+1}$  with grid point density ${\displaystyle N_{i+1}=\rho N_{i}}$  (that is, ${\displaystyle K}$  is not dependent on ${\displaystyle i}$ ).

Using the geometric series, we then find for the effort involved in finding the solution on the finest grid ${\displaystyle N_{1}}$ 

${\displaystyle W_{1}=W_{2}+\rho KN_{1}}$ 

${\displaystyle W_{1}=W_{3}+\rho ^{2}KN_{1}+\rho KN_{1}}$ 

${\displaystyle W_{1}/(KN_{1})+1=1+\sum _{p}\rho ^{p}}$ 

${\displaystyle W_{1}/(KN_{1})+1=1/(1-\rho )}$ 

${\displaystyle W_{1}=(KN_{1})(1/(1-\rho )-1),}$ 

that is, a solution may be obtained in ${\displaystyle O(N)}$  time.

See also

• Numerical analysis
• Partial differential equation
• Finite element method
• Finite difference

References and external links

• Brandt, A. 'Multi-Level Adaptive Solutions to Boundary-Value Problems', Math. Comp, 1977(31), 333-390 (jstor link).
• MGNet: a repository for multigrid and other methods
• A multigrid tutorial, ISBN 0-89871-462-1
• Introduction to Algebraic Multigrid