In this paper we analyze the explicit Runge-Kutta discontinuous Galerkin (RKDG) methods for the semilinear hyperbolic system of a correlated random walk model describing movement of animals and cells in biology. The RKDG methods use a third order explicit total-variation-diminishing Runge-Kutta (TVDRK3) time discretization and upwinding numerical fluxes. By using the energy method, under a standard CFL condition, we obtain $L^2$ stability for general solutions and a priori error estimates when the solutions are smooth enough. The theoretical results are proved for piecewise polynomials with any degree $k \geq 1$. Finally, since the solutions to this system are non-negative, we discuss a positivity-preserving limiter to preserve positivity without compromising accuracy. Numerical results are provided to demonstrate these RKDG methods.

Image restoration is a common problem in visual process. In this paper, a modified minimization model is presented, which combines the L1 and L2 fidelity terms with a combined quadratic L2 and TV regularizer just as the regularizer of Cai et al. (2013). The combined regularizer has the priorities of preserving desirable edges and ensuring several kinds of noises can be removed clearly. Split-Bregman algorithm is effi- ciently employed to solve this model and convergence analysis is also discussed. Moreover, we extend the proposed model and algorithm for image restoration involving blurry images and color images. Experimental results show that our proposed model and algorithm have good performance both in visual and ISNR values for different kinds of blurs and noises including mixed noise.

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.

Staggered grid techniques have been applied successfully to many problems. A distinctive advantage is that physical laws arising from the corresponding partial differential equations are automatically preserved. Recently, a staggered discontinuous Galerkin (SDG) method was developed for the convectiondiffusion equation. In this paper, we are interested in solving the steady state convectiondiffusion equation with a small diffusion coefficient . It is known that the exact solution may have large gradient in some regions and thus a very fine mesh is needed. For convection dominated problems, that is, when is small, exact solutions may contain sharp layers. In these cases, adaptive mesh refinement is crucial in order to reduce the computational cost. In this paper, a new SDG method is proposed and the proof of its stability is provided. In order to construct an adaptive mesh refinement strategy for this new

We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods by using total variation regularization. We obtain rigorous convergence results and effective stopping criteria for the general procedure. The numerical results for denoising appear to give significant improvement over standard models, and preliminary results for deblurring/denoising are very encouraging.