Christian Rohde

David Seus, Florin A. Radu, Christian Rohde

This article is a follow up of our submitted paper [11] in which a decomposition of the Richards equation along two soil layers was discussed. A decomposed problem was formulated and a decoupling and linearisation technique was presented to solve the problem in each time step in a fixed point type iteration. This article extends these ideas to the case of two-phase in porous media and the convergence of the proposed domain decomposition method is rigorously shown.

Jan Giesselmann, Fabian Meyer, Christian Rohde

In this article we present an a posteriori error estimator for the spatial-stochastic error of a Galerkin-type discretisation of an initial value problem for a random hyperbolic conservation law. For the stochastic discretisation we use the Stochastic Galerkin method and for the spatial-temporal discretisation of the Stochastic Galerkin system a Runge-Kutta Discontinuous Galerkin method. The estimator is obtained using smooth reconstructions of the discrete solution. Combined with the relative entropy stability framework of Dafermos \cite{dafermos2005hyperbolic}, this leads to computable error bounds for the space-stochastic discretisation error. Moreover, it turns out that the error estimator admits a splitting into one part representing the spatial error, and a remaining term, which can be interpreted as the stochastic error. This decomposition allows us to balance the errors arising from spatial and stochastic discretisation. We conclude with some numerical examples confirming the theoretical findings.

Jan Giesselmann, Fabian Meyer, Christian Rohde

In this article we consider one-dimensional random systems of hyperbolic conservation laws. We first establish existence and uniqueness of random entropy admissible solutions for initial value problems of conservation laws which involve random initial data and random flux functions. Based on these results we present an a posteriori error analysis for a numerical approximation of the random entropy admissible solution. For the stochastic discretization, we consider a non-intrusive approach, the Stochastic Collocation method. The spatio-temporal discretization relies on the Runge--Kutta Discontinuous Galerkin method. We derive the a posteriori estimator using continuous reconstructions of the discrete solution. Combined with the relative entropy stability framework this yields computable error bounds for the entire space-stochastic discretization error. The estimator admits a splitting into a stochastic and a deterministic (space-time) part, allowing for a novel residual-based space-stochastic adaptive mesh refinement algorithm. We conclude with various numerical examples investigating the scaling properties of the residuals and illustrating the efficiency of the proposed adaptive algorithm.

Qian Huang, Simon Görtz, Paul Hollmann et al.

We consider the statistics for the vorticity field in two-dimensional homogeneous isotropic turbulence (HIT). First, we exploit the invariance properties to derive dimensionally reduced governing equations for the one-point and two-point probability density functions (PDFs). These take the form of linear kinetic transport equations, but with an unclosed operator in terms of a conditional average. To solve the PDF equation numerically we suggest a hybrid data-driven method that relies on carefully selected samples of DNS data and a sampling estimator for the conditional average. The method is applied to DNS data for both decaying and forced HIT, demonstrating good agreement with the direct evaluation of the PDFs using the DNS data.

Jim Magiera, Christian Rohde

To describe complex flow systems accurately, it is in many cases important to account for the properties of fluid flows on a microscopic scale. In this work, we focus on the description of liquid-vapor flow with a sharp interface between the phases. The local phase dynamics at the interface can be interpreted as a Riemann problem for which we develop a multiscale solver in the spirit of the heterogeneous multiscale method, using a particle-based microscale model to augment the macroscopic two-phase flow system. The application of a microscale model makes it possible to use the intrinsic properties of the fluid at the microscale, instead of formulating (ad-hoc) constitutive relations.

Anna Schwarz, Jens Keim, Christian Rohde et al.

High-order methods offer superior dispersion and dissipation properties compared to low-order schemes but require robust stabilization for discontinuities. To ensure stability, local artificial viscosity is common, but often degrades sub-element resolution. Conversely, subcell resolution preserving limiting strategies such as the finite volume subcell method are typically restricted to uniform topologies, such as purely hexahedral, or simplex meshes. This leaves a significant gap in treating the hybrid-element topologies necessary for complex engineering geometries. This paper presents a robust shock-capturing approach for the discontinuous Galerkin spectral element method on mixed curvilinear meshes containing hexahedral, prismatic, tetrahedral, and pyramid elements. Non-hexahedral elements are handled via collapsed coordinate transformations. The proposed method utilizes an h-adaptive finite volume subcell scheme with arbitrary subcell resolution; 2N + 1 in this work. The schemes essential properties, including conservation, spatial convergence, and the shock capturing capabilities are verified. Finally, the method's applicability to complex configurations is demonstrated through a simulation of the flow around a NACA 0012 airfoil.

Jim Magiera, Deep Ray, Jan S. Hesthaven et al.

Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtain reliable results. However, standard machine learning algorithms are generally not tailored to respect such constraints. We propose two different strategies to generate constraint-aware neural networks. We test their performance in the context of front-capturing schemes for strongly nonlinear wave motion in compressible fluid flow. Precisely, in this context so-called Riemann problems have to be solved as surrogates. Their solution describes the local dynamics of the captured wave front in numerical simulations. Three model problems are considered: a cubic flux model problem, an isothermal two-phase flow model, and the Euler equations. We demonstrate that a decrease in the constraint deviation correlates with low discretization errors for all model problems, in addition to the structural advantage of fulfilling the constraint.

Alaa Armiti-Juber, Christian Rohde

We study a nonlinear fourth-order extension of Richards' equation that describes infiltration processes in unsaturated soils. We prove the well-posedness of the fourth-order equation by first applying Kirchhoff's transformation to linearize the higher-order terms. The transformed equation is then discretized in time and space and a set of a priori estimates is established. These allow, by means of compactness theorems, extracting a unique weak solution. Finally, we use the inverse of Kirchhoff's transformation to prove the well-posedness of the original equation.

David Seus, Koondanibha Mitra, Iuliu Sorin Pop et al.

The Richards equation is a nonlinear parabolic equation that is commonly used for modelling saturated/unsaturated flow in porous media. We assume that the medium occupies a bounded Lipschitz domain partitioned into two disjoint subdomains separated by a fixed interface $Γ$. This leads to two problems defined on the subdomains which are coupled through conditions expressing flux and pressure continuity at $Γ$. After an Euler implicit discretisation of the resulting nonlinear subproblems a linear iterative ($L$-type) domain decomposition scheme is proposed. The convergence of the scheme is proved rigorously. In the last part we present numerical results that are in line with the theoretical finding, in particular the unconditional convergence of the scheme. We further compare the scheme to other approaches not making use of a domain decomposition. Namely, we compare to a Newton and a Picard scheme. We show that the proposed scheme is more stable than the Newton scheme while remaining comparable in computational time, even if no parallelisation is being adopted. Finally we present a parametric study that can be used to optimize the proposed scheme.