DOE OSTI · 969012
Adaptive Multiresolution or Adaptive Mesh Refinement? A Case Study for 2D Euler Equations
Abstract
We present adaptive multiresolution (MR) computations of the two-dimensional compressible Euler equations for a classical Riemann problem. The results are then compared with respect to accuracy and computational efficiency, in terms of CPU time and memory requirements, with the corresponding finite volume scheme on a regular grid. For the same test-case, we also perform computations using adaptive mesh refinement (AMR) imposing similar accuracy requirements. The results thus obtained are compared in terms of computational overhead and compression of the computational grid, using in addition either local or global time stepping strategies. We preliminarily conclude that the multiresolution techniques yield improved memory compression and gain in CPU time with respect to the adaptive mesh refinement method.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Deiterding, Ralf, Domingues, Margarete O., Gomes, Sonia M., Roussel, Olivier, Schneider, Kai. 2009-01-01. Adaptive Multiresolution or Adaptive Mesh Refinement? A Case Study for 2D Euler Equations. https://www.osti.gov/biblio/969012
Cite the original work for its findings. Save a collection to share your selection of sources.