l44 - Lecture 44 Cycling Strategies Example Problem 1 Last...

This preview shows pages 1–8. Sign up to view the full content.

1 Lecture 44: Cycling Strategies Example Problem

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Last Time … Completed the discussion of coefficient-based agglomeration strategy Discussed fixed and flexible cycling strategies for switching between coarse and fine levels
3 This Time … We will: Look at some pseudo code to write multigrid solvers easily Do an example problem using algebraic multigrid method

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Fixed Cycles: V Cycle In the down leg » Start with finest level. Do 1 G-S iterations (sweeps) » Restrict residuals to next coarse level. Do 1 G-S sweeps » Continue till coarsest level is reached Now start up leg » Prolongate corrections from coarsest level to next fine level. Do 2 G-S sweeps » Continue in this way to finest level This completes one MG V-cycle iteration
5 V Cycle (Cont’d) Gauss-Seidel Sweeps Restriction or Prolongation

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6 Fixed Cycles: W Cycle cycle » Apply V-cycle recursively times at each level W cycle can be thought of as a cycle with =2
7 Fixed Cycles: F Cycle Do the down leg and then apply V cycle once at each successive level

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 14

l44 - Lecture 44 Cycling Strategies Example Problem 1 Last...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online