Geometric Multigrid Methods

Sunday, November 28, 2010 - 9:00am - 10:30am
Keller 3-180
Susanne Brenner (Louisiana State University)
Geometric multigrid methods solve an elliptic boundary value

problem on a sequence of grids generated by a refinement

procedure.  They have optimal complexity in the sense that

the computational cost is proportional to the number of

unknowns.  In this tutorial we will introduce various

multigrid algorithms (V-cycle, W-cycle, F-cycle, etc.)

and discuss their convergence analysis.