- Award ID(s):
- 1719410
- Publication Date:
- NSF-PAR ID:
- 10226111
- Journal Name:
- ESAIM: Mathematical Modelling and Numerical Analysis
- Volume:
- 55
- Issue:
- Supplement
- Page Range or eLocation-ID:
- S187 to S223
- ISSN:
- 0764-583X
- Sponsoring Org:
- National Science Foundation
More Like this
-
In this paper, we consider Maxwell’s equations in linear dispersive media described by a single-pole Lorentz model for electronic polarization. We study two classes of commonly used spatial discretizations: finite difference methods (FD) with arbitrary even order accuracy in space and high spatial order discontinuous Galerkin (DG) finite element methods. Both types of spatial discretizations are coupled with second order semi-implicit leap-frog and implicit trapezoidal temporal schemes. By performing detailed dispersion analysis for the semi-discrete and fully discrete schemes, we obtain rigorous quantification of the dispersion error for Lorentz dispersive dielectrics. In particular, comparisons of dispersion error can be made taking into account the model parameters, and mesh sizes in the design of the two types of schemes. This work is a continuation of our previous research on energy-stable numerical schemes for nonlinear dispersive optical media [6,7]. The results for the numerical dispersion analysis of the reduced linear model, considered in the present paper, can guide us in the optimal choice of discretization parameters for the more complicated and nonlinear models. The numerical dispersion analysis of the fully discrete FD and DG schemes, for the dispersive Maxwell model considered in this paper, clearly indicate the dependence of the numerical dispersionmore »
-
In this paper, we study the central discontinuous Galerkin (DG) method on overlapping meshes for second order wave equations. We consider the first order hyperbolic system, which is equivalent to the second order scalar equation, and construct the corresponding central DG scheme. We then provide the stability analysis and the optimal error estimates for the proposed central DG scheme for one- and multi-dimensional cases with piecewise P k elements. The optimal error estimates are valid for uniform Cartesian meshes and polynomials of arbitrary degree k ≥ 0. In particular, we adopt the techniques in Liu et al . ( SIAM J. Numer. Anal. 56 (2018) 520–541; ESAIM: M2AN 54 (2020) 705–726) and obtain the local projection that is crucial in deriving the optimal order of convergence. The construction of the projection here is more challenging since the unknowns are highly coupled in the proposed scheme. Dispersion analysis is performed on the proposed scheme for one dimensional problems, indicating that the numerical solution with P 1 elements reaches its minimum with a suitable parameter in the dissipation term. Several numerical examples including accuracy tests and long time simulation are presented to validate the theoretical results.
-
The thermal radiative transfer (TRT) equations form an integro-differential system that describes the propagation and collisional interactions of photons. Computing accurate and efficient numerical solutions TRT are challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space that includes the independent variables of time, space, and velocity. In order to reduce the dimensionality of the phase space, classical approaches such as the P$_N$ (spherical harmonics) or the S$_N$ (discrete ordinates) ansatz are often used in the literature. In this work, we introduce a novel approach: the hybrid discrete (H$^T_N$) approximation to the radiative thermal transfer equations. This approach acquires desirable properties of both P$_N$ and S$_N$, and indeed reduces to each of these approximations in various limits: H$^1_N$ $\equiv$ P$_N$ and H$^T_0$ $\equiv$ S$_T$. We prove that H$^T_N$ results in a system of hyperbolic partial differential equations for all $T\ge 1$ and $N\ge 0$. Another challenge in solving the TRT system is the inherent stiffness due to the large timescale separation between propagation and collisions, especially in the diffusive (i.e., highly collisional) regime. This stiffness challenge can be partially overcome via implicit time integration, although fully implicit methods may become computationally expensivemore »
-
In this paper, we apply two fully-discrete local discontinuous Galerkin (LDG) methods to the compressible wormhole propagation. We will prove the stability and error estimates of the schemes. Traditional LDG methods use the diffusion term to control of convection term to obtain the stability for some linear equations. However, the variables in wormhole propagation are coupled together and the whole system is highly nonlinear. Therefore, it is extremely difficult to obtain the stability for fully-discrete LDG methods. To fix this gap, we introduce a new auxiliary variable including both the convection and diffusion terms. Moreover, we also construct a special time integration for the porosity, leading to physically relevant numerical approximations and controllable growth rate of the porosity. With a reasonable growth rate, it is possible to handle the time level mismatch in the first-order fully discrete scheme and obtain the stability of the scheme. For the whole system, we will prove that under weak temporal-spatial conditions, the optimal error estimates for the pressure, velocity, porosity and concentration under different norms can be obtained. Numerical experiments are also given to verify the theoretical results.
-
Abstract A local discontinuous Galerkin (LDG) method for approximating large deformations of prestrained plates is introduced and tested on several insightful numerical examples in Bonito et al. (2022, LDG approximation of large deformations of prestrained plates. J. Comput. Phys., 448, 110719). This paper presents a numerical analysis of this LDG method, focusing on the free boundary case. The problem consists of minimizing a fourth-order bending energy subject to a nonlinear and nonconvex metric constraint. The energy is discretized using LDG and a discrete gradient flow is used for computing discrete minimizers. We first show $\varGamma $-convergence of the discrete energy to the continuous one. Then we prove that the discrete gradient flow decreases the energy at each step and computes discrete minimizers with control of the metric constraint defect. We also present a numerical scheme for initialization of the gradient flow and discuss the conditional stability of it.