In this paper, we study the superconvergence of the error for the discontinuous Galerkin (DG) finite element method for linear conservation laws when upwind fluxes are used. We prove that if we apply piecewise $k$-th degree polynomials, the error between the DG solution and the exact solution is ($k+2$)-th order superconvergent at the downwind-biased Radau points with suitable initial discretization. Moreover, we also prove the DG solution is ($k+2$)-th order superconvergent both for the cell averages and for the error to a particular projection of the exact solution. The superconvergence result in this paper leads to a new {\em a posteriori} error estimate. Our analysis is valid for arbitrary regular meshes and for $\mathcal{P}^k$ polynomials with arbitrary $k\geq1$, and for both periodic boundary conditions and for initial-boundary value problems. We perform numerical experiments to demonstrate that the superconvergence rate proved in this paper is optimal.

In this paper, we generalize the point integral method to solve the general elliptic PDEs with variable coefficients and corresponding eigenvalue problems with Neumann, Robin and Dirichlet boundary conditions on point cloud. The main idea is using integral equations to approximate the original PDEs. The integral equations are easy to discretize on the point cloud. The truncation error of the integral approximation is analyzed. Numerical examples are presented to demonstrate that PIM is an effective method to solve the elliptic PDEs with smooth coefficients on point cloud.

We propose a computational efficient yet simple numerical algorithm to solve the surface eikonal equation on general implicit surfaces. The method is developed based on the embedding idea and the fast sweeping methods. We first approximate the solution to the surface eikonal equation by the Euclidean weighted distance function defined in a tubular neighbourhood of the implicit surface, and then apply the efficient fast sweeping method to numerically compute the corresponding viscosity solution. Unlike some other embedding methods which require the radius of the computational tube satisfies h = O ( x ) for some h = O ( x ) , our approach allows h = O ( x ) . This implies that the total number of grid points in the computational tube is optimal and is given by h = O ( x ) for a co-dimensional one surface in h = O ( x ) . The method can be easily extended to general static HamiltonJacobi equation defined on implicit

In this paper, we develop the high order weighted essentially non-oscillatory (WENO) schemes for solving the Degasperis-Procesi (DP) equation, including finite volume (FV) and finite difference (FD) methods. The DP equation contains nonlinear high order derivatives, and possibly discontinuous or sharp transition solutions. The finite volume method is de- signed based on the total variation bounded property of the DP equation. And the finite difference method is constructed based on the L2 stability of the DP equation. Due to the adoption of the WENO reconstruction, both schemes are arbitrary high order accuracy and shock capturing. The numerical simulation results for different types of solutions of the nonlinear Degasperis-Procesi equation are provided to illustrate the accuracy and capability of the methods.

The objective of this paper is to design novel multi-layer neural network architectures for multiscale simulations of flows taking into account the observed data and physical modeling concepts. Our approaches use deep learning concepts combined with local multiscale model reduction methodologies to predict flow dynamics. Using reduced-order model concepts is important for constructing robust deep learning architectures since the reduced-order models provide fewer degrees of freedom. Flow dynamics can be thought of as multi-layer networks. More precisely, the solution (eg, pressures and saturations) at the time instant n+ 1 depends on the solution at the time instant n+ 1 and input parameters, such as permeability fields, forcing terms, and initial conditions. One can regard the solution as a multi-layer network, where each layer, in general, is a nonlinear forward map and the number of layers relates to the internal time steps. We will rely on rigorous model reduction concepts to define unknowns and connections for each layer. In each layer, our reduced-order models will provide a forward map, which will be modified (" trained") using available data. It is critical to use reduced-order models for this purpose, which will identify the regions of influence and the appropriate number of variables. Because of the lack of available data, the training will be supplemented with computational data as needed and the interpolation between data-rich and data-deficient models. We will also use deep learning algorithms to train the elements of the reduced model discrete system. We will present main ingredients of our approach and numerical results. Numerical