Modified Berger-Oliger Algorithm
25
Modified Berger-Oliger Algorithm
- Let Glj and Slj denote the base and shadow hierarchy
- j = grids at a particular level
- L = maximum number of levels of refinement
- l = level in the hierarchy
- l runs from 1 to L on Glj
- l runs from 0 to L-1 on Slj
- Slj is a precise 2:1 coarsening of Glj
- The update (integration) procedure is applied to both Glj and Slj.
- After re-gridding at level l, the level l-1 unknowns on Slj are re-initialized via restrictions from the level l values on Glj.
Notes:
25