We present a graph-based numerical method for solving hyperbolic systems of conservation laws using discontinuous finite elements. This work fills important gaps in the theory as well as practice of graph-based schemes. In particular, four building blocks required for the implementation of flux-limited graph-based methods are developed and tested: a first-order method with mathematical guarantees of robustness; a high-order method based on the entropy viscosity technique; a procedure to compute local bounds; and a convex limiting scheme. Two important features of the current work are the fact that (i) boundary conditions are incorporated into the mathematical theory as well as the implementation of the scheme. For instance, the first-order version of the scheme satisfies pointwise entropy inequalities including boundary effects for any boundary data that is admissible; (ii) sub-cell limiting is built into the convex limiting framework. This is in contrast to the majority of the existing methodologies that consider a single limiter per cell providing no sub-cell limiting capabilities.
From a practical point of view, the implementation of graph-based methods is algebraic, meaning that they operate directly on the stencil of the spatial discretization. In principle, these methods do not need to use or invoke loops on cells or faces of the mesh. Finally, we verify convergence rates on various well-known test problems with differing regularity. We propose a simple test in order to verify the implementation of boundary conditions and their convergence rates.
Multi-level preconditioners for Discontinuous Galerkin (DG) discretizations are widely used to solve elliptic equations, and a main ingredient of such solvers is the interpolation operator to transfer information from the coarse to the fine grid. Classical interpolation operators give continuous interpolated values, but since DG solutions are naturally discontinuous, one might wonder if one should not use discontinuous interpolation operators for DG discretizations. We consider a discontinuous interpolation operator with a parameter that controls the discontinuity, and determine the optimal ch…
High-order entropy-stable discontinuous Galerkin methods for the compressible Euler and Navier-Stokes equations require the positivity of thermodynamic quantities in order to guarantee their well-posedness. In this work, we introduce a positivity limiting strategy for entropy-stable discontinuous Galerkin discretizations constructed by blending high order solutions with a low order positivity-preserving discretization. The proposed low order discretization is semi-discretely entropy stable, and the proposed limiting strategy is positivity preserving for the compressible Euler and Navier-Stokes…
Discontinuous Galerkin methods of higher order are applied as temporal discretizations for the transient Navier--Stokes equations. The spatial discretization based on inf-sup stable pairs of finite element spaces is stabilised using a one-level local projection stabilisation method. Optimal error bounds for the velocity with constants independent of the viscosity parameter are obtained for the semi-discrete case. For the fully discrete case, error estimates for both velocity and pressure are given. Numerical results support the theoretical predictions.
We present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.
The aim of this paper is to apply a high-order discontinuous-in-time scheme to second-order hyperbolic partial differential equations (PDEs). We first discretize the PDEs in time while keeping the spatial differential operators undiscretized. The well-posedness of this semi-discrete scheme is analyzed and a priori error estimates are derived in the energy norm. We then combine this $hp$-version discontinuous Galerkin method for temporal discretization with an $H^1$-conforming finite element approximation for the spatial variables to construct a fully discrete scheme. A prior error estimates ar…
We present a high-order entropy stable discontinuous Galerkin (ESDG) method for nonlinear conservation laws on both multi-dimensional domains and on networks constructed from one-dimensional domains. These methods utilize treatments of multi-dimensional interfaces and network junctions which retain entropy stability when coupling together entropy stable discretizations. Numerical experiments verify the stability of the proposed schemes, and comparisons with fully 2D implementations demonstrate the accuracy of each type of junction treatment.
A balancing domain decomposition by constraints preconditioner for a hybridizable discontinuous Galerkin discretization of an elliptic optimal control problem
A subspace correction method for discontinuous Galerkin discretizations of linear elasticity equations
Centre de Recerca Matemàtica（数学研究中心）；Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences（奥地利科学院约翰·拉顿计算与应用数学研究所）；Department of Mathematics, The Pennsylvania State University（宾夕法尼亚州立大学数学系）
We present a novel postprocessing technique for a discontinuous Galerkin (DG) discretization of time-dependent Maxwell's equations that we couple with an explicit Runge-Kutta time-marching scheme. The postprocessed electromagnetic field converges one order faster than the unprocessed solution in the H(curl)-norm. The proposed approach is local, in the sense that the enhanced solution is computed independently in each cell of the computational mesh, and at each time step of interest. As a result, it is inexpensive to compute, especially if the region of interest is localized, either in time or …
In this paper, we use an implicit two-derivative deferred correction time discretization approach and combine it with a spatial discretization of the discontinuous Galerkin spectral element method to solve (non-)linear PDEs. The resulting numerical method is high order accurate in space and time. As the novel scheme handles two time derivatives, the spatial operator for both derivatives has to be defined. This results in an extended system matrix of the scheme. We analyze this matrix regarding possible simplifications and an efficient way to solve the arising (non-)linear system of equations. …
A nonoverlapping spectral additive Schwarz method for interior penalty discontinuous Galerkin discretizations of Anisotropic Elliptic Problems
Massachusetts Institute of Technology（麻省理工学院）；University of Wisconsin-Madison（威斯康星大学麦迪逊分校）；State University of New York Polytechnic Institute（纽约州立理工大学）；Worcester Polytechnic Institute（伍斯特理工学院）
We develop a family of cut finite element methods of different orders based on the discontinuous Galerkin framework, for hyperbolic conservation laws with stationary interfaces in both one and two space dimensions, and for moving interfaces in one space dimension. Interface conditions are imposed weakly and so that both conservation and stability are ensured. A CutFEM with discontinuous elements in space is developed and coupled to standard explicit time-stepping schemes for linear advection problems and the acoustic wave problem with stationary interfaces. In the case of moving interfaces, we…
We prove that a class of monotone finite volume schemes for scalar conservation laws with discontinuous flux converge at a rate of $\sqrt{Δx}$ in $\mathrm{L}^1$, whenever the flux is strictly monotone in $u$ and the spatial dependency of the flux is piecewise constant with finitely many discontinuities. We also present numerical experiments to illustrate the main result. To the best of our knowledge, this is the first proof of any type of convergence rate for numerical methods for conservation laws with discontinuous, nonlinear flux. Our proof relies on convergence rates for conservation laws …
In this paper, we develop a family of high order cut discontinuous Galerkin (DG) methods for hyperbolic conservation laws in one space dimension. The ghost penalty stabilization is used to stabilize the scheme for small cut elements. The analysis shows that our proposed methods have similar stability and accuracy properties as the standard DG methods on a regular mesh. We also prove that the cut DG method with piecewise constants in space is total variation diminishing (TVD). We use the strong stability preserving Runge-Kutta method for time discretization and the time step is independent of t…
This paper proposes a fully discrete method called the symplectic dG full discretization for stochastic Maxwell equations driven by additive noises, based on a stochastic symplectic method in time and a discontinuous Galerkin (dG) method with the upwind fluxes in space. A priori $H^k$-regularity ($k\in\{1,2\}$) estimates for the solution of stochastic Maxwell equations are presented, which have not been reported before to the best of our knowledge. These $H^k$-regularities are vital to make the assumptions of the mean-square convergence analysis on the initial fields, the noise and the medium …
In this article, we present an extension of the splitting algorithm proposed in [22] to networks of conservation laws with piecewise linear discontinuous flux functions in the unknown. We start with the discussion of a suitable Riemann solver at the junction and then describe a strategy how to use the splitting algorithm on the network. In particular, we focus on two types of junctions, i.e., junctions where the number of outgoing roads does not exceed the number of incoming roads (dispersing type) and junctions with two incoming and one outgoing road (merging type). Finally, numerical example…
We propose a hybrid spatial discretization for the radiative transport equation that combines a second-order discontinuous Galerkin (DG) method and a second-order finite volume (FV) method. The strategy relies on a simple operator splitting that has been used previously to combine different angular discretizations. Unlike standard FV methods with upwind fluxes, the hybrid approach is able to accurately simulate problems in scattering dominated regimes. However, it requires less memory and yields a faster computational time than a uniform DG discretization. In addition, the underlying splitting…
For the general class of residual distribution (RD) schemes, including many finite element (such as continuous/discontinuous Galerkin) and flux reconstruction methods, an approach to construct entropy conservative/ dissipative semidiscretizations by adding suitable correction terms has been proposed by Abgrall (J.~Comp.~Phys. 372: pp. 640--666, 2018). In this work, the correction terms are characterized as solutions of certain optimization problems and are adapted to the SBP-SAT framework, focusing on discontinuous Galerkin methods. Novel generalizations to entropy inequalities, multiple const…
The paper describes the construction of entropy-stable discontinuous Galerkin difference (DGD) discretizations for hyperbolic conservation laws on unstructured grids. The construction takes advantage of existing theory for entropy-stable summation-by-parts (SBP) discretizations. In particular, the paper shows how DGD discretizations -- both linear and nonlinear -- can be constructed by defining the SBP trial and test functions in terms of interpolated DGD degrees of freedom. In the case of entropy-stable discretizations, the entropy variables rather than the conservative variables must be inte…
Isogeometric Analysis is a spline-based discretization method to partial differential equations which shows the approximation power of a high-order method. The number of degrees of freedom, however, is as small as the number of degrees of freedom of a low-order method. This does not come for free as the original formulation of Isogeometric Analysis requires a global geometry function. Since this is too restrictive for many kinds of applications, the domain is usually decomposed into patches, where each patch is parameterized with its own geometry function. In simpler cases, the patches can be …
In this paper we analyze the error as well for the semi-discretization as the full discretization of a time-dependent convection-diffusion problem. We use for the discretization in space the local discontinuous Galerkin (LDG) method on a class of layer-adapted meshes including Shishkin-type and Bakhvalov-type meshes and the implicit $θ$-scheme in time. For piecewise tensor-product polynomials of degree $k$ we obtain uniform or almost uniform error estimates with respect to space of order $k+1/2$ in some energy norm and optimal error estimates with respect to time. Our analysis is based on care…
In this work we present a framework for enforcing discrete maximum principles in discontinuous Galerkin (DG) discretizations. The developed schemes are applicable to scalar conservation laws as well as hyperbolic systems. Our methodology for limiting volume terms is similar to recently proposed methods for continuous Galerkin approximations, while DG flux terms require novel stabilization techniques. Piecewise Bernstein polynomials are employed as shape functions for the DG spaces, thus facilitating the use of very high order spatial approximations. We discuss the design of a new, provably inv…
In this paper, we develop an adaptive multiresolution discontinuous Galerkin (DG) scheme for scalar hyperbolic conservation laws in multidimensions. Compared with previous work for linear hyperbolic equations \cite{guo2016transport, guo2017adaptive}, a class of interpolatory multiwavelets are applied to efficiently compute the nonlinear integrals over elements and edges in DG schemes. The resulting algorithm, therefore can achieve similar computational complexity as the sparse grid DG method for smooth solutions. Theoretical and numerical studies are performed taking into consideration of accu…
We study an identification problem which estimates the parameters of the underlying random distribution for uncertain scalar conservation laws. The hyperbolic equations are discretized with the so-called discontinuous stochastic Galerkin method, i.e., using a spatial discontinuous Galerkin scheme and a Multielement stochastic Galerkin ansatz in the random space. We assume an uncertain flux or uncertain initial conditions and that a data set of an observed solution is given. The uncertainty is assumed to be uniformly distributed on an unknown interval and we focus on identifying the correct end…
We prove that adapted entropy solutions of scalar conservation laws with discontinuous flux are stable with respect to changes in the flux under the assumption that the flux is strictly monotone in u and the spatial dependency is piecewise constant with finitely many discontinuities. We use this stability result to prove a convergence rate for the front tracking method -- a numerical method which is widely used in the field of conservation laws with discontinuous flux. To the best of our knowledge, both of these results are the first of their kind in the literature on conservation laws with di…
We consider conservation laws with discontinuous flux where the initial datum, the flux function, and the discontinuous spatial dependency coefficient are subject to randomness. We establish a notion of random adapted entropy solutions to these equations and prove well-posedness provided that the spatial dependency coefficient is piecewise constant with finitely many discontinuities. In particular, the setting under consideration allows the flux to change across finitely many points in space whose positions are uncertain. We propose a single- and multilevel Monte Carlo method based on a finite…
In this paper we study the finite element approximation of systems of second-order nonlinear hyperbolic equations. The proposed numerical method combines a $hp$-version discontinuous Galerkin finite element approximation in the time direction with an $H^1(Ω)$-conforming finite element approximation in the spatial variables. Error bounds at the temporal nodal points are derived under a weak restriction on the temporal step size in terms of the spatial mesh size. Numerical experiments are presented to verify the theoretical results.
