M

Multigrid method

Method of solving system of linear algebrayes equations based on the use of a sequence of decreasing grids and operator

In numerical analysis, a multigrid method (MG method) is an algorithm for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in problems exhibiting multiple scales of behavior.

Nº Q1413101 ★

Común · Historia

Multigrid method

Method of solving system of linear algebrayes equations based on the use of a sequence of decreasing grids and operator

Texto en inglés

In numerical analysis, a multigrid method (MG method) is an algorithm for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in problems exhibiting multiple scales of behavior.

Último precio

—

Precio mínimo

—

Mediana 7 d

—

Ventas 30 d

0

Rango 30 d

—

En circulación

0

Cotización

Ver tabla
Fechamediana MínMáxventas

Historial de ventas

Última venta
—
Media 30 d
—
Mínimo 30 d
—
Máximo 30 d
—
Ventas 7 d
0
Ventas 30 d
0

Aún no hay ventas.

Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

In numerical analysis, a multigrid method (MG method) is an algorithm for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in 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. 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 (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 coarse problem. 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 elliptic partial differential equations in two or more dimensions. 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. 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...

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Ver la ficha

Confirmación