Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves
From MaRDI portal
Publication:3079331
Recommendations
- Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
- Parallel Memory-Efficient Adaptive Mesh Refinement on Structured Triangular Meshes with Billions of Grid Cells
- The shallow flow equations solved on adaptive quadtree grids
- Shallow flow simulation on dynamically adaptive cut cell quadtree grids
- A fast adaptive quadtree scheme for a two-layer shallow water model
Cited in
(6)- RKDG2 shallow-water solver on non-uniform grids with local time steps: application to 1D and 2D hydrodynamics
- New computational methods in tsunami science
- Evaluation of an efficient stack-RLE clustering concept for dynamically adaptive grids
- Fast mesh-to-mesh remaps using hash algorithms
- Dynamically adaptive lattice Boltzmann simulation of shallow water flows with the Peano framework
- Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
This page was built for publication: Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079331)