The local discontinuous Galerkin (LDG) method is studied for a third-order singularly perturbed problem of the convection-diffusion type. Based on a regularity assumption for the exact solution, we prove almost $O(N^{-(k+1/2)})$ (up to a logarithmic factor) energy-norm convergence uniformly in the perturbation parameter. Here, $k\geq 0$ is the maximum degree of piecewise polynomials used in discrete space, and $N$ is the number of mesh elements. The results are valid for the three types of layer-adapted meshes: Shishkin-type, Bakhvalov-Shishkin type, and Bakhvalov-type. Numerical experiments are conducted to test the theoretical results.
We develop a novel Monte Carlo algorithm for the vector consisting of the supremum, the time at which the supremum is attained and the position at a given (constant) time of an exponentially tempered L\'evy process. The algorithm, based on the increments of the process without tempering, converges geometrically fast (as a function of the computational cost) for discontinuous and locally Lipschitz functions of the vector. We prove that the corresponding multilevel Monte Carlo estimator has optimal computational complexity (i.e. of order $\varepsilon^{-2}$ if the mean squared error is at most $\varepsilon^2$) and provide its central limit theorem (CLT). Using the CLT we construct confidence intervals for barrier option prices and various risk measures based on drawdown under the tempered stable (CGMY) model calibrated/estimated on real-world data. We provide non-asymptotic and asymptotic comparisons of our algorithm with existing approximations, leading to rule-of-thumb guidelines for users to the best method for a given set of parameters. We illustrate the performance of the algorithm with numerical examples.
In two and three dimension we analyze discontinuous Galerkin methods for the acoustic problem. The acoustic fluid that we consider on this paper is inviscid, leading to a linear eigenvalue problem. The acoustic problem is written, in first place, in terms of the displacement. Under the approach of the non-compact operators theory, we prove convergence and error estimates for the method when the displacement formulation is considered. We analyze the influence of the stabilization parameter on the computation of the spectrum, where spurious eigenmodes arise when this parameter is not correctly chosen. Alternatively we present the formulation depending only on the pressure, comparing the performance of the DG methods with the pure displacement formulation. Computationally, we study the influence of the stabilization parameter on the arising of spurious eigenvalues when the spectrum is computed. Also, we report tests in two and three dimensions where convergence rates are reported, together with a comparison between the displacement and pressure formulations for the proposed DG methods.
We investigate an anisotropic weakly over-penalised symmetric interior penalty method for the Stokes equation. The method is one of the discontinuous Galerkin methods, simple and similar to the Crouzeix--Raviart finite element method. The main contributions of this paper are to show new proof for the consistency term. It allows us to obtain an anisotropic consistency error estimate. The idea of the proof is to use the relation between the Raviart--Thomas finite element space and the discontinuous space. In many papers, the inf-sup stable schemes of the discontinuous Galerkin method have been discussed on shape-regular mesh partitions. Our result shows that the Stokes pair, which is treated in this paper, satisfies the inf-sup condition on anisotropic meshes. Furthermore, we show an error estimate in an energy norm on anisotropic meshes. In numerical experiments, we have compared the calculation results for standard and anisotropic mesh partitions. The effectiveness of using anisotropic meshes can be confirmed for problems with boundary layers.
We prove $hp$-optimal error estimates for interior penalty discontinuous Galerkin methods (IPDG) for the biharmonic problem with homogeneous essential boundary conditions. We consider tensor product-type meshes in two and three dimensions, and triangular meshes in two dimensions. An essential ingredient in the analysis is the construction of a global $H^2$ piecewise polynomial approximants with $hp$-optimal approximation properties over the given meshes. The $hp$-optimality is also discussed for $\mathcal C^0$-IPDG in two and three dimensions, and the stream formulation of the Stokes problem in two dimensions. Numerical experiments validate the theoretical predictions and reveal that $p$-suboptimality occurs in presence of singular essential boundary conditions.
The optimal error estimate that depending only on the polynomial degree of $ \varepsilon^{-1}$ is established for the temporal semi-discrete scheme of the Cahn-Hilliard equation, which is based on the scalar auxiliary variable (SAV) formulation. The key to our analysis is to convert the structure of the SAV time-stepping scheme back to a form compatible with the original format of the Cahn-Hilliard equation, which makes it feasible to use spectral estimates to handle the nonlinear term. Based on the transformation of the SAV numerical scheme, the optimal error estimate for the temporal semi-discrete scheme which depends only on the low polynomial order of $\varepsilon^{-1}$ instead of the exponential order, is derived by using mathematical induction, spectral arguments, and the superconvergence properties of some nonlinear terms. Numerical examples are provided to illustrate the discrete energy decay property and validate our theoretical convergence analysis.
We investigate predictive densities for multivariate normal models with unknown mean vectors and known covariance matrices. Bayesian predictive densities based on shrinkage priors often have complex representations, although they are effective in various problems. We consider extended normal models with mean vectors and covariance matrices as parameters, and adopt predictive densities that belong to the extended models including the original normal model. We adopt predictive densities that are optimal with respect to the posterior Bayes risk in the extended models. The proposed predictive density based on a superharmonic shrinkage prior is shown to dominate the Bayesian predictive density based on the uniform prior under a loss function based on the Kullback-Leibler divergence. Our method provides an alternative to the empirical Bayes method, which is widely used to construct tractable predictive densities.
In this paper, we propose a new approach for the time-discretization of the incompressible stochastic Stokes equations with multiplicative noise. Our new strategy is based on the classical Milstein method from stochastic differential equations. We use the energy method for its error analysis and show a strong convergence order of at most $1$ for both velocity and pressure approximations. The proof is based on a new H\"older continuity estimate of the velocity solution. While the errors of the velocity approximation are estimated in the standard $L^2$- and $H^1$-norms, the pressure errors are carefully analyzed in a special norm because of the low regularity of the pressure solution. In addition, a new interpretation of the pressure solution, which is very useful in computation, is also introduced. Numerical experiments are also provided to validate the error estimates and their sharpness.
We develop a new second-order unstaggered path-conservative central-upwind (PCCU) scheme for ideal and shallow water magnetohydrodynamics (MHD) equations. The new scheme possesses several important properties: it locally preserves the divergence-free constraint, it does not rely on any (approximate) Riemann problem solver, and it robustly produces high-resolution and non-oscillatory results. The derivation of the scheme is based on the Godunov-Powell nonconservative modifications of the studied MHD systems. The local divergence-free property is enforced by augmenting the modified systems with the evolution equations for the corresponding derivatives of the magnetic field components. These derivatives are then used to design a special piecewise linear reconstruction of the magnetic field, which guarantees a non-oscillatory nature of the resulting scheme. In addition, the proposed PCCU discretization accounts for the jump of the nonconservative product terms across cell interfaces, thereby ensuring stability. We test the proposed PCCU scheme on several benchmarks for both ideal and shallow water MHD systems. The obtained numerical results illustrate the performance of the new scheme, its robustness, and its ability not only to achieve high resolution, but also preserve the positivity of computed quantities such as density, pressure, and water depth.
In this paper, we develop a fully conservative, positivity-preserving, and entropy-bounded discontinuous Galerkin scheme for simulating the chemically reacting, compressible Euler equations with complex thermodynamics. The proposed formulation is an extension of the conservative, high-order numerical method previously developed by Johnson and Kercher [J. Comput. Phys., 423 (2020), 109826] that maintains pressure equilibrium between adjacent elements. In this first part of our two-part paper, we focus on the one-dimensional case. Our methodology is rooted in the minimum entropy principle satisfied by entropy solutions to the multicomponent, compressible Euler equations, which was proved by Gouasmi et al. [ESAIM: Math. Model. Numer. Anal., 54 (2020), 373--389] for nonreacting flows. We first show that the minimum entropy principle holds in the reacting case as well. Next, we introduce the ingredients required for the solution to have nonnegative species concentrations, positive density, positive pressure, and bounded entropy. We also discuss how to retain the aforementioned ability to preserve pressure equilibrium between elements. Operator splitting is employed to handle stiff chemical reactions. To guarantee satisfaction of the minimum entropy principle in the reaction step, we develop an entropy-stable discontinuous Galerkin method based on diagonal-norm summation-by-parts operators for solving ordinary differential equations. The developed formulation is used to compute canonical one-dimensional test cases, namely thermal-bubble advection, multicomponent shock-tube flow, and a moving hydrogen-oxygen detonation wave with detailed chemistry. We find that the enforcement of an entropy bound can considerably reduce the large-scale nonlinear instabilities that emerge when only the positivity property is enforced, to an even greater extent than in the monocomponent, calorically perfect case.
Residual networks (ResNets) have displayed impressive results in pattern recognition and, recently, have garnered considerable theoretical interest due to a perceived link with neural ordinary differential equations (neural ODEs). This link relies on the convergence of network weights to a smooth function as the number of layers increases. We investigate the properties of weights trained by stochastic gradient descent and their scaling with network depth through detailed numerical experiments. We observe the existence of scaling regimes markedly different from those assumed in neural ODE literature. Depending on certain features of the network architecture, such as the smoothness of the activation function, one may obtain an alternative ODE limit, a stochastic differential equation or neither of these. These findings cast doubts on the validity of the neural ODE model as an adequate asymptotic description of deep ResNets and point to an alternative class of differential equations as a better description of the deep network limit.