Multigrid

In mathematics, more specifically in numerical analysis, multigrid methods are a group of algorithms for solving differential equations using a hierarchy of discretizations. This approach has the advantage over other methods that it scales linearly with the number of discrete nodes used.

In order for the multigrid methods to be applicable, one needs to make several assumptions. 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 N_i. Assume furthermore that a solution on any grid N_i may be obtained with a given effort W_i = ρKN_i from a solution on a coarser grid i + 1 with grid point density N_{i + 1} = ρN_i (that is, K is not dependent on i).

Then, using the geometric series, we then find for the effort involved in finding the solution on the finest grid N₁

W₁ = W₂ + ρKN₁

W₁ = W₃ + ρ²KN₁ + ρKN₁

W1 / (KN1) + 1 = 1 +	∑	ρp
	p

W₁ / (KN₁) + 1 = 1 / (1 - ρ)

W₁ = (KN₁)(1 / (1 - ρ) - 1),

that is, a solution may be obtained in 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
• M. Holst and F. Saied, Multigrid and domain decomposition methods for electrostatics problems. Domain Decomposition Methods in Science and Engineering (Proceedings of the Seventh International Conference on Domain Decomposition Methods, October 27-30, 1993, The Pennsylvania State University) D. E. Keyes and J. Xu, eds., American Mathematical Society, Providence, 1995.
• A multigrid tutorial, ISBN 0-89871-462-1
• Introduction to Algebraic Multigrid