In this paper, we develop the high order weighted essentially non-oscillatory (WENO) schemes for solving the Degasperis-Procesi (DP) equation, including finite volume (FV) and finite difference (FD) methods. The DP equation contains nonlinear high order derivatives, and possibly discontinuous or sharp transition solutions. The finite volume method is de- signed based on the total variation bounded property of the DP equation. And the finite difference method is constructed based on the L2 stability of the DP equation. Due to the adoption of the WENO reconstruction, both schemes are arbitrary high order accuracy and shock capturing. The numerical simulation results for different types of solutions of the nonlinear Degasperis-Procesi equation are provided to illustrate the accuracy and capability of the methods.

The goal of this paper is to prove the well-posedness for the governing equations which are used for cylindrical cloaking simulation. A new time-domain finite element scheme is developed to solve the governing equations. Numerical results demonstrating the cloaking phenomenon with the cylindrical cloak are presented. We finally extend the analysis and simulation to an elliptical cloak model.

This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblems, where each updates one, or a small block of, variables while fixing others. These methods can deal with linear and nonlinear mappings, smooth and nonsmooth functions, as well as convex and nonconvex problems. In addition, they are easy to parallelize. The great performance of coordinate update methods depends on solving simple sub-problems. To derive simple subproblems for several new classes of applications, this paper systematically studies coordinate-friendly operators that perform low-cost coordinate updates. Based on the discovered coordinate friendly operators, as well as operator splitting techniques, we obtain new coordinate update algorithms for a variety of problems in machine learning, image processing, as well as sub-areas of optimization. Several problems are treated with coordinate update for the first time in history. The obtained algorithms are scalable to large instances through parallel and even asynchronous computing. We present numerical examples to illustrate how effective these algorithms are.

InthispaperwedevelopaconservativelocaldiscontinuousGalerkin(LDG) method for the Schro ̈ dinger-Korteweg-de Vries (Sch-KdV) system, which arises in var- ious physical contexts as a model for the interaction of long and short nonlinear waves. Conservative quantities in the discrete version of the number of plasmons, energy of the oscillations and the number of particles are proved for the LDG scheme of the Sch-KdV system. Semi-implicit time discretization is adopted to relax the time step constraint from the high order spatial derivatives. Numerical results for accuracy tests of stationary traveling soliton, and the collision of solitons are shown. Numerical ex- periments illustrate the accuracy and capability of the method.

A new Tikhonov regularization method of Fuhry and Reichel [A new Tikhonov regularization method, Numerical Algorithms, 59:433-445, 2011] exhibits the excellent properties for ill-posed problems, but it can only deal with small or moderate size problems because of the expensive computation of singular value decomposition (SVD). In this paper, we extend the above new Tikhonov regularization method to solve large-scale problems, e.g., image restoration problem with periodic boundary conditions, and realize this extending by applying Fast Fourier Transformation (FFT) algorithm to the spectral decomposition of the block circulant with circulant blocks (BCCB) matrices. Experimental results confirm the superiority of our new method.