In this paper, we consider an interior penalty discontinuous Galerkin (DG) method for the time-dependent Maxwell’s equations in cold plasma. In Huang and Li (J. Sci. Comput., 42 (2009), 321–340), for both semi and fully discrete DG schemes, we proved error estimates which are optimal in the energy norm, but sub-optimal in the L2-norm. Here by filling this gap, we show that these schemes are optimally convergent in the L2-norm on quasi-uniform tetrahedral meshes if the solution is sufficiently smooth.

We analyze the random fluctuations of several multiscale algorithms, such as the multiscale finite element method (MsFEM) and the finite element heterogeneous multiscale method (HMM), that have been developed to solve partial differential equations with highly heterogeneous coefficients. Such multiscale algorithms are often shown to correctly capture the homogenization limit when the highly oscillatory random medium is stationary and ergodic. This paper is concerned with the random fluctuations of the solution about the deterministic homogenization limit. We consider the simplified setting of the one-dimensional elliptic equation, where the theory of random fluctuations is well understood. We develop a fluctuation theory for the multiscale algorithms in the presence of random environments with short-range and long-range correlations. For a given mesh size h, we show that the fluctuations converge in distribution in the space of continuous paths to Gaussian processes as the correlation length ε→0. We next derive the limit of such Gaussian processes as h→0 and compare this limit with the distribution of the random fluctuations of the continuous model. When such limits agree, we conclude that the multiscale algorithm captures the random fluctuations accurately and passes the corrector test. This property serves as an interesting benchmark to assess the behavior of the multiscale algorithm in practical situations where the assumptions necessary for the theory of homogenization are not met. What we find is that the computationally more expensive methods MsFEM, and HMM with a choice of parameter δ=h, correctly capture the random fluctuations both for short-range and long-range oscillations in the medium. The less expensive method HMM with δ<h correctly captures the fluctuations for long-range oscillations and strongly amplifies their size in media with short-range oscillations. We present a modified scheme with an intermediate computational cost that captures the random fluctuations in all cases.

Thetransmissioneigenvalueproblem,besidesitscriticalroleininversescattering problems, deserves special interest of its own due to the fact that the corresponding differen- tial operator is neither elliptic nor self-adjoint. In this paper, we provide a spectral analysis and propose a novel iterative algorithm for the computation of a few positive real eigen- values and the corresponding eigenfunctions of the transmission eigenvalue problem. Based on approximation using continuous finite elements, we first derive an associated symmetric quadratic eigenvalue problem (QEP) for the transmission eigenvalue problem to eliminate the nonphysical zero eigenvalues while preserve all nonzero ones. In addition, the derived QEP enables us to consider more refined discretization to overcome the limitation on the number of degrees of freedom. We then transform the QEP to a parameterized symmet- ric definite generalized eigenvalue problem (GEP) and develop a secant-type iteration for solving the resulting GEPs. Moreover, we carry out spectral analysis for various existence intervals of desired positive real eigenvalues, since a few lowest positive real transmission eigenvalues are of practical interest in the estimation and the reconstruction of the index of refraction. Numerical experiments show that the proposed method can find those desired smallest positive real transmission eigenvalues accurately, efficiently, and robustly.

We are interested in front propagation problems in the presence of obstacles. We extend a previous work (Bokanowski, Cheng and Shu 09}), to propose a simple and direct discontinuous Galerkin (DG) method adapted to such front propagation problems. We follow the formulation of Bokanowski et al. (Bokanowski_Forcadel_Zidani_2010), leading to a level set formulation driven by $\min(u_t + H(x,\nabla u), u-g(x))=0$, where $g(x)$ is an obstacle function. The DG scheme is motivated by the variational formulation when the Hamiltonian $H$ is a linear function of $\nabla u$, corresponding to linear convection problems in presence of obstacles. The scheme is then generalized to nonlinear equations, written in an explicit form. Stability analysis are performed for the linear case with Euler forward, a Heun scheme and a Runge-Kutta third order time discretization using the technique proposed in Zhang and Shu 2010. Several numerical examples are provided to demonstrate the robustness of the method. Finally, a narrow band approach is considered in order to reduce the computational cost.

We are concerned with the convergence of Lax-Wendroff type schemes with high resolution to the entropy solutions for conservation laws. These schemes include the original Lax-Wendroff scheme proposed by Lax and Wendroff in 1960 and its two step versions–the Richtmyer scheme and the MacCormack scheme. For the convex scalar conservation laws with algebraic growth flux functions, we prove the convergence of these schemes to the weak solutions satisfying appropriate entropy inequalities. The proof is based on detailed L p estimates of the approximate solutions, H −1 compactness estimates of the corresponding entropy dissipation measures, and some compensated compactness frameworks. Then these techniques are generalized to study the convergence problem for the nonconvex scalar case and the hyperbolic systems of conservation