Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy to implement and faster than graph Laplacian.

In this paper, we develop, analyze and test the Fourier spectral methods for solving the Degasperis-Procesi(DP) equation which contains nonlinear high order derivatives, and possibly discontinuous or sharp transition solutions. The $L^2$ stability is obtained for general numerical solutions of the Fourier Galerkin method and Fourier collocation (pseudospectral) method.By applying the Gegenbauer reconstruction technique as a post-processing method to the Fourier spectral solution, we reduce the oscillations arising from the discontinuity successfully. 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.

No abstract uploaded!

In this paper, we propose a new type of weighted essentially non-oscillatory (WENO) limiter, which belongs to the class of Hermite WENO (HWENO) limiters, for the Runge-Kutta discontinuous Galerkin (RKDG) methods solving hyperbolic conservation laws. This new HWENO limiter is a modification of the simple WENO limiter proposed recently by Zhong and Shu. Both limiters use information of the DG solutions only from the target cell and its immediate neighboring cells, thus maintaining the original compactness of the DG scheme. The goal of both limiters is to obtain high order accuracy and non-oscillatory properties simultaneously. The main novelty of the new HWENO limiter in this paper is to reconstruct the polynomial on the target cell in a least square fashion while the simple WENO limiter is to use the entire polynomial of the original DG solutions in the neighboring cells with an addition of a constant for conservation. The modification in this paper improves the robustness in the computation of problems with strong shocks or contact discontinuities, without changing the compact stencil of the DG scheme. Numerical results for both one and two dimensional equations including Euler equations of compressible gas dynamics are provided to illustrate the viability of this modified limiter.

Robustness of numerical methods has attracted an increasing interest in the community of computational fluid dynamics. One mathematical aspect of robustness for numerical methods is the positivity-preserving property. At high Mach numbers or for flows near vacuum, solving the conservative Euler equations may generate negative density or internal energy numerically, which may lead to nonlinear instability and crash of the code. This difficulty is particularly profound for high order methods, for multi-material flows and for problems with moving meshes, such as the Lagrangian methods. In this paper, we construct both first order and uniformly high order accurate conservative Lagrangian schemes which preserve positivity of physically positive variables such as density and internal energy in the simulation of compressible multi-material flows with general equations of state (EOS). We first develop a positivity-preserving approximate Riemann solver for the Lagrangian scheme solving compressible Euler equations with both ideal and non ideal EOS. Then we design a class of high order positivity-preserving and conservative Lagrangian schemes by using the essentially non-oscillatory (ENO) reconstruction, the strong stability preserving (SSP) high order time discretizations and the positivity-preserving scaling limiter which can be proven to maintain conservation and uniformly high order accuracy and is easy to implement. One-dimensional and two-dimensional numerical tests for the positivity-preserving Lagrangian schemes are provided to demonstrate the effectiveness of these methods.