The numerical solution of the one-dimensional KleinGordon equation on an unbounded domain is analyzed in this paper. Two artificial boundary conditions are obtained to reduce the original problem to an initial boundary value problem on a bounded computational domain, which is discretized by an explicit difference scheme. The stability and convergence of the scheme are analyzed by the energy method. A fast algorithm is obtained to reduce the computational cost and a discrete artificial boundary condition (DABC) is derived by the <i>Z</i>-transform approach. Finally, we illustrate the efficiency of the proposed method by several numerical examples.

No abstract uploaded!

In this paper, we illustrate a new concept regarding unitary elements defined on Lorentz cone, and establish some basic properties under the so-called unitary transformation associated with Lorentz cone. As an application of unitary transformation, we achieve a weaker version of the triangle inequality and several (weak) majorizations defined on Lorentz cone.

We review some important ideas in the design and analysis of robust overlapping domain decomposition algorithms for high-contrast multiscale problems.

In this paper, we provide a priori $L^2$ error estimates for the semi-discrete discontinuous Galerkin method and the local discontinuous Galerkin method for one- and two-dimensional nonlinear Hamilton-Jacobi equations with smooth solutions. With a special Gauss-Radau projection, the optimal error estimates on rectangular meshes are obtained.