# Geometric multigrid - FAS

(Difference between revisions)
 Revision as of 05:11, 3 October 2005 (view source)Zxaar (Talk | contribs)← Older edit Revision as of 05:12, 3 October 2005 (view source)Zxaar (Talk | contribs) Newer edit → Line 5: Line 5: Geometric multigrid requires restriction of both the fine grid solution and its residual or defect to coarse level. The restriction operator that transfers the solution to the next coarser grid level can be formed using a full-approximation scheme. In this, the solution for a coarse cell is obtained by taking the volume average of the solution values in the embedded fine grid cells. Or by other means of weighting. Residuals for the coarse grid cell are obtained simply by summing the residuals in the embedded fine grid cells. Geometric multigrid requires restriction of both the fine grid solution and its residual or defect to coarse level. The restriction operator that transfers the solution to the next coarser grid level can be formed using a full-approximation scheme. In this, the solution for a coarse cell is obtained by taking the volume average of the solution values in the embedded fine grid cells. Or by other means of weighting. Residuals for the coarse grid cell are obtained simply by summing the residuals in the embedded fine grid cells. + + == Two grid Cycle == + The idea of geometric multigrid could be made clear by this two grid algorithm.

## Geometric Multigrid or (FAS)

In Geometric multigrid a hierarchy of meshes is generated.The discretized equations are evaluated on every level. The advantage of geometric multigrid over algebraic multigrid is that the former should perform better for non-linear problems since non-linearities in the system are carried down to the coarse levels through the re-discretization.

## Restriction and Prolongation Operators

Geometric multigrid requires restriction of both the fine grid solution and its residual or defect to coarse level. The restriction operator that transfers the solution to the next coarser grid level can be formed using a full-approximation scheme. In this, the solution for a coarse cell is obtained by taking the volume average of the solution values in the embedded fine grid cells. Or by other means of weighting. Residuals for the coarse grid cell are obtained simply by summing the residuals in the embedded fine grid cells.

## Two grid Cycle

The idea of geometric multigrid could be made clear by this two grid algorithm.