Geometric Classical MultiGrid - PowerPoint PPT Presentation

About This Presentation
Title:

Geometric Classical MultiGrid

Description:

averaging. Linear scalar elliptic PDE. 1 dimension Laplace equation ... Can be well expressed by less variables. Use a coarser level (by choosing every other ... – PowerPoint PPT presentation

Number of Views:46
Avg rating:3.0/5.0
Slides: 16
Provided by: wisdomWe
Category:

less

Transcript and Presenter's Notes

Title: Geometric Classical MultiGrid


1
Geometric (Classical) MultiGrid
2
Linear scalar elliptic PDE (Brandt 1971)
  • 1 dimension Poisson equation
  • Discretize the continuum

3
Linear scalar elliptic PDE
  • 1 dimension Laplace equation
  • Second order finite difference approximation
  • gt Solve a linear system of equations
  • Not directly, but iteratively
  • gt Use Gauss Seidel pointwise relaxation

4
(No Transcript)
5
The basic observations of ML
  • Just a few relaxation sweeps are needed to
    converge the highly oscillatory components of the
    error
  • gt the error is smooth
  • Can be well expressed by less variables
  • Use a coarser level (by choosing every other
    line) for the residual equation
  • Smooth component on a finer level becomes more
    oscillatory on a coarser level
  • gt solve recursively
  • The solution is interpolated and added

6
TWO GRID CYCLE
Fine grid equation
1. Relaxation
Approximate solution
Smooth error
Residual equation
residual
2. Coarse grid equation
Approximate solution

3. Coarse grid correction
4. Relaxation
7
(No Transcript)
8
TWO GRID CYCLE
MULTI-GRID CYCLE
Fine grid equation
1
1. Relaxation
Approximate solution
Smooth error
Residual equation
2
residual
2. Coarse grid equation
3
4
Approximate solution
by recursion


5



h
h
3. Coarse grid correction
u
u
old
new
6
4. Relaxation
Correction Scheme
9
V-cycle V(n1,n2)
residual transfer
enough sweeps or direct solver
relaxation sweeps

10
G1
G1
Apply grids in all scales 2x2, 4x4,
, n1/2xn1/2
G2
G2
Solve the large systems of equations by multigrid!
G3
G3
Gl
Gl
Hierarchy of graphs
11
Linear (2nd order) interpolation in 1D
F(x)
x1
x2
x
12
Bilinear interpolation
(Urt,Vrt)
(Ult,Vlt)
(x2,y2)
(x1,y2)
i
(x0,y0)
S(i)
(x2,y1)
(x1,y1)
(Ulb,Vlb)
(Urb,Vrb)
C(S(i))rb,rt,lb,lt
13
(Urt,Vrt)
(Ult,Vlt)
(x2,y2)
(x1,y2)
i
(Ul,Vl)
(Ur,Vr)
(x0,y0)
S(i)
(x2,y1)
(x1,y1)
(Ulb,Vlb)
(Urb,Vrb)
14
From (x,y) to (U,V) by bilinear intepolation
15
The fine and coarse Lagrangians
  • For each square k add an equi-density constraint
  • eqd(k) current area fluxes of in/out areas

  • allowed area 0
  • is the bilinear interpolation from grid 2h to
    grid h
  • At the end of the V-cycle interpolate back to
    (x,y)
Write a Comment
User Comments (0)
About PowerShow.com