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.

No abstract uploaded!

This is an extension of our earlier work \cite{DS} in which a high order stable method was constructed for solving hyperbolic conservation laws on arbitrarily distributed point clouds. %The initial condition is given on such a point cloud, %and the algorithm solves for point values of the solution at %later time also on this point cloud. An algorithm of building a suitable polygonal mesh based on the random points was given and the traditional discontinuous Galerkin (DG) method was adopted on the constructed polygonal mesh. Numerical results in \cite{DS} show that the current scheme will generate spurious numerical oscillations when dealing with solutions containing strong shocks. In this paper, we adapt a simple weighted essentially non-oscillatory (WENO) limiter, originally designed for DG schemes on two-dimensional unstructured triangular meshes \cite{ZZSQ}, to our high order method on polygonal meshes. The objective of this simple WENO limiter is to simultaneously maintain uniform high order accuracy of the original method in smooth regions and control spurious numerical oscillations near discontinuities. The WENO limiter we adopt is particularly simple to implement and will not harm the conservativeness and compactness of the original method. Moreover, we also extend the maximum-principle-satisfying limiter for the scalar case and the positivity-preserving limiter for the Euler system to our method. Numerical results for both scalar equations and Euler systems of compressible gas dynamics are provided to illustrate the good behavior of these limiters.

The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclear-norm minimization which requires computing singular value decompositionsa task that is increasingly costly as matrix sizes and ranks increase. To improve the capacity of solving large-scale problems, we propose a low-rank factorization model and construct a nonlinear successive over-relaxation (SOR) algorithm that only requires solving a linear least squares problem per iteration. Extensive numerical experiments show that the algorithm can reliably solve a wide range of problems at a speed at least several times faster than many nuclear-norm minimization algorithms. In addition, convergence of this nonlinear SOR algorithm to a stationary point is analyzed.

We propose a simple Eulerian approach to compute the moderate to long time flow map for approximating the Lyapunov exponent of a (periodic or aperiodic) dynamical system. The idea is to generalize a recently proposed backward phase flow method which is specially designed for long time level set propagation. Unlike the original phase flow method or the backward phase flow method, which is applicable only to autonomous systems, the current approach can also be applied to any time-dependent (periodic or aperiodic) flow. We will discuss the stability of the proposed method. Numerical examples will be given to demonstrate the effectiveness of the algorithm.