A parallel multilevel method for adaptively refined Cartesian grids with embedded boundaries

M. J. Aftosmis, M. J. Berger, G. Adomavicius

Research output: Contribution to conferencePaperpeer-review

113 Scopus citations


Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries show a computational speedup of 52 using 64 processors with the run-time mesh partitioner.

Original languageEnglish (US)
StatePublished - 2000
Event38th Aerospace Sciences Meeting and Exhibit 2000 - Reno, NV, United States
Duration: Jan 10 2000Jan 13 2000


Other38th Aerospace Sciences Meeting and Exhibit 2000
Country/TerritoryUnited States
CityReno, NV


Dive into the research topics of 'A parallel multilevel method for adaptively refined Cartesian grids with embedded boundaries'. Together they form a unique fingerprint.

Cite this