arXiv subjects

Yushun Wang

Publications and source records attributed to Yushun Wang.

32 records · Page 2Linked to original sources

arXiv2019

A structure-preserving algorithm for the fractional nonlinear Schrödinger equation based on the SAV approach

The main objective of this paper is to present an efficient structure-preserving scheme, which is based on the idea of the scalar auxiliary variable approach, for solving the space fractional nonlinear Schrödinger equation. First, we reformulate the equation as a Hamiltonian system, and obtain a new equivalent system via introducing a scalar variable. Then, we construct a semi-discrete energy-preserving scheme by using the Fourier pseudo-spectral method to discretize the equivalent system in space direction. After that, applying the Crank-Nicolson method on the temporal direction gives a linear implicit scheme in the fully-discrete version. As expected, the proposed scheme can preserve the energy exactly and more efficient in the sense that only decoupled equations with constant coefficients need to be solved at each time step. Finally, numerical experiments are provided to demonstrate the effectiveness and conservation of the scheme.

math.NA↗

arXiv2019

A linearly implicit structure-preserving scheme for the fractional sine-Gordon equation based on the IEQ approach

This paper aims to develop a linearly implicit structure-preserving numerical scheme for the space fractional sine-Gordon equation, which is based on the newly developed invariant energy quadratization method. First, we reformulate the equation as a canonical Hamiltonian system by virtue of the variational derivative of the functional with fractional Laplacian. Then, we utilize the fractional centered difference formula to discrete the equivalent system derived by the invariant energy quadratization method in space direction, and obtain a conservative semi-discrete scheme. Subsequently, the linearly implicit structure-preserving method is applied for the resulting semi-discrete system to arrive at a fully-discrete conservative scheme. The stability, solvability and convergence in the maximum norm of the numerical scheme are given. Furthermore, a fast algorithm based on the fast Fourier transformation technique is used to reduce the computational complexity in practical computation. Finally, numerical examples are provided to confirm our theoretical analysis results.

math.NA↗

arXiv2019

Arbitrarily high-order energy-preserving schemes for the Camassa-Holm equation

In this paper, we develop a novel class of arbitrarily high-order energy-preserving schemes for the Camassa-Holm equation. With the aid of the invariant energy quadratization approach, the Camassa-Holm equation is first reformulated into an equivalent system, which inherits a quadratic energy. {The new system is then discretized} by the standard Fourier pseudo-spectral method, which can exactly preserve the semi-discrete energy conservation law. Subsequently, { a symplectic Runge-Kutta method such as the Gauss collocation method is applied} for the resulting semi-discrete system to arrive at an arbitrarily high-order fully discrete scheme. {We prove that the obtained schemes can conserve the discrete energy conservation law}. Numerical results are addressed to confirm accuracy and efficiency of the proposed schemes.

math.NA↗

arXiv2019

Optimal error estimate of a conservative Fourier pseudo-spectral method for the space fractional nonlinear Schrödinger equation

In this paper, we consider the error analysis of a conservative Fourier pseudo-spectral method that conserves mass and energy for the space fractional nonlinear Schrödinger equation. We give a new fractional Sobolev norm that can construct the discrete fractional Sobolev space, and we also can prove some important lemmas for the new fractional Sobolev norm. Based on these lemmas and energy method, a priori error estimate for the method can be established. Then, we are able to prove that the Fourier pseudo-spectral method is unconditionally convergent with order $O(τ^{2}+N^{α/2-r})$ in the discrete $L^{\infty}$ norm, where $τ$ is the time step and $N$ is the number of collocation points used in the spectral method. Numerical examples are presented to verify the theoretical analysis.

math.AP↗

arXiv2019

A linearly implicit and local energy-preserving scheme for the sine-Gordon equation based on the invariant energy quadratization approach

In this paper, we develop a novel, linearly implicit and local energy-preserving scheme for the sine-Gordon equation. The basic idea is from the invariant energy quadratization approach to construct energy stable schemes for gradient systems, which are energy dispassion. We here take the sine-Gordon equation as an example to show that the invariant energy quadratization approach is also an efficient way to construct linearly implicit and local energy-conserving schemes for energy-conserving systems. Utilizing the invariant energy quadratization approach, the sine-Gordon equation is first reformulated into an equivalent system, which inherits a modified local energy conservation law. The new system are then discretized by the conventional finite difference method and a semi-discretized system is obtained, which can conserve the semi-discretized local energy conservation law. Subsequently, the linearly implicit structure-preserving method is applied for the resulting semi-discrete system to arrive at a fully discretized scheme. We prove that the resulting scheme can exactly preserve the discrete local energy conservation law. Moveover, with the aid of the classical energy method, an unconditional and optimal error estimate for the scheme is established in discrete $H_h^1$-norm. Finally, various numerical examples are addressed to confirm our theoretical analysis and demonstrate the advantage of the new scheme over some existing local structure-preserving schemes.

math.NA↗

arXiv2019

A novel linearized and momentum-preserving Fourier pseudo-spectral scheme for the Rosenau-Korteweg de Vries equation

In this paper, we design a novel linearized and momentum-preserving Fourier pseudo-spectral scheme to solve the Rosenau-Korteweg de Vries equation. With the aid of a new semi-norm equivalence between the Fourier pseudo-spectral method and the finite difference method, a prior bound of the numerical solution in discrete $L^{\infty}$-norm is obtained from the discrete momentum conservation law. Subsequently, based on the energy method and the bound of the numerical solution, we show that, without any restriction on the mesh ratio, the scheme is convergent with order $O(N^{-s}+τ^2)$ in discrete $L^\infty$-norm, where $N$ is the number of collocation points used in the spectral method and $τ$ is the time step. Numerical results are addressed to confirm our theoretical analysis.

math.NA↗

arXiv2019

DNNVM : End-to-End Compiler Leveraging Heterogeneous Optimizations on FPGA-based CNN Accelerators

The convolutional neural network (CNN) has become a state-of-the-art method for several artificial intelligence domains in recent years. The increasingly complex CNN models are both computation-bound and I/O-bound. FPGA-based accelerators driven by custom instruction set architecture (ISA) achieve a balance between generality and efficiency, but there is much on them left to be optimized. We propose the full-stack compiler DNNVM, which is an integration of optimizers for graphs, loops and data layouts, and an assembler, a runtime supporter and a validation environment. The DNNVM works in the context of deep learning frameworks and transforms CNN models into the directed acyclic graph: XGraph. Based on XGraph, we transform the optimization challenges for both the data layout and pipeline into graph-level problems. DNNVM enumerates all potentially profitable fusion opportunities by a heuristic subgraph isomorphism algorithm to leverage pipeline and data layout optimizations, and searches for the best choice of execution strategies of the whole computing graph. On the Xilinx ZU2 @330 MHz and ZU9 @330 MHz, we achieve equivalently state-of-the-art performance on our benchmarks by naïve implementations without optimizations, and the throughput is further improved up to 1.26x by leveraging heterogeneous optimizations in DNNVM. Finally, with ZU9 @330 MHz, we achieve state-of-the-art performance for VGG and ResNet50. We achieve a throughput of 2.82 TOPs/s and an energy efficiency of 123.7 GOPs/s/W for VGG. Additionally, we achieve 1.38 TOPs/s for ResNet50 and 1.41 TOPs/s for GoogleNet.

cs.DC↗

arXiv2018

Optimal error estimate of two linear and momentum-preserving Fourier pseudo-spectral schemes for the RLW equation

In this paper, two novel linear-implicit and momentum-preserving Fourier pseudo-spectral schemes are proposed and analyzed for the regularized long-wave equation. The numerical methods are based on the blend of the Fourier pseudo-spectral method in space and the linear-implicit Crank-Nicolson method or the leap-frog scheme in time. The two fully discrete linear schemes are shown to possess the discrete momentum conservation law, and the linear systems resulting from the schemes are proved uniquely solvable. Due to the momentum conservative property of the proposed schemes, the Fourier pseudo-spectral solution is proved to be bounded in the discrete $L^{\infty}$ norm. Then by using the standard energy method, both the linear-implicit Crank-Nicolson momentum-preserving scheme and the linear-implicit leap-frog momentum-preserving scheme are shown to have the accuracy of $\mathcal{O}(τ^2+N^{-r})$ in the discrete $L^{\infty}$ norm without any restrictions on the grid ratio, where $N$ is the number of nodes and $τ$ is the time step size. Numerical examples are carried out to verify the correction of the theory analysis and the efficiency of the proposed schemes.

math.NA↗

arXiv2018

Structure-preserving algorithms for the two-dimensional sine-Gordon equation with Neumann boundary conditions

This paper presents two kinds of strategies to construct structure-preserving algorithms with homogeneous Neumann boundary conditions for the sine-Gordon equation, while most existing structure-preserving algorithms are only valid for zero or periodic boundary conditions. The first strategy is based on the conventional second-order central difference quotient but with a cell-centered grid, while the other is established on the regular grid but incorporated with summation by parts (SBP) operators. Both the methodologies can provide conservative semi-discretizations with different forms of Hamiltonian structures and the discrete energy. However, utilizing the existing SBP formulas, schemes obtained by the second strategy can directly achieve higher-order accuracy while it is not obvious for schemes based on the cell-centered grid to make accuracy improved easily. Further combining the symplectic Runge-Kutta method and the scalar auxiliary variable (SAV) approach, we construct symplectic integrators and linearly implicit energy-preserving schemes for the two-dimensional sine-Gordon equation, respectively. Extensive numerical experiments demonstrate their effectiveness with the homogeneous Neumann boundary conditions.

math.NA↗

arXiv2018

A Novel Sixth Order Energy-Conserved Method for Three-Dimensional Time-Domain Maxwell's Equations

In this paper, a novel sixth order energy-conserved method is proposed for solving the three-dimensional time-domain Maxwell's equations. The new scheme preserves five discrete energy conservation laws, three momentum conservation laws, symplectic conservation law as well as two divergence-free properties and is proved to be unconditionally stable, non-dissipative. An optimal error estimate is established based on the energy method, which shows that the proposed method is of sixth order accuracy in time and spectral accuracy in space in discrete $L^{2}$-norm. The constant in the error estimate is proved to be only $O(T)$. Furthermore, the numerical dispersion relation is analyzed in detail and a fast solver is presented to solve the resulting discrete linear equations efficiently. Numerical results are addressed to verify our theoretical analysis.

math.NA↗

arXiv2017

Partitioned AVF methods

The classic second-order average vector field (AVF) method can exactly preserve the energy for Hamiltonian ordinary differential equations and partial differential equations. However, the AVF method inevitably leads to fully-implicit nonlinear algebraic equations for general nonlinear systems. To address this drawback and maintain the desired energy-preserving property, a first-order partitioned AVF method is proposed which first divides the variables into groups and then applies the AVF method step by step. In conjunction with its adjoint method we present the partitioned AVF composition method and plus method respectively to improve its accuracy to second order. Concrete schemes for two classic model equations are constructed with semi-implicit, linear-implicit properties that make considerable lower cost than the original AVF method. Furthermore, additional conservative property can be generated besides the conventional energy preservation for specific problems. Numerical verification of these schemes further conforms our results.

math.NA↗

arXiv2015

Discrete line integral method for the Lorentz force system

In this paper, we apply the Boole discrete line integral to solve the Lorentz force system which is written as a non-canonical Hamiltonian system. The method is exactly energy-conserving for polynomial Hamiltonians of degree $ν\leq 4$. In any other case, the energy can also be conserved approximatively. With comparison to well-used Boris method, numerical experiments are presented to demonstrate the energy-preserving property of the method.

math.NA↗

arXiv2014

A sixth order averaged vector field method

In this paper, based on the theory of rooted trees and B-series, we propose the concrete formulas of the substitution law for the trees of order =5. With the help of the new substitution law, we derive a B-series integrator extending the averaged vector field (AVF) method to high order. The new integrator turns out to be of order six and exactly preserves energy for Hamiltonian systems. Numerical experiments are presented to demonstrate the accuracy and the energy-preserving property of the sixth order AVF method.

math.NA↗

arXiv2003

Numerical Implementation of the Multisymplectic Preissman Scheme and Its Equivalent Schemes

We analyze the multisymplectic Preissman scheme for the KdV equation with the periodic boundary condition and show that the unconvergence of the widely-used iterative methods to solve the resulting nonlinear algebra system of the Preissman scheme is due to the introduced potential function. A artificial numerical condition is added to the periodic boundary condition. The added boundary condition makes the numerical implementation of the multisymplectic Preissman scheme practical and is proved not to change the numerical solutions of the KdV equation. Based on our analysis, we derive some new schemes which are not restricted by the artificial boundary condition and more efficient than the Preissman scheme because of less computing cost and less computer storages. By eliminating the auxiliary variables, we also derive two schemes for the KdV equation, one is a 12-point scheme and the other is an 8-point scheme. As the byproducts, we present two new explicit schemes which are not multisymplectic but still have remarkable numerical stable property.

math-ph↗