In this paper, an analysis of the superconvergence property of the semidiscrete discontinuous Galerkin (DG) method applied to one-dimensional time-dependent nonlinear scalar conservation laws is carried out. We prove that the error between the DG solution and a particular projection of the exact solution achieves $\left(k + \frac32\right)$-th order superconvergence when upwind fluxes are used. The results hold true for arbitrary nonuniform regular meshes and for piecewise polynomials of degree $k$ ($k \ge 1$), under the condition that $|f'(u)|$ possesses a uniform positive lower bound. Numerical experiments are provided to show that the superconvergence property actually holds true for nonlinear conservation laws with general flux functions, indicating that the restriction on $f(u)$ is artificial.

Abstract BDDC and FETI-DP algorithms are developed for three-dimensional elliptic problems with adaptively enriched coarse components. It is known that these enriched components are necessary in the development of robust preconditioners. To form the adaptive coarse components, carefully designed generalized eigenvalue problems are introduced for each faces and edges, and the coarse components are formed by using eigenvectors with their corresponding eigenvalues larger than a given tolerance T O L. Upper bounds for condition numbers of the preconditioned systems are shown to be C T O L, with the constant C depending only on the maximum number of edges and faces per subdomain, and the maximum number of subdomains sharing an edge. Numerical results are presented to test the robustness of the proposed approach.

We study front speeds of curvature and strain G-equations arising in turbulent combustion. These G-equations are HamiltonJacobi type level set partial differential equations (PDEs) with non-coercive Hamiltonians and degenerate nonlinear second order diffusion. The Hamiltonian of a strain G-equation is also non-convex. Numerical computation is performed based on monotone discretization and weighted essentially nonoscillatory (WENO) approximation of transformed G-equations on a fixed periodic domain. The advection field in the computation is a two dimensional Hamiltonian flow consisting of a periodic array of counter-rotating vortices, or cellular flows. Depending on whether the evolution is predominantly in the hyperbolic or parabolic regimes, suitable explicit and semi-implicit time stepping methods are chosen. The turbulent flame speeds are computed as the linear growth rates of large time solutions. A

In this paper, we propose a multi-scale discontinuous Galerkin (DG) method for second-order elliptic problems with curvilinear unidirectional rough coefficients by choosing a special non-polynomial approximation space. The key ingredient of the method lies in the incorporation of the local oscillatory features of the differential operators into the approximation space so as to capture the multi-scale solutions without having to resolve the finest scales. The unidirectional feature of the rough coefficients allows us to construct the basis functions of the DG non-polynomial approximation space explicitly, thereby greatly increasing the algorithm efficiency. Detailed error estimates for two-dimensional second-order DG methods are derived, and a general guidance on how to construct such non-polynomial basis is discussed. Numerical examples are also presented to validate and demonstrate the effectiveness of the algorithm.

We propose a simple fast spectral method for the Boltzmann collision operator with general collision kernels. In contrast to the direct spectral method [L. Pareschi and G. Russo, SIAM J. Numer. Anal., 37 (2000), pp. 1217–1245; I. M. Gamba and S. H. Tharkabhushanam, J. Comput. Phys., 228 (2009), pp. 2012–2036], which requires O(N6) memory to store precomputed weights and has O(N6) numerical complexity, the new method has complexity O(MN4 log N), where N is the number of discretization points in each of the three velocity dimensions and M is the total number of discretization points on the sphere and M ≪ N2. Furthermore, it requires no precomputation for the variable hard sphere model and only O(MN4) memory to store precomputed functions for more general collision kernels. Although a faster spectral method is available [C. Mouhot and L. Pareschi, Math. Comp., 75 (2006), pp. 1833–1852] (with complexity O(MN3 logN)), it works only for hard sphere molecules, thus limiting its use for practical problems. Our new method, on the other hand, can apply to arbitrary collision kernels. A series of numerical tests is performed to illustrate the efficiency and accuracy of the proposed method.