New embedded explicit pairs of exponentially fitted Runge-Kutta methods

Two new embedded pairs of exponentially fitted explicit Runge-Kutta methods with four and five stages for the numerical integration of initial value problems with oscillatory or periodic solutions are developed. In these methods, for a given fixed ω the coefficients of the formulae of the pair are selected so that they integrate exactly systems with solutions in the linear space generated by {sinh(ωt),cosh(ωt)}, the estimate of the local error behaves as O(h⁴) and the high-order formula has fourth-order accuracy when the stepsize h→0. These new pairs are compared with another one proposed by Franco [J.M. Franco, An embedded pair of exponentially fitted explicit Runge-Kutta methods, J. Comput. Appl. Math. 149 (2002) 407-414] on several problems to test the efficiency of the new methods.     

A variable step implicit block multistep method for solving first-order ODEs

A new four-point implicit block multistep method is developed for solving systems of first-order ordinary differential equations with variable step size. The method computes the numerical solution at four equally spaced points simultaneously. The stability of the proposed method is investigated. The Gauss-Seidel approach is used for the implementation of the proposed method in the PE(CE)^m mode. The method is presented in a simple form of Adams type and all coefficients are stored in the code in order to avoid the calculation of divided difference and integration coefficients. Numerical examples are given to illustrate the efficiency of the proposed method.     

A parametric symmetric linear four-step method for the efficient integration of the Schrödinger equation and related oscillatory problems

In this article, we develop an explicit symmetric linear phase-fitted four-step method with a free coefficient as parameter. The parameter is used for the optimization of the method in order to solve efficiently the Schrödinger equation and related oscillatory problems. We evaluate the local truncation error and the interval of periodicity as functions of the parameter. We reveal a direct relationship between the periodicity interval and the local truncation error. We also measure the efficiency of the new method for a wide range of possible values of the parameter and compare it to other well known methods from the literature. The analysis and the numerical results help us to determine the optimal values of the parameter, which render the new method highly efficient.     

Structure preservation of exponentially fitted Runge–Kutta methods

The preservation of some structure properties of the flow of differential systems by numerical exponentially fitted Runge–Kutta (EFRK) methods is considered. A complete characterisation of EFRK methods that preserve linear or quadratic invariants is given and, following the approach of Bochev and Scovel [On quadratic invariants and symplectic structure, BIT 34 (1994) 337–345], the sufficient conditions on symplecticity of EFRK methods derived by Van de Vyver [A fourth-order symplectic exponentially fitted integrator, Comput. Phys. Comm. 174 (2006) 255–262] are obtained. Further, a family of symplectic EFRK two-stage methods with order four has been derived. It includes the symplectic EFRK method proposed by Van de Vyver as well as a collocation method at variable nodes that can be considered as the natural collocation extension of the classical RK Gauss method. Finally, the results of some numerical experiments are presented to compare the relative merits of several fitted and nonfitted fourth-order methods in the integration of oscillatory systems.     

A note on pseudo-symplectic Runge-Kutta methods

Aubry and Chartier introduced (1998) the concept of pseudo-symplecticness in order to construct explicit Runge-Kutta methods, which mimic symplectic ones. Of particular interest are methods of order (p, 2p), i.e., of orderp and pseudo-symplecticness order 2p, for which the growth of the global error remains linear. The aim of this note is to show that the lower bound for the minimal number of stages can be achieved forp=4 andp=5.     

Higher order symplectic RK and RKN methods using perturbed collocation

In this paper, we derive a one-parameter family of symplectic Runge-Kutta-Nyström methods of order 2s-1 and a two-parameter family of symplectic Runge-Kutta methods of order 2s-2.     

A numerical ODE solver that preserves the fixed points and their stability

In this paper, we provide a one-step predictor-corrector method for numerically solving first-order differential initial-value problems with two fixed points. The method preserves the stability behaviour of the fixed points, which results in an efficient integrator for this kind of problem. Some numerical examples are provided to show the good performance of the method.     

On the Convergence of LMF-type Methods for SODEs

In a previous paper [3], some numerical methods for stochastic ordinary differential equations (SODEs), based on Linear Multistep Formulae (LMF), were proposed. Nevertheless, a formal proof for the convergence of such methods is still lacking. We here provide such a proof, based on a matrix formulation of the discrete problem, which allows some more insight in the structure of LMF-type methods for SODEs.     

A modification of the stiefel-bettis method for nonlinearly damped oscillators

We report a modification of the Stiefel-Bettis method which is of trigonometric order one and of polynomial order two for the general second order initial value problems. We also discuss the modified Stiefel-Bettis method made explicit for the undamped nonlinear oscillators. Numerical solution of problems are given to illustrate the methods.     

The RKGL method for the numerical solution of initial-value problems

We introduce the RKGL method for the numerical solution of initial-value problems of the form y^′=f(x,y)$y^{\prime }=f(x,y)$, y(a)=α$y(a)=\alpha$. The method is a straightforward modification of a classical explicit Runge–Kutta (RK) method, into which Gauss–Legendre (GL) quadrature has been incorporated. The idea is to enhance the efficiency of the method by reducing the number of times the derivative f(x,y)$f(x,y)$ needs to be computed. The incorporation of GL quadrature serves to enhance the global order of the method by, relative to the underlying RK method. Indeed, the RKGL method has a global error of the form Ah^r+1+Bh^2m${\mathit{Ah}}^{r+1}+{\mathit{Bh}}^{2m}$, where r is the order of the RK method and m is the number of nodes used in the GL component. In this paper we derive this error expression and show that RKGL is consistent, convergent and strongly stable.     

Derivation of continuous explicit two-step Runge–Kutta methods of order three

We describe a construction of continuous extensions to a new representation of two-step Runge–Kutta methods for ordinary differential equations. This representation makes possible the accurate and reliable estimation of local discretization error, facilitates the efficient implementation of these methods in variable stepsize environment, and adapts readily to the numerical solution of a class of delay differential equations. A number of numerical tests carried out on the obtained methods of order 3 with quadratic interpolants show their efficiency and robust performance which allow them to compete with the state-of-the-art dde23 code from Matlab.     

Superconvergent explicit two-step peer methods

We consider explicit two-step peer methods for the solution of nonstiff differential systems. By an additional condition a subclass of optimally zero-stable methods is identified that is superconvergent of order p=s+1$p=s+1$, where s$s$ is the number of stages. The new condition allows us to reduce the number of coefficients in a numerical search for good methods. We present methods with 4–7 stages which are tested in FORTRAN90 and compared with DOPRI5 and DOP853. The results confirm the high potential of the new class of methods.     

Runge–Kutta methods and Banach algebras

The equations defining both the exact and the computed solution to an initial value problem are related to a single functional equation, which can be regarded as prototypical. The functional equation can be solved in terms of a formal Taylor series, which can also be generated using an iteration process. This leads to the formal Taylor expansions of the solution and approximate solutions to initial value problems. The usual formulation, using rooted trees, can be modified to allow for linear combinations of trees, and this gives an insight into the nature of order conditions for explicit Runge–Kutta methods. A short derivation of the family of fourth order methods with four stages is given.     

Methods for parallel integration of stiff systems of odes

This paper presents a class of parallel numerical integration methods for stiff systems of ordinary differential equations which can be partitioned into loosely coupled sub-systems. The formulas are called decoupled backward differentiation formulas, and they are derived from the classical formulas by restricting the implicit part to the diagnonal sub-system. With one or several sub-systems allocated to each processor, information only has to be exchanged after completion of a step but not during the solution of the nonlinear algebraic equations.The main emphasis is on the formula of order 1, the decoupled implicit Euler formula. It is proved that this formula even for a wide range of multirate formulations has an asymptotic global error expansion permitting extrapolation. Besides, sufficient conditions for absolute stability are presented.     

Symmetric Boundary Value Methods for Second Order Initial and Boundary Value Problems

We introduce symmetric Boundary Value Methods for the solution of second order initial and boundary value problems (in particular Hamiltonian problems). We study the conditioning of the methods and link it to the boundary loci of the roots of the associated characteristic polynomial. Some numerical tests are provided to assess their reliability. Dedicated to the memory of Professor Aldo Cossu     

Rooted tree analysis of the order conditions of row-type scheme for stochastic differential equations

Numerical schemes for initial value problems of stochastic differential equations (SDEs) are considered so as to derive the order conditions of ROW-type schemes in the weak sense. Rooted tree analysis, the well-known useful technique for the counterpart of the ordinary differential equation case, is extended to be applicable to the SDE case. In our analysis, the roots are bi-colored corresponding to the ordinary and stochastic differential terms, whereas the vertices have four kinds of label corresponding to the terms derived from the ROW-schemes. The analysis brings a transparent way for the weak order conditions of the scheme. An example is given for illustration.     

Enumeration results for Runge–Kutta methods for index 2 DAEs

Recursive formulas are presented that give the number of order conditions for single-step Runge–Kutta methods for index 2 DAEs.     

Blended implicit methods for solving ODE and DAE problems,and their extension for second-order problems

The use of implicit numerical methods is mandatory when solving general stiff ODE/DAE problems. Their use, in turn, requires the solution of a corresponding discrete problem, which is one of the main concerns in the actual implementation of the methods. In this respect, blended implicit methods provide a general framework for the efficient solution of the discrete problems generated by block implicit methods. In this paper, we review the main facts concerning blended implicit methods for the numerical solution of ODE and DAE problems.     

A new high accuracy locally one-dimensional scheme for the wave equation

In this paper, a new locally one-dimensional (LOD) scheme with error of O(Δt⁴+h⁴) for the two-dimensional wave equation is presented. The new scheme is four layer in time and three layer in space. One main advantage of the new method is that only tridiagonal systems of linear algebraic equations have to be solved at each time step. The stability and dispersion analysis of the new scheme are given. The computations of the initial and boundary conditions for the two intermediate time layers are explicitly constructed, which makes the scheme suitable for performing practical simulation in wave propagation modeling. Furthermore, a comparison of our new scheme and the traditional finite difference scheme is given, which shows the superiority of our new method.