KdV方程的时间谱离散方法

本文提出了解KdV方程周期边值问题的安全港离散方法:在时间方向上采用Chebyshev拟谱逼近,在空间方向上采用Fourier Galerkin逼近。谱展开的系数由目标泛函的极小值来确定。同时证明了该方法的收敛性。     

新的辅助方程法构造KdV方程的行波解

应用一种新的辅助方程法成功地获得了(1+1)维KdV方程的多个含有参数的精确行波解,所得的解涵盖了已有结果．与其它方法相比,所给出的方法具有简单高效、计算量小、速度快、易于求解等特点．另外,所给的方法还可以用来求解其它的一大类非线性发展方程的精确行波解．     

广义KdV—Burgers方程吸引子的谱逼近

１引言近年来．随着对无限维动力系统研究的深入,人们对非线性发展方程解的渐近性态了解得越来越多．例如对某些耗散的非线性发展方程,象Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程、Ｋｕｒａｍｏｔｏ－Ｓｉｖａｓｈｉｎ－ｓｋｙ方程等都存在整体的吸引子．系统的渐近性质和系统的复杂性完全由整体吸引子所确定（详细请参见［３］）．与此同时,这类系统的有限维逼近也是人们非常关心的问题,在这方面已有许多工作,如Ｊ．Ｋ．Ｈａｌｅ等人在［５］中基于有限元方法研究了某些非线性发展方程．得到了近似吸引子是上半连续的;Ｃ．Ｍ．Ｅｌｌｏｔｔａ…     

超KdV方程的减缩摄动解法

利用减缩摄动法(Reductive Perturbation Method)将超KdV方程变换为普通KdV方程,并求出了小振幅摄动解.     

KdV方程的一类本性并行差分格式

对三阶KdV方程给出了—组非对称的差分公式,并用这些差分公式和对称的Crank-Nicolson型公式构造了一类具有本性并行的交替差分格式．证明了格式的线性绝对稳定性．对—个孤立波解、二个孤立波解和三个孤立波解的情况分别进行了数值试验,并对—个孤立波解的数值解的收敛阶和精确性进行了试验和比较．     

广义KdV方程Fourier谱逼近的最优误差估计

分析了一类带周期边界条件的广义KdV方程Fourier谱方法,得到了L2范数下最优误差估计,改进了由Maday和Quarteroni给出的结果.还提出了一种修改Fourier拟谱方法,并且证明它享有与Fourier谱方法同样的收敛性.     

关于KdV方程孤子解的研究

KdV方程的多孤子解很难直接验证，本文通过证明GLM反散射变换方程导出的Jost解满足两个Lax方程的方法，解决了这个问题．     

KdV方程及其相应的约束条件

§1.引言 众所周知,许多著名的孤子方程有两种换位表示。1968年,Lax引入算子L,M,其中L是联系谱问题的算子,M是相应于演化方程的算子:     

高维弱扰动破裂孤子波方程行波解

研究了一类高维弱扰动破裂孤子波方程.首先讨论了对应的典型破裂孤子波方程, 利用待定系数投射方法得到了孤子波精确解.再利用泛函分析和摄动理论得到了原弱扰动破裂孤子波方程的孤子行波渐近解.最后, 举出例子说明了用该方法得到的弱扰动破裂孤子波方程的行波渐近解具有简捷、有效和较高精度的优点.     

一类广义KdV方程组的谱和拟谱方法

1.引 言在孤立子的研究中起着重要作用的典型方程-KdV方程已有不少作者[1-5]在数学分析上做了许多深入的研究,文[6]讨论了如下一类高阶广义KdV方程组     

第二类Volterra型积分方程的Chebyshev-Legendre谱配置方法

提出了一种新的求解第二类线性Volterra型积分方程的Chebyshev谱配置方法.该方法分别对方程中积分部分的核函数和未知函数在Chebyshev-Gauss-Lobatto点上进行插值,通过Chebyshev-Legendre变换,把插值多项式表示成Legendre级数形式,从而将积分转换为内积的形式,再利用Legendre多项式的正交性进行计算.利用Chebyshev插值算子在不带权范数意义下的逼近结果,对该方法在理论上给出了L∞范数意义下的误差估计,并通过数值算例验证了算法的有效性和理论分析的正确性.     

Piecewise spectral collocation method for system of Volterra integral equations

The main purpose of this paper is to investigate the piecewise spectral collocation method for system of Volterra integral equations. The provided convergence analysis shows that the presented method performs better than global spectral collocation method and piecewise polynomial collocation method. Numerical experiments are carried out to confirm these theoretical results.     

Chebyshev spectral collocation method for system of nonlinear Volterra integral equations

Numerical Algorithms - We investigate Chebyshev spectral collocation method for system of nonlinear Volterra integral equations. We choose Chebyshev Gauss points as collocation points, and...     

Least‐squares spectral collocation method for the Stokes equations

First‐order system least‐squares spectral collocation methods are presented for the Stokes equations by adopting the first‐order system and modifying the least‐squares functionals in 2 . Then homogeneous Legendre and Chebyshev (continuous and discrete) functionals are shown to be elliptic and continuous with respect to appropriate product weighted norms. The spectral convergence is analyzed for the proposed methods with some numerical experiments. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 128–139, 2004     

A Chebyshev spectral collocation method for solving Burgers’-type equations

In this paper, we elaborated a spectral collocation method based on differentiated Chebyshev polynomials to obtain numerical solutions for some different kinds of nonlinear partial differential equations. The problem is reduced to a system of ordinary differential equations that are solved by Runge–Kutta method of order four. Numerical results for the nonlinear evolution equations such as 1D Burgers’, KdV–Burgers’, coupled Burgers’, 2D Burgers’ and system of 2D Burgers’ equations are obtained. The numerical results are found to be in good agreement with the exact solutions. Numerical computations for a wide range of values of Reynolds’ number, show that the present method offers better accuracy in comparison with other previous methods. Moreover the method can be applied to a wide class of nonlinear partial differential equations.     

A Jacobi spectral collocation method for solving multi-dimensional nonlinear fractional sub-diffusion equations

Graf’s and Neumann’s addition theorems for Bessel functions have been widely used in acoustic and electromagnetic scattering problems, especially the fast multipole method for 2-D scattering problems. This paper studies the truncation errors of Graf’s and Neumann’s addition theorems and their linear combinations. Explicit bounds and convergence rates of the truncation errors are derived, and convergence calculated. The conclusions are tested by numerical experiments and show that the derived bounds for the truncation errors of the addition theorems are valid.     

Numerical solutions for some coupled nonlinear evolution equations by using spectral collocation method

In this paper, we introduce a spectral collocation method based on Lagrange polynomials for spatial derivatives to obtain numerical solutions for some coupled nonlinear evolution equations. The problem is reduced to a system of ordinary differential equations that are solved by the fourth order Runge–Kutta method. Numerical results of coupled Korteweg–de Vries (KdV) equations, coupled modified KdV equations, coupled KdV system and Boussinesq system are obtained. The present results are in good agreement with the exact solutions. Moreover, the method can be applied to a wide class of coupled nonlinear evolution equations.     

Mass and momentum conservation of the least-squares spectral collocation method for the Navier-Stokes equations

From the literature, it is known that the Least-Squares Spectral Element Method (LSSEM) for the stationary Stokes equations performs poorly with respect to mass conservation but compensates this lack by a superior conservation of momentum. Furthermore, it is known that the Least-Squares Spectral Collocation Method (LSSCM) leads to superior conservation of mass and momentum for the stationary Stokes equations. In the present paper, we consider mass and momentum conservation of the LSSCM for time-dependent Stokes and Navier-Stokes equations. We observe that the LSSCM leads to improved conservation of mass (and momentum) for these problems. Furthermore, the LSSCM leads to the well-known time-dependent profiles for the velocity and the pressure profiles. To obtain these results, we use only a few elements, each with high polynomial degree, avoid normal equations for solving the overdetermined linear systems of equations and introduce the Clenshaw-Curtis quadrature rule for imposing the average pressure to be zero. Furthermore, we combined the transformation of Gordon and Hall (transfinite mapping) with the least-squares spectral collocation scheme to discretize the internal flow problems.     

Legendre–Gauss–Lobatto spectral collocation method for nonlinear delay differential equations

A Legendre–Gauss–Lobatto spectral collocation method is introduced for the numerical solutions of a class of nonlinear delay differential equations. An efficient algorithm is designed for the single‐step scheme and applied to the multiple‐domain case. As a theoretical result, we obtain a general convergence theorem for the single‐step case. Numerical results show that the suggested algorithm enjoys high‐order accuracy both in time and in the delayed argument and can be implemented in a robust and efficient manner. Copyright © 2013 John Wiley & Sons, Ltd.     

Least-squares spectral collocation with the overlapping Schwarz method for the incompressible Navier–Stokes equations

A least-squares spectral collocation scheme is combined with the overlapping Schwarz method. The methods are succesfully applied to the incompressible Navier–Stokes equations. The collocation conditions and the interface conditions lead to an overdetermined system which can be efficiently solved by least-squares. The solution technique will only involve symmetric positive definite linear systems. The overlapping Schwarz method is used for the iterative solution. For parallel implementation the subproblems are solved in a checkerboard manner. Our approach is successfully applied to the lid-driven cavity flow problem. Only a few Schwarz iterations are necessary in each time step. Numerical simulations confirm the high accuracy of our spectral least-squares scheme.