# Algebraic multigrid - AMG

(Difference between revisions)
 Revision as of 04:50, 3 October 2005 (view source)Zxaar (Talk | contribs)← Older edit Latest revision as of 08:14, 18 September 2006 (view source) (→Algebraic Multigrid (AMG)) (3 intermediate revisions not shown) Line 1: Line 1: ==Algebraic Multigrid (AMG) == ==Algebraic Multigrid (AMG) == - This algorithm is referred to as an '''algebraic multigrid''' scheme because the coarse level equations are generated without the use of any geometry or re-discretization on the coarse levels. This has advantage that no coarse level grids have to be generated or stored, and no fluxes or source terms need be calculated on the coarse levels. This feature makes AMG particularly important for use on unstructured meshes. + This algorithm is referred to as an '''algebraic multigrid''' scheme because the coarse level equations are generated without the use of any geometry or re-discretization on the coarse levels. This has the advantage that no coarse level grids have to be generated or stored, and no fluxes or source terms need be calculated on the coarse levels. This feature makes AMG particularly important for use on unstructured meshes. When using AMG, once the system is linearized, non-linearities are not felt by the solver until the fine level operator is next updated. When using AMG, once the system is linearized, non-linearities are not felt by the solver until the fine level operator is next updated. Line 28: Line 28: This gives the coarse level operator as:
This gives the coarse level operator as:
:$A^H = R A P$ :$A^H = R A P$ + + == Multigrid Cycles == + + + + ---- + Return to [[Numerical methods | Numerical Methods]]

## Algebraic Multigrid (AMG)

This algorithm is referred to as an algebraic multigrid scheme because the coarse level equations are generated without the use of any geometry or re-discretization on the coarse levels. This has the advantage that no coarse level grids have to be generated or stored, and no fluxes or source terms need be calculated on the coarse levels. This feature makes AMG particularly important for use on unstructured meshes. When using AMG, once the system is linearized, non-linearities are not felt by the solver until the fine level operator is next updated.

## Restriction and Prolongation Operators

The restriction and prolongation or inter-level transfer is accomplished by piecewise constant interpolation and prolongation. The defect in any coarse level cell is given by the sum of those from the fine level cells it contains, while fine level corrections are obtained by injection of coarse level values. That is the prolongation operator is given by the transpose of the restriction operator as:

$P = R^T$

## Coarse Level Operator

The coarse level operator can be constructed using a Galerkin approach. In Galerkin approach we require that the defect associated with the corrected fine level solution must become zero when transferred back to the coarse level. Hence:

$R d^{\rm new} = 0$  ; where d is defect.

We can further write:

$R \left[A \phi^{\rm new} + b \right] = 0$
$R \left[A \left(\phi + P \psi^H\right) + b\right] = 0$

Or:

$R A P \psi^H + R \left(A \phi + b\right) = 0$
$R A P \psi^H + R d = 0$

This gives the coarse level operator as:

$A^H = R A P$