NADec 26, 2018
Arbitrary Lagrangian-Eulerian discontinuous Galerkin method for conservation laws on moving simplex meshesPei Fu, Gero Schnücke, Yinhua Xia
In Klingenberg, Schnücke and Xia (Math. Comp. 86 (2017), 1203-1232) an arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method to solve conservation laws has been developed and analyzed. In this paper, the ALE-DG method will be extended to several dimensions. The method will be designed for simplex meshes. This will ensure that the method satisfies the geometric conservation law, if the accuracy of the time integrator is not less than the value of the spatial dimension. For the semi-discrete method the L2-stability will be proven. Furthermore, an error estimate which provides the suboptimal (k+1/2) convergence with respect to the L-infinity-norm will be presented, when an arbitrary monotone flux is used and for each cell the approximating functions are given by polynomials of degree $k$. The two dimensional fully-discrete explicit method will be combined with the bound preserving limiter developed by Zhang, Xia and Shu in (J. Sci. Comput. 50 (2012), 29-62). This limiter does not affect the high order accuracy of a numerical method. Then, for the ALE-DG method revised by the limiter the validity of a discrete maximum principle will be proven. The numerical stability, robustness and accuracy of the method will be shown by a variety of two dimensional computational experiments on moving triangular meshes.
NADec 3, 2021
Fast $L^2$ optimal mass transport via reduced basis methods for the Monge-Amp$\grave{\rm e}$re equationShijin Hou, Yanlai Chen, Yinhua Xia
Repeatedly solving the parameterized optimal mass transport (pOMT) problem is a frequent task in applications such as image registration and adaptive grid generation. It is thus critical to develop a highly efficient reduced solver that is equally accurate as the full order model. In this paper, we propose such a machine learning-like method for pOMT by adapting a new reduced basis (RB) technique specifically designed for nonlinear equations, the reduced residual reduced over-collocation (R2-ROC) approach, to the parameterized Monge-Amp$\grave{\rm e}$re equation. It builds on top of a narrow-stencil finite different method (FDM), a so-called truth solver, which we propose in this paper for the Monge-Amp$\grave{\rm e}$re equation with a transport boundary. Together with the R2-ROC approach, it allows us to handle the strong and unique nonlinearity pertaining to the Monge-Amp$\grave{\rm e}$re equation achieving online efficiency without resorting to any direct approximation of the nonlinearity. Several challenging numerical tests demonstrate the accuracy and high efficiency of our method for solving the Monge-Amp$\grave{\rm e}$re equation with various parametric boundary conditions.
NAMar 31, 2019
Positivity Preserving Limiters for Time-Implicit Higher Order Accurate Discontinuous Galerkin DiscretizationsJ. J. W. van der Vegt, Yinhua Xia, Yan Xu
Currently, nearly all positivity preserving discontinuous Galerkin (DG) discretizations of partial differential equations are coupled with explicit time integration methods. Unfortunately, for many problems this can result in severe time-step restrictions. The techniques used to develop explicit positivity preserving DG discretizations can, however, not easily be combined with implicit time integration methods. In this paper we therefore present a new approach. Using Lagrange multipliers the conditions imposed by the positivity preserving limiters are directly coupled to a DG discretization combined with a Diagonally Implicit Runge-Kutta time integration method. The positivity preserving DG discretization is then reformulated as a Karush-Kuhn-Tucker (KKT) problem, which is frequently encountered in constrained optimization. Since the limiter is only active in areas where positivity must be enforced it does not affect the higher order DG discretization elsewhere. The resulting non-smooth nonlinear algebraic equations have, however, a different structure compared to most constrained optimization problems. We therefore develop an efficient active set semi-smooth Newton method that is suitable for the KKT formulation of time-implicit positivity preserving DG discretizations. Convergence of this semi-smooth Newton method is proven using a specially designed quasi-directional derivative of the time-implicit positivity preserving DG discretization. The time-implicit positivity preserving DG discretization is demonstrated for several nonlinear scalar conservation laws, which include the advection, Burgers, Allen-Cahn, Barenblatt, and Buckley-Leverett equations.