Related papers: Long-timescale predictions from short-trajectory d…
Many chemical reactions and molecular processes occur on timescales that are significantly longer than those accessible by direct simulation. One successful approach to estimating dynamical statistics for such processes is to use many short…
Understanding chemical mechanisms requires estimating dynamical statistics such as expected hitting times, reaction rates, and committors. Here, we present a general framework for calculating these dynamical quantities by approximating…
Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. In this work, we propose and analyze a semi-implicit dynamical low-rank…
A discontinuous Petrov-Galerkin (DPG) method is used to solve the time-harmonic equations of linear viscoelasticity. It is based on a "broken" primal variational formulation, which is very similar to the classical primal variational…
A well-balanced moving mesh discontinuous Galerkin (DG) method is proposed for the numerical solution of the Ripa model -- a generalization of the shallow water equations that accounts for effects of water temperature variations.…
In this paper, we develop a sparse grid discontinuous Galerkin (DG) scheme for transport equations and applied it to kinetic simulations. The method uses the weak formulations of traditional Runge-Kutta DG (RKDG) schemes for hyperbolic…
Computing the numerical solution to high-dimensional tensor differential equations can lead to prohibitive computational costs and memory requirements. To reduce the memory and computational footprint, dynamical low-rank approximation…
A numerical dynamical low-rank approximation (DLRA) scheme for the solution of the Vlasov-Poisson equation is presented. Based on the formulation of the DLRA equations as Friedrichs' systems in a continuous setting, it combines recently…
In this paper, we develop bound-preserving discontinuous Galerkin (DG) methods for chemical reactive flows. There are several difficulties in constructing suitable numerical schemes. First of all, the density and internal energy are…
Numerical simulations of kinetic problems can become prohibitively expensive due to their large memory requirements and computational costs. A method that has proven to successfully reduce these costs is the dynamical low-rank approximation…
Mathematical models of protein-protein dynamics, such as the heterodimer model, play a crucial role in understanding many physical phenomena. This model is a system of two semilinear parabolic partial differential equations describing the…
In this paper, by introducing a reconstruction operator based on the Legendre moments, we construct a reduced discontinuous Galerkin (RDG) space that could achieve the same approximation accuracy but using fewer degrees of freedom (DoFs)…
The Gillespie algorithm is commonly used to simulate and analyze complex chemical reaction networks. Here, we leverage recent breakthroughs in deep learning to develop a fully differentiable variant of the Gillespie algorithm. The…
We propose an Eulerian-Lagrangian (EL) Runge-Kutta (RK) discontinuous Galerkin (DG) method for wave equations. The method is designed based on the ELDG method for transport problems [J. Comput. Phy. 446: 110632, 2021.], which tracks…
We derive a priori and a posteriori error estimates for the discontinuous Galerkin (dG) approximation of the time-harmonic Maxwell's equations. Specifically, we consider an interior penalty dG method, and establish error estimates that are…
Discontinuous Galerkin (DG) methods for hyperbolic partial differential equations (PDEs) with explicit time-stepping schemes, such as strong stability-preserving Runge-Kutta (SSP-RK), suffer from time-step restrictions that are…
In this paper, we present error estimates of fully discrete Runge--Kutta discontinuous Galerkin (DG) schemes for linear time-dependent partial differential equations. The analysis applies to explicit Runge--Kutta time discretizations of any…
This paper focuses on the adaptive discontinuous Galerkin (DG) methods for the tempered fractional (convection) diffusion equations. The DG schemes with interior penalty for the diffusion term and numerical flux for the convection term are…
We present a new framework for coarse-graining molecular dynamics models for crystalline solids. The reduction method is based on a Galerkin projection to a subspace, whose dimension is much smaller than that of the full atomistic model.…
The development and application of the Discontinuous Galerkin (DG) method have attracted great attention in computational fluid dynamics (CFD) com- munity in the past decades. The underlying reason for such an intensive investigation is due…