skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.
Attention:The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, May 14 until 2:00 AM ET on Friday, May 15 due to maintenance. We apologize for the inconvenience.


Title: Numerical analysis of a class of penalty discontinuous Galerkin methods for nonlocal diffusion problems
In this paper, we consider a class of discontinuous Galerkin (DG) methods for one-dimensional nonlocal diffusion (ND) problems. The nonlocal models, which are integral equations, are widely used in describing many physical phenomena with long-range interactions. The ND problem is the nonlocal analog of the classic diffusion problem, and as the interaction radius (horizon) vanishes, then the nonlocality disappears and the ND problem converges to the classic diffusion problem. Under certain conditions, the exact solution to the ND problem may exhibit discontinuities, setting it apart from the classic diffusion problem. Since the DG method shows its great advantages in resolving problems with discontinuities in computational fluid dynamics over the past several decades, it is natural to adopt the DG method to compute the ND problems. Based on [Q. Du, L. Ju, J. Lu and X. Tian,Commun. Appl. Math. Comput. 2 (2020) 31–55], we develop the DG methods with different penalty terms, ensuring that the proposed DG methods have local counterparts as the horizon vanishes. This indicates the proposed methods will converge to the existing DG schemes as the horizon vanishes, which is crucial for achievingasymptotic compatibility. Rigorous proofs are provided to demonstrate the stability, error estimates, and asymptotic compatibility of the proposed DG schemes. To observe the effect of the nonlocal diffusion, we also consider the time-dependent convection–diffusion problems with nonlocal diffusion. We conduct several numerical experiments, including accuracy tests and Burgers’ equation with nonlocal diffusion, and various horizons are taken to show the good performance of the proposed algorithm and validate the theoretical findings.  more » « less
Award ID(s):
2309245 1937254 2240180
PAR ID:
10588707
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
EDP Sciences
Date Published:
Journal Name:
ESAIM: Mathematical Modelling and Numerical Analysis
Volume:
58
Issue:
5
ISSN:
2822-7840
Page Range / eLocation ID:
2035 to 2059
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly. 
    more » « less
  2. Abstract We present a discontinuous Galerkin (DG)–finite difference (FD) hybrid scheme that allows high-order shock capturing with the DG method for general relativistic magnetohydrodynamics. The hybrid method is conceptually quite simple. An unlimited DG candidate solution is computed for the next time step. If the candidate solution is inadmissible, the time step is retaken using robust FD methods. Because of its a posteriori nature, the hybrid scheme inherits the best properties of both methods. It is high-order with exponential convergence in smooth regions, while robustly handling discontinuities. We give a detailed description of how we transfer the solution between the DG and FD solvers, and the troubled-cell indicators necessary to robustly handle slow-moving discontinuities and simulate magnetized neutron stars. We demonstrate the efficacy of the proposed method using a suite of standard and very challenging 1D, 2D, and 3D relativistic magnetohydrodynamics test problems. The hybrid scheme is designed from the ground up to efficiently simulate astrophysical problems such as the inspiral, coalescence, and merger of two neutron stars. 
    more » « less
  3. Abstract We prove two compactness results for function spaces with finite Dirichlet energy of half‐space nonlocal gradients. In each of these results, we provide sufficient conditions on a sequence of kernel functions that guarantee the asymptotic compact embedding of the associated nonlocal function spaces into the class of square‐integrable functions. Moreover, we will demonstrate that the sequence of nonlocal function spaces converges in an appropriate sense to a limiting function space. As an application, we prove uniform Poincaré‐type inequalities for sequence of half‐space gradient operators. We also apply the compactness result to demonstrate the convergence of appropriately parameterized nonlocal heterogeneous anisotropic diffusion problems. We will construct asymptotically compatible schemes for these type of problems. Another application concerns the convergence and robust discretization of a nonlocal optimal control problem. 
    more » « less
  4. Trefftz schemes are high-order Galerkin methods whose discrete spaces are made of elementwise exact solutions of the underlying partial differential equation (PDE). Trefftz basis functions can be easily computed for many PDEs that are linear, homogeneous and have piecewise-constant coefficients. However, if the equation has variable coefficients, exact solutions are generally unavailable. Quasi-Trefftz methods overcome this limitation relying on elementwise ‘approximate solutions’ of the PDE, in the sense of Taylor polynomials. We define polynomial quasi-Trefftz spaces for general linear PDEs with smooth coefficients and source term, describe their approximation properties and, under a nondegeneracy condition, provide a simple algorithm to compute a basis. We then focus on a quasi-Trefftz DG method for variable-coefficient elliptic diffusion–advection–reaction problems, showing stability and high-order convergence of the scheme. The main advantage over standard DG schemes is the higher accuracy for comparable numbers of degrees of freedom. For nonhomogeneous problems with piecewise-smooth source term we propose to construct a local quasi-Trefftz particular solution and then solve for the difference. Numerical experiments in two and three space dimensions show the excellent properties of the method both in diffusion-dominated and advection-dominated problems. 
    more » « less
  5. Suppressing spurious oscillations is crucial for designing reliable high-order numerical schemes for hyperbolic conservation laws, yet it has been a challenge actively investigated over the past several decades. This paper proposes a novel, robust, and efficient oscillation-eliminating discontinuous Galerkin (OEDG) method on general meshes, motivated by the damping technique (see J. Lu, Y. Liu, and C. W. Shu [SIAM J. Numer. Anal. 59 (2021), pp. 1299–1324]). The OEDG method incorporates an oscillation-eliminating (OE) procedure after each Runge–Kutta stage, and it is devised by alternately evolving the conventional semidiscrete discontinuous Galerkin (DG) scheme and a damping equation. A novel damping operator is carefully designed to possess bothscale-invariantandevolution-invariantproperties. We rigorously prove the optimal error estimates of the fully discrete OEDG method for smooth solutions of linear scalar conservation laws. This might be the first generic fully discrete error estimate fornonlinearDG schemes with an automatic oscillation control mechanism. The OEDG method exhibits many notable advantages. It effectively eliminates spurious oscillations for challenging problems spanning various scales and wave speeds, without necessitating problem-specific parameters for all the tested cases. It also obviates the need for characteristic decomposition in hyperbolic systems. Furthermore, it retains the key properties of the conventional DG method, such as local conservation, optimal convergence rates, and superconvergence. Moreover, the OEDG method maintains stability under the normal Courant–Friedrichs–Lewy (CFL) condition, even in the presence of strong shocks associated with highly stiff damping terms. The OE procedure isnonintrusive, facilitating seamless integration into existing DG codes as an independent module. Its implementation is straightforward and efficient, involving only simple multiplications of modal coefficients by scalars. The OEDG approach provides new insights into the damping mechanism for oscillation control.It reveals the role of the damping operator as a modal filter, establishing close relations between the damping technique and spectral viscosity techniques.Extensive numerical results validate the theoretical analysis and confirm the effectiveness and advantages of the OEDG method. 
    more » « less