Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves

DOI10.1137/080728871zbMATH Open1410.76149OpenAlexW2074048905MaRDI QIDQ3079331FDOQ3079331

Authors: Christian Böck, Johannes Schwaiger, Csaba Vigh, Michael Bader 

Publication date: 2 March 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080728871

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

zbMATH Keywords

discontinuous Galerkin methodshallow water equationsspace-filling curvesdynamic remeshingmemory-efficient algorithmsSierpiński curvesimulation on adaptive grids

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Finite element methods applied to problems in fluid mechanics (76M10) Waves for incompressible viscous fluids (76D33)

Cited In (5)

• RKDG2 shallow-water solver on non-uniform grids with local time steps: application to 1D and 2D hydrodynamics
• New computational methods in tsunami science
• Fast Mesh-to-Mesh Remaps Using Hash Algorithms
• Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
• Dynamically adaptive lattice Boltzmann simulation of shallow water flows with the Peano framework

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)