空间分数阶Schr?dinger方程调制不稳定性的数值研究

调制不稳定性在数学和物理等学科中应用十分广泛.本文主要通过分裂谱方法对空间分数阶薛定谔方程进行数值计算,并根据Benjamin-Feir-Lighthill准则推导了非线性薛定谔方程的调制不稳定条件.文中分别研究了空间分数阶薛定谔方程在不同初值条件下的不稳定行为,并与整数阶薛定谔方程的不稳定性行为作比较,通过数值比较分析,发现整数阶薛定谔方程的这种不稳定行为对于空间分数阶薛定谔方程同样存在.     

刚-柔体动力学方程的保辛摄动迭代法

针对刚-柔体动力学方程,提出保辛摄动迭代算法.该方法把刚-柔体动力学方程的低频运动和高频振动分开处理,用保辛摄动的思想来处理低、高频耦合作用,从而可以采用较大时间步长进行数值积分,即可给出满意的数值结果,很好地解决了刚性积分问题.数值算例表明该方法是可行的.     

2+1维sine-Gordon方程多辛格式的复合构造

以2+1维sine-Gordon方程为例,提出构造多辛算法的一种复合方法, 即: 独立地辛离散多辛偏微分方程的各个方向, 复合这些辛离散格式得到原偏微分方程的多辛算法. 通过这种复合方法, 可以构造任意阶精度的多辛算法,其中包括一些常用算法. 孤立子的数值模拟试验说明所给出的多辛算法是有效的.     

非线性第二类Volterra积分方程的Chebyshev谱配置法

我们在参考了相关文献的基础上,考察了一类非线性Volterra积分方程的Chebyshev谱配置法.方法中,我们将该类非线性方程转化为两个方程进行数值逼近.我们选择N阶Chebyshev Gauss-Lobatto点作为配置点,对积分项用N阶高斯数值积分公式逼近.收敛性分析结果表明数值误差的收敛阶为N^（1/2）-m,其中m是已知函数最高连续导数的阶数.我们也开展数值实验证实这一理论分析结果.     

薛定谔方程在非一致网格下数值模拟的界面条件

本文研究了一维线性薛定谔方程在非一致网格下数值模拟的问题.在数值模拟中,非一致网格在界面处会产生虚假反射,利用局部时间步长和界面条件的方法,成功的减小了虚假反射.改进和提高了薛定谔方程数值模拟的效率和精度.     

时空分数阶薛定谔方程的指数时间差分方法

本文针对时空分数阶非线性薛定谔方程,提出了应用Padé近似逼近Mittag-Leffler函数的指数时间差分格式,讨论了提高格式计算效率的方法.本文在具有各种参数的时空分数阶非线性薛定谔方程上进行了数值实验,实验结果说明了所提出方法的准确性、有效性和可靠性.     

四阶椭圆型方程奇异摄动问题的数值解

本文对一类四阶椭圆型方程奇异摄动问题建立了指数型拟合差分格式,并且证明了这种格式在能量范数意义下关于小参数ε的一致收敛性.最后,我们给出了数值结果.     

基于广义高阶非线性薛定谔方程深海内波传播的数值模拟

基于与实际海洋背景参数相关的广义高阶非线性薛定谔方程,首先讨论了不同的海洋环境参数对方程的非线性项和频散项的影响;然后通过有限差分算子给出了方程的二阶三层数值差分格式,并且分析了该差分格式的稳定性与精度阶;最后又通过得到的差分格式数值模拟了不同的海洋环境参数下深海内波的传播情况,结果显示:内波由深海向浅海的传播过程中,随着总水深的变化,发生了分裂现象,并且密度差之比越大,波的分裂速度越快.     

非线性薛定谔方程的平均向量场方法

利用平均向量场方法(AVF)对非线性薛定谔方程进行求解, 在理论上得到了一个保非线性薛定谔方程描述的系统能量守恒的AVF格式, 再分别用非线性薛定谔方程的AVF格式和辛格式数值模拟孤立波的演化行为, 并比较两个格式是否保系统能量守恒特性. 数值结果表明, AVF格式也能很好地模拟孤立波的演化行为,并且比辛格式更能保持系统的能量守恒.     

离散空间分数阶非线性薛定谔方程的MHSS型迭代方法

利用隐式守恒型差分格式来离散空间分数阶非线性薛定谔方程,可得到一个离散线性方程组.该离散线性方程组的系数矩阵为一个纯虚数复标量矩阵、一个对角矩阵与一个对称Toeplitz矩阵之和.基于此,本文提出了用一种\textit{修正的埃尔米特和反埃尔米特分裂}(MHSS)型迭代方法来求解此离散线性方程组.理论分析表明,MHSS型迭代方法是无条件收敛的.数值实验也说明了该方法是可行且有效的.     

Perturbed collocation and symplectic RKN methods

It is known that many Runge-Kutta-Nystr?m methods can be derived by collocation. In this paper we prove that the onlys-stage symplectic Runge-Kutta-Nystr?m method that can be obtained by ordinary collocation is of order 2s and implicit. We also extend the idea of perturbed collocation to Runge-Kutta-Nystr?m methods and derive symplectic Runge-Kutta-Nystr?m methods using this technique. We have obtained symplectic implicits-stage Runge-Kutta-Nystr?m methods of order 2s−1 and 2s−2.     

Perturbed collocation and symplectic RKN methods

It is known that many Runge-Kutta-Nyström methods can be derived by collocation. In this paper we prove that the onlys-stage symplectic Runge-Kutta-Nyström method that can be obtained by ordinary collocation is of order 2s and implicit. We also extend the idea of perturbed collocation to Runge-Kutta-Nyström methods and derive symplectic Runge-Kutta-Nyström methods using this technique. We have obtained symplectic implicits-stage Runge-Kutta-Nyström methods of order 2s?1 and 2s?2.     

Symplectic and multi-symplectic wavelet collocation methods for two-dimensional Schrödinger equations

In this paper, we develop symplectic and multi-symplectic wavelet collocation methods to solve the two-dimensional nonlinear Schrödinger equation in wave propagation problems and the two-dimensional time-dependent linear Schrödinger equation in quantum physics. The Hamiltonian and the multi-symplectic formulations of each equation are considered. For both formulations, wavelet collocation method based on the autocorrelation function of Daubechies scaling functions is applied for spatial discretization and symplectic method is used for time integration. The conservation of energy and total norm is investigated. Combined with splitting scheme, splitting symplectic and multi-symplectic wavelet collocation methods are also constructed. Numerical experiments show the effectiveness of the proposed methods.     

A NOTE ON TWO-DIMENSIONAL SYMPLECTIC SCHEME-SHOOTING METHOD FOR SOLVING THE SCHRDINGER EQUATION

The symplectic scheme-shooting method (SSSM) for solving the two-dimensional time-independent Schrodinger equation is presented. The generalized time-independent Schrodinger equation based on the active and cyclic coordinates is evaluated. The procedure of the separation of the active and cyclic coordinates of A2B type molecule (C2(?) symmetry) is given.     

一类常微分方程的非多项式样条函数逼近解

本文提出一种新的数值方法来获得三阶带障碍边值问题的常微分方程的数值解,这类方法的基函数包括三角函数、指数函数、多项式函数。本文将给出一数值例子说明这种方法优于其他差分法、配置法、多项式样条函数法。     

On high order symmetric and symplectic trigonometrically fitted Runge-Kutta methods with an even number of stages

The existence and construction of symplectic 2s-stage variable coefficients Runge-Kutta (RK) methods that integrate exactly IVPs whose solution is a trigonometrical polynomial of order s with a given frequency ω is considered. The resulting methods, that can be considered as trigonometrical collocation methods, are fully implicit, symmetric and symplectic RK methods with variable nodes and coefficients that are even functions of ν=ω h (h is the step size), and for ω→0 they tend to the conventional RK Gauss methods. The present analysis extends previous results on two-stage symplectic exponentially fitted integrators of Van de Vyver (Comput. Phys. Commun. 174: 255–262, 2006) and Calvo et al. (J. Comput. Appl. Math. 218: 421–434, 2008) to symmetric and symplectic trigonometrically fitted methods of high order. The algebraic order of the trigonometrically fitted symmetric and symplectic 2s-stage methods is shown to be 4s like in conventional RK Gauss methods. Finally, some numerical experiments with oscillatory Hamiltonian systems are presented.     

Efficient implementation of symplectic implicit Runge-Kutta schemes with simplified Newton iterations

We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of Hamiltonian ordinary differential equations by means of Newton-like iterations. We pay particular attention to time-symmetric symplectic IRK schemes (such as collocation methods with Gaussian nodes). For an s-stage IRK scheme used to integrate a \(\dim \)-dimensional system of ordinary differential equations, the application of simplified versions of Newton iterations requires solving at each step several linear systems (one per iteration) with the same \(s\dim \times s\dim \) real coefficient matrix. We propose a technique that takes advantage of the symplecticity of the IRK scheme to reduce the cost of methods based on diagonalization of the IRK coefficient matrix. This is achieved by rewriting one step of the method centered at the midpoint on the integration subinterval and observing that the resulting coefficient matrix becomes similar to a skew-symmetric matrix. In addition, we propose a C implementation (based on Newton-like iterations) of Runge-Kutta collocation methods with Gaussian nodes that make use of such a rewriting of the linear system and that takes special care in reducing the effect of round-off errors. We report some numerical experiments that demonstrate the reduced round-off error propagation of our implementation.     

A subdivision collocation method for solving two point boundary value problems of order three

In this paper, we propose a method for the numerical solution of self adjoint singularly perturbed third order boundary value problems in which the highest order derivative is multiplied by a small parameter $\varepsilon$. In this method, first we introduce the derivatives of two scale relations satisfied by the subdivision schemes. After that we use these derivatives to construct the subdivision collocation method for the numerical solution of singularly perturbed boundary value problems. Convergence of the subdivision collocation method is also discussed. Numerical examples are presented to illustrate the proposed method.     

Symplectic Runge-Kutta methods with real eigenvalues

Iserles [1] constructed symplectic Runge-Kutta methods with real eigenvalues with the help of perturbed collocation. This note shows that such methods can comfortably be obtained using theW-transformation of [2].     

Structure preservation of exponentially fitted Runge–Kutta methods

The preservation of some structure properties of the flow of differential systems by numerical exponentially fitted Runge–Kutta (EFRK) methods is considered. A complete characterisation of EFRK methods that preserve linear or quadratic invariants is given and, following the approach of Bochev and Scovel [On quadratic invariants and symplectic structure, BIT 34 (1994) 337–345], the sufficient conditions on symplecticity of EFRK methods derived by Van de Vyver [A fourth-order symplectic exponentially fitted integrator, Comput. Phys. Comm. 174 (2006) 255–262] are obtained. Further, a family of symplectic EFRK two-stage methods with order four has been derived. It includes the symplectic EFRK method proposed by Van de Vyver as well as a collocation method at variable nodes that can be considered as the natural collocation extension of the classical RK Gauss method. Finally, the results of some numerical experiments are presented to compare the relative merits of several fitted and nonfitted fourth-order methods in the integration of oscillatory systems.