Modified Berger-Oliger Algorithm

26

Modified Berger-Oliger Algorithm

• routine cycle[l,n]
  • # l = level of base hierarchy being updated
  • # n = time step on this level (relative to last parental step for l > 1, initial time for l = 1)
  • # l* = current finest level on Glj
  • # tl = integration time on level l on Glj
  • # tl = integration time on level l on Slj
  • # r = refinement factor

Previous slide

Next slide

Back to the first slide

View Graphic Version

26