On the development of a triple‐preserving Maxwell's equations solver in non‐staggered grids

We present in this paper a finite difference solver for Maxwell's equations in non‐staggered grids. The scheme formulated in time domain theoretically preserves the properties of zero‐divergence, symplecticity, and dispersion relation. The mathematically inherent Hamiltonian can be also retained all the time. Moreover, both spatial and temporal terms are approximated to yield the equal fourth‐order spatial and temporal accuracies. Through the computational exercises, modified equation analysis and Fourier analysis, it can be clearly demonstrated that the proposed triple‐preserving solver is computationally accurate and efficient for use to predict the Maxwell's solutions. Copyright © 2009 John Wiley & Sons, Ltd.     

Energy and Quadratic Invariants Preserving Methods for Hamiltonian Systems with Holonomic Constraints

We introduce a new class of parametrized structure--preserving partitioned Runge-Kutta ($\alpha$-PRK) methods for Hamiltonian systems with holonomic constraints. The methods are symplectic for any fixed scalar parameter $\alpha$, and are reduced to the usual symplectic PRK methods like Shake-Rattle method or PRK schemes based on Lobatto IIIA-IIIB pairs when $\alpha=0$. We provide a new variational formulation for symplectic PRK schemes and use it to prove that the $\alpha$-PRK methods can preserve the quadratic invariants for Hamiltonian systems subject to holonomic constraints. Meanwhile, for any given consistent initial values $(p_{0}, q_0)$ and small step size $h>0$, it is proved that there exists $\alpha^*=\alpha(h, p_0, q_0)$ such that the Hamiltonian energy can also be exactly preserved at each step. Based on this, we propose some energy and quadratic invariants preserving $\alpha$-PRK methods. These $\alpha$-PRK methods are shown to have the same convergence rate as the usual PRK methods and perform very well in various numerical experiments.     

Characterizations and construction of Poisson/symplectic and symmetric multi-revolution implicit Runge–Kutta methods of high order

This paper deals with the characterizations and construction of Poisson/symplectic and (φ⁻¹)-symmetric implicit high-order multi-revolution Runge–Kutta methods (MRRKMs). The basic tool is a modified W-transformation based on quadrature formulas and orthogonal polynomials. Two sufficient conditions can be obtained under which MRRKMs are Poisson/symplectic or (φ⁻¹)-symmetric. We construct two classes of high order implicit MRRKMs by using these sufficient conditions. Our results can be considered as an extension of related results of the standard Runge–Kutta methods in some references.     

Runge-kutta method, finite element method, and regular algorithms for hamiltonian system

The symplectic algorithm and the energy conservation algorithm are two important kinds of algorithms to solve Hamiltonian systems. The symplectic RungeKutta (RK) method is an important part of the former, and the continuous finite element method (CFEM) belongs to the later. We find and prove the equivalence of one kind of the implicit RK method and the CFEM, give the coefficient table of the CFEM to simplify its computation, propose a new standard to measure algorithms for Hamiltonian systems, and define another class of algorithms—the regular method. Finally, numerical experiments are given to verify the theoretical results.     

Hamilton系统的对称辛广义加性Runge-Kutta方法

Sandu和Günther[SIAM J.Numer.Anal.53(2015)17--42]对形如$\dot{y}=\sum\limits_{k=1}^{N}f^{[k]}(y)$的微分方程提出广义加性Runge-Kutta (GARK)方法.本文利用双色有根树导出GARK方法的阶条件,给出辛条件和对称性条件,并构造了三个二阶对称辛GARK (SSGARK)方法和两个四阶SSGARK方法.对三个经典测试问题的数值实验结果显示,与文献中几个非对称或非辛的ARK/GARK方法相比,新的SSGARK方法能更有效地保持Hamilton量.     

ON CONJUGATE SYMPLECTICITY OF MULTI-STEP METHODS

1. Introduction.For an ordinary differential equationany compatible linear m-step difference scheme (for simplicity) denoted by LMSM):can be characterized by a step-transition operator G (also denoted by G"): Re - Resatisfyingwhere Gb stands for k-time composition of G: G o G' o G (refer to [1-4]).The operator G defined by (3) can be represented as a power series in T with firstterm equal to identity i. More preciselys it is shown[4] thatLemma A. If scheme (2) is Of order s, then the…