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.     

A criterion forP-stability properties of Runge-Kutta methods

P-stability is an analogous stability property toA-stability with respect to delay differential equations. It is defined by using a scalar test equation similar to the usual test equation ofA-stability. EveryP-stable method isA-stable, but anA-stable method is not necessarilyP-stable. We considerP-stability of Runge-Kutta (RK) methods and its variation which was originally introduced for multistep methods by Bickart, and derive a sufficient condition for an RK method to have the stability properties on the basis of an algebraic characterization ofA-stable RK methods recently obtained by Schere and Müller. By making use of the condition we clarify stability properties of some SIRK and SDIRK methods, which are easier to implement than fully implicit methods, applied to delay differential equations.     

A class of symplectic partitioned Runge–Kutta methods

This paper deals with some relevant properties of Runge–Kutta (RK) methods and symplectic partitioned Runge–Kutta (PRK) methods. First, it is shown that the arithmetic mean of a RK method and its adjoint counterpart is symmetric. Second, the symplectic adjoint method is introduced and a simple way to construct symplectic PRK methods via the symplectic adjoint method is provided. Some relevant properties of the adjoint method and the symplectic adjoint method are discussed. Third, a class of symplectic PRK methods are proposed based on Radau IA, Radau IIA and their adjoint methods. The structure of the PRK methods is similar to that of Lobatto IIIA–IIIB pairs and is of block forms. Finally, some examples of symplectic partitioned Runge–Kutta methods are presented.     

A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.

     

On the derivation of explicit two-step peer methods

The so-called two-step peer methods for the numerical solution of Initial Value Problems (IVP) in differential systems were introduced by R. Weiner, B.A. Schmitt and coworkers as a tool to solve different types of IVPs either in sequential or parallel computers. These methods combine the advantages of Runge-Kutta (RK) and multistep methods to obtain high stage order and therefore provide in a natural way a dense output. In particular, several explicit peer methods have been proved to be competitive with standard RK methods in a wide selection of non-stiff test problems.The aim of this paper is to propose an alternative procedure to construct families of explicit two step peer methods in which the available parameters appear in a transparent way. This allows us to obtain families of fixed stepsize s stage methods with stage order 2s−1, which provide dense output without extra cost, depending on some free parameters that can be selected taking into account the stability properties and leading error terms. A study of the extension of these methods to variable stepsize is also carried out. Optimal s stage methods with s=2,3 are derived.     

Conservation of invariants by symmetric multistep cosine methods for second-order partial differential equations

In a previous paper, some multistep cosine methods which integrate exactly the linear and stiff part of a second-order differential equation have been introduced and its convergence has been analysed under assumptions of regularity. In this paper, we characterize when this type of methods are symmetric and give a detailed analysis which allows to prove that these symmetric methods behave very advantageously with respect to the conservation of invariants when a Hamiltonian wave equation subject to periodic boundary conditions is integrated. In this way we prove that these methods are really competitive since they are explicit, stable and qualitatively correct for this type of equations.     

On the stability of functionally fitted Runge–Kutta methods

Classical collocation RK methods are polynomially fitted in the sense that they integrate an ODE problem exactly if its solution is an algebraic polynomial up to some degree. Functionally fitted RK (FRK) methods are collocation techniques that generalize this principle to solve an ODE problem exactly if its solution is a linear combination of a chosen set of arbitrary basis functions. Given for example a periodic or oscillatory ODE problem with a known frequency, it might be advantageous to tune a trigonometric FRK method targeted at such a problem. However, FRK methods lead to variable coefficients that depend on the parameters of the problem, the time, the stepsize, and the basis functions in a non-trivial manner that inhibits any in-depth analysis of the behavior of the methods in general. We present the class of so-called separable basis functions and show how to characterize the stability function of the methods in this particular class. We illustrate this explicitly with an example and we provide further insight for separable methods with symmetric collocation points. AMS subject classification (2000) 65L05, 65L06, 65L20, 65L60     

Error growth in the numerical integration of periodic orbits by multistep methods, with application to reversible systems

We study the growth with time of (the coefficients of the asymptoticexpansion of) the error in the numerical integration with linearmultistep methods of periodic solutions of systems of ordinarydifferential equations. Particular attention is devoted to reversiblesystems. It turns out that symmetric linear multistep methodscannot be recommended in spite of the fact that they mimic thereversibility of the true flow. For reversible second-ordersystems, linear multistep methods without parasitic double rootsare useful.     

Stability in linear multistep methods for pure delay equations

The stability regions of linear multistep methods for pure delay equations are compared with the stability region of the delay equation itself. A criterion is derived stating when the numerical stability region contains the analytical stability region. This criterion yields an upper bound for the integration step (conditional Q-stability). These bounds are computed for the Adams-Bashforth, Adams-Moulton and backward differentiation methods of orders ?8. Furthermore, symmetric Adams methods are considered which are shown to be unconditionally Q-stable. Finally, the extended backward differentiation methods of Cash are analysed.     

Symmetric multistep methods for constrained Hamiltonian systems

A method of choice for the long-time integration of constrained Hamiltonian systems is the Rattle algorithm. It is symmetric, symplectic, and nearly preserves the Hamiltonian, but it is only of order two and thus not efficient for high accuracy requirements. In this article we prove that certain symmetric linear multistep methods have the same qualitative behavior and can achieve an arbitrarily high order with a computational cost comparable to that of the Rattle algorithm.     

Analysis of variable-stepsize linear multistep methods with special emphasis on symmetric ones

In this paper we deal with several issues concerning variable-stepsize linear multistep methods. First, we prove their stability when their fixed-stepsize counterparts are stable and under mild conditions on the stepsizes and the variable coefficients. Then we prove asymptotic expansions on the considered tolerance for the global error committed. Using them, we study the growth of error with time when integrating periodic orbits. We consider strongly and weakly stable linear multistep methods for the integration of first-order differential systems as well as those designed to integrate special second-order ones. We place special emphasis on the latter which are also symmetric because of their suitability when integrating moderately eccentric orbits of reversible systems. For these types of methods, we give a characterization for symmetry of the coefficients, which allows their construction, and provide some numerical results for them.

     

Characterization and Construction of Linear Symplectic RK-Methods

A characterization of linear symplectic Runge-Kutta methods, which is based on the W-transformation of Hairer and Wanner, is presented. Using this charac-terization three classes of high order linear symplectic Runge-Kutta methods are constructed. They include and extend known classes of high order linear symplectic Runge-Kutta methods.     

Stability of Runge-Kutta methods for the generalized pantograph equation

Summary. This paper deals with stability properties of Runge-Kutta (RK) methods applied to a non-autonomous delay differential equation (DDE) with a constant delay which is obtained from the so-called generalized pantograph equation, an autonomous DDE with a variable delay by a change of the independent variable. It is shown that in the case where the RK matrix is regular stability properties of the RK method for the DDE are derived from those for a difference equation, which are examined by similar techniques to those in the case of autonomous DDEs with a constant delay. As a result, it is shown that some RK methods based on classical quadrature have a superior stability property with respect to the generalized pantograph equation. Stability of algebraically stable natural RK methods is also considered. Received May 5, 1998 / Revised version received November 17, 1998 / Published online September 24, 1999     

Conserved quantities of some Hamiltonian wave equations after full discretization

Hamiltonian PDEs have some invariant quantities, which would be good to conserve with the numerical integration. In this paper, we concentrate on the nonlinear wave and Schrödinger equations. Under hypotheses of regularity and periodicity, we study how a symmetric space discretization makes that the space discretized system also has some invariants or `nearly' invariants which well approximate the continuous ones. We conjecture some facts which would explain the good numerical approximation of them after time integration when using symplectic Runge-Kutta methods or symmetric linear multistep methods for second-order systems.     

Delay-dependent stability analysis of symmetric boundary value methods for linear delay integro-differential equations

The paper is concerned with the numerical stability of linear delay integro-differential equations (DIDEs) with real coefficients. Four families of symmetric boundary value method (BVM) schemes, namely the Extended Trapezoidal Rules of first kind (ETRs) and second kind (ETR $_2$ s), the Top Order Methods (TOMs) and the B-spline linear multistep methods (BS methods) are considered in this paper. We analyze the delay-dependent stability region of symmetric BVMs by using the boundary locus technique. Furthermore, we prove that under suitable conditions the symmetric schemes preserve the delay-dependent stability of the test equation. Numerical experiments are given to confirm the theoretical results.     

Symmetric multistep Obrechkoff methods with zero phase-lag for periodic initial value problems of second order differential equations

In this paper, symmetric multistep Obrechkoff methods of orders 8 and 12, involving a parameter p to solve a special class of second order initial value problems in which the first order derivative does not appear explicitly, are discussed. It is shown that the methods have zero phase-lag when p is chosen as 2π times the frequency of the given initial value problem.     

Convergence of a class of runge-kutta methods for differential-algebraic systems of index 2

This paper deals with convergence results for a special class of Runge-Kutta (RK) methods as applied to differential-algebraic equations (DAE's) of index 2 in Hessenberg form. The considered methods are stiffly accurate, with a singular RK matrix whose first row vanishes, but which possesses a nonsingular submatrix. Under certain hypotheses, global superconvergence for the differential components is shown, so that a conjecture related to the Lobatto IIIA schemes is proved. Extensions of the presented results to projected RK methods are discussed. Some numerical examples in line with the theoretical results are included.     

Runge–Kutta methods adapted to the numerical integration of oscillatory problems

New Runge–Kutta methods specially adapted to the numerical integration of IVPs with oscillatory solutions are obtained. The coefficients of these methods are frequency-dependent such that certain particular oscillatory solutions are computed exactly (without truncation errors). Based on the B-series theory and on the rooted trees we derive the necessary and sufficient order conditions for this class of RK methods. With the help of these order conditions we construct explicit methods (up to order 4) as well as pairs of embedded RK methods of orders 4 and 3. Some numerical examples show the excellent behaviour when they compete with classical RK methods.     

Runge-Kutta方法关于无穷延迟系统的稳定性分析

主要针对无穷延迟Pantograph方程构造了Runge-Kutta数值方法,并讨论了此方法在一定的条件下是p-稳定的和弱p-稳定的.     

特殊二阶微分方程的线性自治系统的辛多步法

１．引言１９世纪Ｈａｍｉｌｔｏｎ提出经典力学的一种基本的方程形式．记Ｐ＝Ｍｑ表示动量,ｑ表示位移,于是动能Ｔ＝１／２（ｐ,Ｍ－１　ｐ）,并将总能量Ｈ＝Ｔ＋Ｖ位能）表示为ｐ,ｑ的函数：于是经典力学的标准形式－Ｎｅｗｔｏｎ形式称为Ｈａｍｉｌｔｏｎ正则方程．（１．１）是ＺＩ维相空间或称辛空间中的相变量（ＰＩ,...,Ｐ。,ｑｌ;...,ｑｎ）'的一阶微分方程组．其中ｑ-（ｑｌ,...;ｑｒｔ）'是位置向量,ｄｑ,、Ｉ。。。。。ｑ＝ｉ＝（ｑｌ,...,ｑｈ）'是速度向量,ｄｔ'"""。'。'。。。ｌ、。。ｄ"ｑ,...．、,-,-…