Modified Berger-Oliger Algorithm

27

Modified Berger-Oliger Algorithm

• if regridding time and l < L then
  • regrid on all existing levels l� � l
  • recompose Gl+1..l*j (transfer old l� � l values and prolongations from parents
  • recompose Sl..l*-1j and reinitialize Sl-1j via restriction from Glj
• end if

Previous slide

Next slide

Back to the first slide

View Graphic Version

27