线性哈密尔顿系统的块方法(英文)  

Block methods for linear Hamiltonian systems

作　　者：田红炯[1] 陈佰林 

机构地区：[1]上海师范大学数理学院,上海200234

出　　处：《上海师范大学学报（自然科学版）》2014年第1期9-21,共13页Journal of Shanghai Normal University(Natural Sciences)

基　　金：supported in part by the E-Institutes of Shanghai Municipal Education Commission(E03004);the NSF of China(11071170);the Ministry of Education of China(211058);the Specialized Research Fund for the Doctoral Program of Higher Education(20113127110003);Shanghai Municipal Education Commission(11ZZ118)

摘　　要：对于哈密尔顿系统的数值求解,辛算法被认为是最合适的选择.主要研究一类具有至少k+1阶收敛性的k维块方法求解线性哈密尔顿系统的适用性,证明了当维数k不超过8时该类方法具有保持辛结构和二次型的性质.数值例子验证了理论结果.For the numerical treatment of Hamiltonian differential equations,symplectic integrators are regarded as the most suitable choice.In this paper we are concerned with the applicability of block methods for the discrete approximate solution of linear Hamiltonian systems.The k-dimensional block methods are convergent of order at least k＋1 for ordinary differential equations.We provide conditions on the coefficients of the equivalent block methods in order to maintain two important properties of linear Hamiltonian problems.It is shown that the k-dimensional block method which is convergent of order at least k＋1 is symplectic and preserves the quadratic form at the last point of the block for k=1 ,2,…,8.Numerical experiment is given to illustrate the performance of the block methods.

关 键 词：块方法 哈密尔顿系统 线性系统 辛算法 二次型 

分 类 号：O241.81[理学—计算数学]