Multigrid method

In <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>, a multigrid method (MG method) is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for solving <a href="/facts/Differential_equation/9MGbE3Ca">differential equations</a> using a <a href="/facts/Hierarchy/mYJyqFrG">hierarchy</a> of <a href="/facts/Discretization/JvjSzwyk">discretizations</a>. They are an example of a class of techniques called <a href="/facts/Multiresolution_analysis/yQtKJuNx">multiresolution methods</a>, very useful in problems exhibiting <a href="/facts/Multiscale_modeling/PkxUJ6FN">multiple scales</a> of behavior. For example, many basic <a href="/facts/Relaxation_method/9tsBUvxs">relaxation methods</a> exhibit different rates of convergence for short- and long-wavelength components, suggesting these different scales be treated differently, as in a <a href="/facts/Fourier_analysis/sUA8JP6q">Fourier analysis</a> approach to multigrid. MG methods can be used as solvers as well as <a href="/facts/Preconditioner/MUvFta7g">preconditioners</a>.
The main idea of multigrid is to accelerate the convergence of a basic iterative method (known as relaxation, which generally reduces short-wavelength error) by a global correction of the fine grid solution approximation from time to time, accomplished by solving a <a href="/facts/Coarse_problem/UIpkMnY0">coarse problem</a>. The coarse problem, while cheaper to solve, is similar to the fine grid problem in that it also has short- and long-wavelength errors. It can also be solved by a combination of relaxation and appeal to still coarser grids. This recursive process is repeated until a grid is reached where the cost of direct solution there is negligible compared to the cost of one relaxation sweep on the fine grid. This multigrid cycle typically reduces all error components by a fixed amount bounded well below one, independent of the fine grid mesh size. The typical application for multigrid is in the numerical solution of <a href="/facts/Elliptic_partial_differential_equation/pQx2wB7V">elliptic partial differential equations</a> in two or more dimensions.
Multigrid methods can be applied in combination with any of the common discretization techniques. For example, the <a href="/facts/Finite_element_method/eUcfP1vn">finite element method</a> may be recast as a multigrid method. 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 <a href="/facts/Boundary_condition/QEfmUqmP">boundary conditions</a>. They do not depend on the <a href="/facts/Separable_partial_differential_equation/grsuzbv2">separability of the equations</a> or other special properties of the equation. They have also been widely used for more-complicated non-symmetric and nonlinear systems of equations, like the <a href="/facts/Linear_elasticity/pPLIvs7a">Lamé equations</a> of <a href="/facts/Elasticity_(physics)/wcJoIFg1">elasticity</a> or the <a href="/facts/Navier-Stokes_equations/48pQugEa">Navier-Stokes equations</a>.

Multigrid method open-in-new

Multigrid method