In this paper, we analyze the Lax-Wendroff discontinuous Galerkin (LWDG) method for solving linear conservation laws. The method was originally proposed by Guo et al., where they applied local discontinuous Galerkin (LDG) techniques to approximate high order spatial derivatives in the Lax-Wendroff time discretization. We show that, under the standard CFL condition $\tau\leq \lambda h$ (where $\tau$ and $h$ are the time step and the maximum element length respectively and $\lambda>0$ is a constant) and uniform or non-increasing time steps, the second order schemes with piecewise linear elements and the third order schemes with arbitrary piecewise polynomial elements are stable in the $L^2$ norm. The specific type of stability may differ with different choices of numerical fluxes. Our stability analysis includes multidimensional problems with divergence-free coefficients. Besides solving the equation itself, the LWDG method also gives approximations to its time derivative simultaneously. We obtain optimal error estimates for both the solution $u$ and its first order time derivative $u_t$ in one dimension, and numerical examples are given to validate our analysis.

This paper is concerned with superconvergence properties of discontinuous Galerkin (DG) methods for 2-D linear hyperbolic conservation laws over rectangular meshes when upwind fluxes are used. We prove, under some suitable initial and boundary discretizations, the ($2k+1$)-th order superconvergence rate of the DG approximation at the downwind points and for the cell averages, when piecewise tensor-product polynomials of degree $k$ are used. Moreover, we prove that the gradient of the DG solution is superconvergent with a rate of ($k+1$)-th order at all interior left Radau points; and the function value approximation is superconvergent at all right Radau points with a rate of ($k+2$)-th order. Numerical experiments indicate that the aforementioned superconvergence rates are sharp.

For decades, the widely used finite difference method on staggered grids, also known as the marker and cell (MAC) method, has been one of the simplest and most effective numerical schemes for solving the Stokes equations and Navier–Stokes equations. Its superconvergence on uniform meshes has been observed by Nicolaides (SIAM J Numer Anal 29(6):1579–1591, 1992), but the rigorous proof is never given. Its behavior on non-uniform grids is not well studied, since most publications only consider uniform grids. In this work, we develop the MAC scheme on non-uniform rectangular meshes, and for the first time we theoretically prove that the superconvergence phenomenon (i.e., second order convergence in the L2 norm for both velocity and pressure) holds true for the MAC method on non-uniform rectangular meshes. With a careful and accurate analysis of various sources of errors, we observe that even though the local truncation errors are only first order in terms of mesh size, the global errors after summation are second order due to the amazing cancellation of local errors. This observation leads to the elegant superconvergence analysis even with non-uniform meshes. Numerical results are given to verify our theoretical analysis.

The numerical solution of the one-dimensional nonlinear Klein-Gordon equation on an unbounded domain is studied in this paper. Split local absorbing boundary (SLAB) conditions are obtained by the operator splitting method, then the original problem is reduced to an initial boundary value problem on a bounded computational domain, which can be solved by the finite difference method. Several numerical examples are provided to show the advantages and effectiveness of the given method, and some interesting collision behaviors are also observed.

Full spectrum of a large sparse $\top$-palindromic quadratic eigenvalue problem ($\top$-PQEP) is considered arguably for the first time in this article. Such a problem is posed by calculation of surface Green's functions (SGFs) of mesoscopic transistors with a tremendous non-periodic cross-section. For this problem, general purpose eigensolvers are not efficient, nor is advisable to resort to the decimation method \etc to obtain the Wiener-Hopf factorization. After reviewing some rigorous understanding of SGF calculation from the perspective of $\top$-PQEP and nonlinear matrix equation, we present our new approach to this problem. In a nutshell, the unit disk where the spectrum of interest lies is broken down adaptively into pieces small enough that they each can be locally tackled by the generalized $\top$-skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi (G$\top$SHIRA) algorithm with suitable shifts and other parameters, and the eigenvalues missed by this divide-and-conquer strategy can be recovered thanks to the accurate estimation provided by our newly developed scheme. Notably the novel non-equivalence deflation is proposed to avoid as much as possible duplication of nearby known eigenvalues when a new shift of G$\top$SHIRA is determined. We demonstrate our new approach by calculating the SGF of a realistic nanowire whose unit cell is described by a matrix of size $4000\times 4000$ at the density functional tight binding level, corresponding to a $8\times 8\; \mbox{nm}^{2}$ cross-section. We believe that quantum transport simulation of realistic nano-devices in the mesoscopic regime will greatly benefit from this work.