Advanced | Help | Encyclopedia
Directory


Multigrid

This article should be merged into Multigrid method.
If you disagree with this request, please discuss it on the article's talk page.

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

Then, using the geometric series, we then find for the effort involved in finding the solution on the finest grid <math>N_1<math>

<math>W_1 = W_2 + \rho K N_1<math>
<math>W_1 = W_3 + \rho^2 K N_1 + \rho K N_1<math>
<math>W_1 / (K N_1) + 1 = 1 + \sum_p \rho^p <math>
<math>W_1 / (K N_1) + 1 = 1 / (1 – \rho)<math>
<math>W_1 = (K N_1) (1 / (1 – \rho) – 1),<math>

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

See also

References and external links








Links: Addme | Keyword Research | Paid Inclusion | Femail | Software | Completive Intelligence

Add URL | About Slider | FREE Slider Toolbar - Simply Amazing
Copyright © 2000-2008 Slider.com. All rights reserved.
Content is distributed under the GNU Free Documentation License.