欧拉-拉格朗日系统的jet辛算法

研究了在欧拉-拉格朗日系统上的jet辛算法.证明了第二作者在1998年给出的一个离散的欧拉-拉格朗日(DEL)方程存在一个离散形式的几何结构,它沿着解是不变的,这个结构可以通过对离散的作用量函数求导得到.由此,可以给出此格式的jet辛性质.利用这个结构证明了与此DEL方程相关的离散Nother定理.最后,给出了一个欧拉-拉格朗日方程上的jet辛差分格式的数值算例,并与其它的差分格式进行了比较.     

高阶辛算法的稳定性与数值色散性分析

利用Maxwell方程的哈密尔顿函数,导出对应的欧拉-哈密尔顿方程.利用辛积分技术与高阶交错差分技术,建立求解三维时域Maxwell方程的高阶辛算法;结合电磁场中的物理概念,借助矩阵分析和张量分析理论,获得高阶时域方法及高阶辛算法的稳定性和数值色散性的统一处理新方法.用数值结果证实方法的正确性,与FDTD算法和其它时域高阶方法相比,高阶辛算法具有较大的计算优势,为电磁计算提供了新的途径.     

一维Gross-Pitaevskii方程的高阶紧致分裂步多辛格式

首先把一维Gross-Pitaevskli方程改写成多辛Hamiltonian系统的形式,把形式通过分裂变成2个子哈密尔顿系统.然后,对这些子系统用辛或者多辛算法进行离散.通过对子系统数值算法的不同组合方式,得到不同精度的具有多辛算法特征数值格式.这些格式不仅具有多辛格式、分裂步方法和高阶紧致格式的特征,而且是质量守恒的.数值实验验证了新格式的数值行为.     

辛算法在限制性三体问题数值研究中的应用

限制性三体问题是太阳系动力学中常采用的一种力学模型,是一哈密顿(Hamilton)系统.由于数学工具的不够,一些重要问题只能进行数值研究,但要了解系统的演化状况,必须进行长期跟踪计算.因此,对算法要求极高,应能保持运动的整体特征,而Hamilton系统的辛算法正符合这一要求,文章将利用算法合成构造旋转坐标系中圆型和椭圆型限制性三体问题(对应不可分Hamilton系统)的显式辛差分格式,并以计算实例表明方法的有效性.     

Klein-Gordon-Schr(o)dinger方程的辛Fourier拟谱格式

主要讨论Klein-Gordon-Sehrodinger方程的Fourier拟谱辛格式,包括中点公式和Stormer/Vedet格式.首先构造一个哈密尔顿方程,针对此哈密尔顿方程,在空间方向用Fourier拟谱离散得到一个有限维的哈密尔顿系统,对此有限维系统在时间方向用St(o)rmer/Verlet方法离散得到KGS...     

辛差分格式的守恒量及其稳定性

讨论了Ｈａｍｉｌｔｏｎ系统辛差分格式守恒量的存在性问题以及它们与辛差分格式的稳定性间的关系。结果表明，辛差分格式使Ｈａｍｉｌｔｏｎ系统的所有守恒量随时间没有线性变化。一般情况下，差分格式稳定，其守恒量收敛。     

非完整系统Boltzmann-Hamel方程的Birkhoff化及其广义辛算法

针对非完整系统的Boltzmann-Hamel方程,当其满足一定条件时,可以进行广义Birkhoff化.构造生成函数,利用当前比较优越的非自治Birkhoff广义辛算法对其进行数值仿真.仿真结果和传统的Runge-Kutta算法结果相比较,非自治Birkhoff广义辛算法在长期跟踪后更加准确.     

辛和非辛算法求解薛定谔方程误差分析

在哈密尔顿体系下,提出气体声波传播的一种新的谐振子模型,并引入群论确定气体声波传播过程中的分子振动模式、能级简并.新模型将气动声学声传播问题与分子振动关联起来。由于发展高效的薛定谔方程的数值计算方法,有利于联系分子的性质来解释声的传播.本文从此出发,用二阶有限差分格式和生成函数法构造的二阶辛格式分别计算一维定态谐振子势场和含时谐振子势场的薛定谔方程,分析了数值解的误差以及传播能量误差.结果表明辛算法具有明显的优势.     

Klein-Gordon-Schrdinger方程的辛Fourier拟谱格式(英文)

主要讨论Klein-Gordon-Schrdinger方程的Fourier拟谱辛格式,包括中点公式和Strmer/Verlet格式.首先构造一个哈密尔顿方程,针对此哈密尔顿方程,在空间方向用Fourier拟谱离散得到一个有限维的哈密尔顿系统,对此有限维系统在时间方向用Strmer/Verlet方法离散得到KGS方程的完全显式的辛格式.中点格式虽然是隐式的但效率也很高,且具有质量守恒律.数值实验表明,辛格式能够在长时间内很好地模拟各类孤立波.     

基于多步高阶差分格式求解时域Maxwell方程

提出基于无穷维哈密尔顿系统及分裂算子理论的多步高阶差分格式,求解时域Maxwell方程.在时间方向上,针对Maxwell方程采用不同阶数的辛算法进行差分离散;在空间方向上,采用四阶差分格式进行差分离散.探讨多步高阶差分格式的稳定性及数值色散性,最后给出数值计算结果.结果表明,五级四阶格式为最有效的多步高阶差分格式,具有高精度、占用较少的计算机资源等优点,适用于长时间的数值模拟.     

Symplectic Schemes for Birkhoffian System

A universal symplectic structure for a Newtonian system including nonconservative cases can be constructed in the framework of Birkhoffian generalization of Hamiltonian mechanics. In this paper the symplectic geometry structure of Birkhoffian system is discussed, then the symplecticity of Birkhoffian phase flow is presented. Based on these properties we give a way to construct symplectic schemes for Birkhoffian systems by using the generating function method.     

Birkhoffian symplectic algorithms derived from Hamiltonian symplectic algorithms

In this paper, we focus on the construction of structure preserving algorithms for Birkhoffian systems, based on existing symplectic schemes for the Hamiltonian equations. The key of the method is to seek an invertible transformation which drives the Birkhoffian equations reduce to the Hamiltonian equations. When there exists such a transformation,applying the corresponding inverse map to symplectic discretization of the Hamiltonian equations, then resulting difference schemes are verified to be Birkhoffian symplectic for the original Birkhoffian equations. To illustrate the operation process of the method, we construct several desirable algorithms for the linear damped oscillator and the single pendulum with linear dissipation respectively. All of them exhibit excellent numerical behavior, especially in preserving conserved quantities.     

Noncommutative Differential Calculus Approach to Discrete Symplectic Schemes on Regular Lattice

By means of a noncommutative differential calculus on function space of discrete Abelian groups and that of the regular lattice with equal spacing as well as the discrete symplectic geometry and a kind of classical mechanical systems with separable Hamiltonian of the type H(p, q) = T(p) + V(q) on regular lattice, we introduce the discrete symplectic algorithm, i.e., the phase-space discrete counterpart of the symplectic algorithm including original symplectic schemes and the jet-symplectic schemes in terms of the discrete time jet bundle formalism, on the regular lattice. We show some numerical calculation examples and compare the results of different schemes.     

Birkhoffian Symplectic Scheme for a Quantum System

In this paper, a classical system of ordinary differential equations is built to describe a kind of n-dimensional quantum systems. The absorption spectrum and the density of the states for the system are defined from the points of quantum view and classical view. From the Birkhoffian form of the equations, a Birkhoffian symplectic scheme is derived for solving n-dimensional equations by using the generating function method. Besides the Birkhoffian structure- preserving, the new scheme is proven to preserve the discrete local energy conservation law of the system with zero vector f . Some numerical experiments for a 3-dimensional example show that the new scheme can simulate the general Birkhoffian system better than the implicit midpoint scheme, which is well known to be symplectic scheme for Hamiltonian system.     

保辛结构的哈密顿方程计算方法

简单介绍关于辛几何和哈密顿力学某些概念和事实。并介绍一些简单常用的各种各样辛差分格式。     

Schrödinger方程的辛结构与量子力学的辛算法

冯康开创的哈密顿力学的辛算法取得了惊人的成功.这是因为哈密顿力学的数学框架是辛几何,一个合理的离散方法自然应使离散哈密顿力学保持辛结构.本文指出,经过适当的变换,Schrödinger方程也具有辛结构,从而把哈密顿力学的辛算法,推广用到量子力学.作为例子计算了中子在旋转磁场中的演化.计算结果表明,辛算法明显优于通常算法,特别是对演化时间长的情况.     

Symplectic Euler Method for Nonlinear High Order Schrödinger Equation with a Trapped Term

In this paper, we establish a family of symplectic integrators for a class of high order Schrödinger equations with trapped terms. First, we find its symplectic structure and reduce it to a finite dimensional Hamilton system via spatial discretization. Then we apply the symplectic Euler method to the Hamiltonian system. It is demonstrated that the scheme not only preserves symplectic geometry structure of the original system, but also does not require to resolve coupled nonlinear algebraic equations which is different from the general implicit symplectic schemes. The linear stability of the symplectic Euler scheme and the errors of the numerical solutions are investigated. It shows that the semi-explicit scheme is conditionally stable, first order accurate in time and $2l^{th}$ order accuracy in space. Numerical tests suggest that the symplectic integrators are more effective than non-symplectic ones, such as backward Euler integrators.     

Difference Discrete Variational Principles,Euler—Lagrange Cohomology and Symplectic,Multisymplectic Structures Ⅲ：Application to Symplectic and Multisymplectic Algorithms

In the previous papers I and II,we have studied the difference discrete variational principle and the Euler-Lagrange cohomology in the framework of multi-parameter differential approach.We have gotten the difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of classical mechanics and field theory as well as the difference discrete versions for the Euler-Lagrange cohomology and applied them to get the necessary and sufficient condition for the symplectic or multisymplectic geometry preserving properties in both the lagrangian and Hamiltonian formalisms.In this paper,we apply the difference discrete variational principle and Euler-Lagrange cohomological approach directly to the symplectic and multisymplectic algorithms.We will show that either Hamiltonian schemes of Lagrangian ones in both the symplectic and multisymplectic algorithms are variational integrators and their difference discrete symplectic structure-preserving properties can always be established not only in the solution space but also in the function space if and only if the related closed Euler-Lagrange cohomological conditions are satisfied.