AMR

• We recently started work on an adaptive driver for the code, based upon an implementation of Berger and Oliger's (1984) AMR algorithm (without rotation of subgrids)

  • computational domain is dynamically decomposed into a hierarchy of overlapping, uniform grids
  • regridding via local truncation error estimates, using a �self-shadow� hierarchy
  • using a clusterer written by Reid Guenther, Mijan Huq and Dale Choi, based upon the signature-line algorithm of Berger and Rigoutsos (1991)

Previous slide

Next slide

Back to first slide

View graphic version