共查询到19条相似文献，搜索用时 140 毫秒
1.
几类辛方法的数值稳定性研究 总被引：1，自引：0，他引：1
主要对一阶隐式Euler辛方法M1、二阶隐式Euler中点辛方法M2、一阶显辛Euler方法M3和二阶leapfrog显辛积分器M4共4种辛方法及一些组合算法进行了通常意义下的线性稳定性分析．针对线性哈密顿系统,理论上找到每个数值方法的稳定区,然后用数值方法检验其正确性．对于哈密顿函数为实对称二次型的情况,为了理论推导便利,特推荐采用相似变换将二次型的矩阵对角化来研究辛方法的线性稳定性．当哈密顿分解为一个主要部分和一个小摄动次要部分且二者皆可积时,无论是线性系统还是非线性系统,这种主次分解与哈密顿具有动势能分解相比,明显扩大了辛方法的稳定步长范围． 相似文献
2.
《天文学进展》2021,(2)
辛算法作为研究哈密顿系统长期定性演化的最佳积分工具,自问世以来就受到了很大的关注。通过对哈密顿函数的截断误差分析,可以从不同角度构造出较高精度的辛算法,也可以通过引入正规化技术实现自动调整积分步长和改善数值稳定性。从辛算法的表现形式可以将它分为显式和隐式两种。当哈密顿系统能够分解为几个可积部分且每部分的解能用时间显函数来表示时,可以构造显式算法。显式算法有非力梯度显式辛算法、力梯度辛算法、辛校正、类高阶辛算法四种。当哈密顿系统变量不能分离时,适合应用隐式辛算法和扩充相空间对称算法求解。分别对这些算法的构造方法及其适用的物理模型进行归纳对比,分析了各种辛算法的优劣性和发展趋势,对如何选择辛算法高效高精度地解决实际问题提供了一定的理论和数值计算依据。 相似文献
3.
4.
对BaumgaLrte的稳定化和Chin的后稳定化进行了详尽讨论与数值比较．用经典数值方法并结合这两种稳定化方式都能提高数值精度和改善数值稳定性．在最佳稳定参数下稳定化精度一般不等价于后稳定化．两者精度优劣并无常定．考虑到Baumgarte的稳定化使得数值积分的右函数更复杂和增加计算耗费,尤其是存在稳定参数最佳选取的麻烦,故推荐后稳定化投入实算．但值得注意的是用后稳定化与没有经过稳定化处理的经典积分器来比不宜扩大积分步长． 相似文献
5.
本文对Runge—Katta差分格式与辛差分格式作了简单比较,给出了一种娄似于RKF方法的可变步长的辛算法,通过具体的数值计算验证了此方法的有效性. 相似文献
6.
推荐数值求解y‘’=f（x,y）的几组织分系数 总被引：1，自引：1，他引：0
为求解特殊二阶常微分方程ｙ＇＇＝ｆ（ｘ，ｙ）的初值问题，本文采用最大阶算子方法构造了一类线性多步积分公式，并与Ｃｏｗｅｌｌ方法的同阶公式作了大量的平等计算，通过对不同轨道类型、不同步长、不同积分间隔时的计算结果的全面仔细地分析比较，我们从八阶、十阶、十二阶、十四阶中各自选定一组积分系数，推荐给同行计算使用，结果表明，采用本文推荐的积分方法计算天体轨道是有益的，因为它的积分精度以及积分过程中误差累积 相似文献
7.
为求解特殊二阶常微分方程ｙ″＝（ｘ，ｙ）的初值问题，本文采用最大阶算子方法构造了一类线性多步积分公式，并与Ｃｏｗｅｌｌ方法的同阶公式作了大量的平行计算，通过对不同轨道类型、不同步长、不同积分间隔时的计算结果的全面仔细地分析比较，我们从八阶、十阶、十二阶、十四阶中各自选定一组积分系数，推荐给同行计算使用，结果表明，采用本文推荐的积分方法计算天体轨道是有益的，因为它的积分精度以及积分过程中误差累积的方式都十分明显地好于同阶的Ｃｏｗｅｌｌ方法。 相似文献
8.
9.
Hamilton系统数值计算的新方法 总被引：7，自引：0，他引：7
系统地介绍了近年来对Ｈａｍｉｌｔｏｎ系统数值计算新建立的辛算法和线性对称多步法，并对它们在动力天文中的应用作了一简要回顾。 相似文献
10.
11.
Xinhao Liao 《Celestial Mechanics and Dynamical Astronomy》1996,66(3):243-253
In this paper, following the idea of constructing the mixed symplectic integrator (MSI) for a separable Hamiltonian system, we give a low order mixed symplectic integrator for an inseparable, but nearly integrable, Hamiltonian system, Although the difference schemes of the integrators are implicit, they not only have a small truncation error but, due to near integrability, also a faster convergence rate of iterative solution than ordinary implicit integrators, Moreover, these second order integrators are time-reversible. 相似文献
12.
For a Hamiltonian that can be separated into N+1(N\geq 2) integrable parts, four algorithms can be built for a symplectic integrator. This research compares these algorithms for the
first and second order integrators. We found that they have similar local truncation errors represented by error Hamiltonian
but rather different numerical stability. When the computation of the main part of the Hamiltonian, H
0, is not expensive, we recommend to use S
* type algorithm, which cuts the calculation of the H
0 system into several small time steps as Malhotra(1991) did. As to the order of the N+1 parts in one step calculation, we found that from the large to small would get a slower error accumulation.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
13.
In this paper we consider almost integrable systems for which we show that there is a direct connection between symplectic methods and conventional numerical integration schemes. This enables us to construct several symplectic schemes of varying order. We further show that the symplectic correctors, which formally remove all errors of first order in the perturbation, are directly related to the Euler—McLaurin summation formula. Thus we can construct correctors for these higher order symplectic schemes. Using this formalism we derive the Wisdom—Holman midpoint scheme with corrector and correctors for higher order schemes. We then show that for the same amount of computation we can devise a scheme which is of order O(h
6)+(2
h
2), where is the order of perturbation and h the stepsize. Inclusion of a modified potential further reduces the error to O(h
6)+(2
h
4).This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
14.
《Chinese Astronomy and Astrophysics》2005,29(1):92-103
The symplectic integrator has been regarded as one of the optimal tools for research on qualitative secular evolution of Hamiltonian systems in solar system dynamics. An integrable and separate Hamiltonian system H = H0 + Σi=1N εiHi (εi ≪ 1) forms a pseudo third order symplectic integrator, whose accuracy is approximately equal to that of the first order corrector of the Wisdom-Holman second order symplectic integrator or that of the Forest-Ruth fourth order symplectic integrator. In addition, the symplectic algorithm with force gradients is also suited to the treatment of the Hamiltonian system H = H0(q,p) + εH1(q), with accuracy better than that of the original symplectic integrator but not superior to that of the corresponding pseudo higher order symplectic integrator. 相似文献
15.
Miloš Šidlichovský 《Celestial Mechanics and Dynamical Astronomy》1996,65(1-2):69-84
This paper reviews various mapping techniques used in dynamical astronomy. It is mostly dealing with symplectic mappings. It is shown that used mappings can be usually interpreted as symplectic integrators. It is not necessary to introduce any functions it is just sufficient to split Hamiltonian into integrable parts. Actually it may be shown that exact mapping with function in the Hamiltonian may be non-symplectic. The application to the study of asteroid belt is emphasised but the possible use of mapping in planetary evolution studies, cometary and other problems is shortly discussed. 相似文献
16.
This paper deals mainly with the application of the mixed leapfrog symplectic integrators with adaptive timestep to a conservative post-Newtonian Hamiltonian formulation with canonical spins for spinning compact binaries. The adaptive timestep depends on the two body separation r and the magnitude of the spins. Various numerical tests including a chaotic high-eccentricity orbit show that the fixed step symplectic integrators lost drastically the good long term behaviour in the test cases with large eccentricity, the adaptive timestep integrator is always superior to the constant step in the integral precision. 相似文献
17.
Jean-Marc Petit 《Celestial Mechanics and Dynamical Astronomy》1998,70(1):1-21
We investigate the numerical implementation of a symplectic integrator combined with a rotation (as in the case of an elongated
rotating primary). We show that a straightforward implementation of the rotation as a matrix multiplication destroys the conservative
property of the global integrator, due to roundoff errors. According to Blank et al. (1997), there exists a KAM-like theorem
for twist maps, where the angle of rotation is a function of the radius. This theorem proves the existence of invariant tori
which confine the orbit and prevent shifts in radius. We replace the rotation by a twist map or a combination of shears that
display the same kind of behaviour and show that we are able not only to recover the conservative properties of the rotation,
but also make it more efficient in term of computing time. Next we test the shear combination together with symplectic integrator
of order 2, 4, and 6 on a Keplerian orbit. The resulting integrator is conservative down to the roundoff errors. No linear
drift of the energy remains, only a divergence as the square root of the number of iterations is to be seen, as in a random
walk. We finally test the three symplectic integrators on a real case problem of the orbit of a satellite around an elongated
irregular fast rotating primary. We compare these integrators to the well-known general purpose, self-adaptative Bulirsch–Stoer
integrator. The sixth order symplectic integrator is more accurate and faster than the Bulirsch–Stoer integrator. The second-
and fourth- order integrators are faster, but of interest only when extreme speed is mandatory.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
18.
《Chinese Astronomy and Astrophysics》2007,31(2):172-186
In this paper, we analyze the linear stabilities of several symplectic integrators, such as the first-order implicit Euler scheme, the second-order implicit mid-point Euler difference scheme, the first-order explicit Euler scheme, the second-order explicit leapfrog scheme and some of their combinations. For a linear Hamiltonian system, we find the stable regions of each scheme by theoretical analysis and check them by numerical tests. When the Hamiltonian is real symmetric quadratic, a diagonalizing by a similar transformation is suggested so that the theoretical analysis of the linear stability of the numerical method would be simplified. A Hamiltonian may be separated into a main part and a perturbation, or it may be spontaneously separated into kinetic and potential energy parts, but the former separation generally is much more charming because it has a much larger maximum step size for the symplectic being stable, no matter this Hamiltonian is linear or nonlinear. 相似文献
19.
Orbit propagation algorithms for satellite relative motion relying on Runge–Kutta integrators are non-symplectic—a situation that leads to incorrect global behavior and degraded accuracy. Thus, attempts have been made to apply symplectic methods to integrate satellite relative motion. However, so far all these symplectic propagation schemes have not taken into account the effect of atmospheric drag. In this paper, drag-generalized symplectic and variational algorithms for satellite relative orbit propagation are developed in different reference frames, and numerical simulations with and without the effect of atmospheric drag are presented. It is also shown that high-order versions of the newly-developed variational and symplectic propagators are more accurate and are significantly faster than Runge–Kutta-based integrators, even in the presence of atmospheric drag. 相似文献