SearcharxivSearch

arXiv subjects

Kyle Mandli

Publications and source records attributed to Kyle Mandli.

5 recordsLinked to original sources

Learning the Exact Flux: Neural Riemann Solvers with Hard Constraints

Godunov-type methods, which obtain numerical fluxes through local Riemann problems at cell interfaces, are among the most fundamental and widely used numerical methods in computational fluid dynamics. Exact Riemann solvers faithfully solve the underlying equations, but can be computationally expensive due to the iterative root-finding procedures they often require. Consequently, most practical computations rely on classical approximate Riemann solvers, such as Rusanov and Roe, which trade accuracy for computational speed. Neural networks have recently shown promise as an alternative for approximating exact Riemann solvers, but most existing approaches are data-driven or impose weak constraints. This may result in problems with maintaining balanced states, symmetry breaking, and conservation errors when integrated into a Godunov-type scheme. To address these issues, we propose a hard-constrained neural Riemann solver (HCNRS) and enforce five constraints: positivity, consistency, mirror symmetry, Galilean invariance, and scaling invariance. Numerical experiments are carried out for the shallow water and ideal-gas Euler equations on standard benchmark problems. In the absence of hard constraints, violations of the well-balanced property, mass conservation, and symmetry are observed. Notably, in the Euler implosion problem, the exact Riemann solver with MUSCL-Hancock captures the jet structure well, whereas the Rusanov flux is too diffusive and smears it out. HCNRS accurately reproduces the solution obtained by the exact Riemann solver. In contrast, an unconstrained neural formulation lacks mirror symmetry, which makes the solution depend on the choice of flux normal direction. As a result, the jet is either shifted or lost, along with diagonal symmetry.

physics.comp-ph

Barrier Simulations and Experimental Calculations Using Cell Merging Method

We apply the cell merging method to a model shallow water problem with a permeable boundary. We use a cut cell approach which is more easily and systematically scalable with different shapes of boundaries. The novel cell merging method presented in this paper uses both wave propagation algorithm and gradient reconstruction for second order corrections, along with minmod and Barth-Jespersen limiters. We observe second order convergence in two model problems, one with a linear boundary and other with a composite, V-shaped boundary. We assess the effectiveness of these two boundaries by doing a realistic scenario including an island and observing inundation at the peak of the island.

math.NA

Barrier Simulations with Shallow Water Equations using the State Redistribution Method

The representation of small scale barriers, such as sea-walls, in coastal flooding simulations is a common computational constraint that can be difficult to overcome due to the combination of the need for resolution and the CFL constraining time stepping involved in solving the underlying PDE. This article proposes an approach that uses the state redistribution method (SRD) on shallow water equations to alleviate these problems while remaining conservative and geometrically easy to implement. We will demonstrate the method versus two other comparable approaches along with convergence results. In particular, we save computational time by reducing time steps fivefold when compared to simulation with same resolution using adaptive refinement at the barrier.

math.NA

ForestClaw: Hybrid forest-of-octrees AMR for hyperbolic conservation laws

We present a new hybrid paradigm for parallel adaptive mesh refinement (AMR) that combines the scalability and lightweight architecture of tree-based AMR with the computational efficiency of patch-based solvers for hyperbolic conservation laws. The key idea is to interpret each leaf of the AMR hierarchy as one uniform compute patch in $\sR^d$ with $m^d$ degrees of freedom, where $m$ is customarily between 8 and 32. Thus, computation on each patch can be optimized for speed, while we inherit the flexibility of adaptive meshes. In our work we choose to integrate with the p4est AMR library since it allows us to compose the mesh from multiple mapped octrees and enables the cubed sphere and other nontrivial multiblock geometries. We describe aspects of the parallel implementation and close with scalings for both MPI-only and OpenMP/MPI hybrid runs, where the largest MPI run executes on 16,384 CPU cores.

cs.MS

The GeoClaw software for depth-averaged flows with adaptive refinement

Many geophysical flow or wave propagation problems can be modeled with two-dimensional depth-averaged equations, of which the shallow water equations are the simplest example. We describe the GeoClaw software that has been designed to solve problems of this nature, consisting of open source Fortran programs together with Python tools for the user interface and flow visualization. This software uses high-resolution shock-capturing finite volume methods on logically rectangular grids, including latitude--longitude grids on the sphere. Dry states are handled automatically to model inundation. The code incorporates adaptive mesh refinement to allow the efficient solution of large-scale geophysical problems. Examples are given illustrating its use for modeling tsunamis, dam break problems, and storm surge. Documentation and download information is available at www.clawpack.org/geoclaw

physics.geo-ph