The cubic spline interpolation method, the Runge–Kutta method, and the Newton–Raphson method are extended to dual versions (developed in the context of dual numbers). This extension allows the calculation of the derivatives of complicated compositions of functions which are not necessarily defined by a closed form expression. The code for the algorithms has been written in Fortran and some exam...

In the present paper an attempt is made for the solution of SDE (Stochastic differential equation ) using different numerical simulation . Here the four different technique has been adopt for the two test problem for the verification process . Main emphasis is given on the RKM (Runge kutta Method) in which the solution has minimum number of absolute error .i.e more accurate then other. some of ...

Introduction PACT Abstract A parallel implementation for multi-implicit Runge-Kutta methods with real eigen-values is described. The parallel method is analysed and the algorithm is devised. For the problem with d domains, the amount within the s-stage Runge-Kutta method, associated with the solution of system, is proportional to (sd) 3. The proposed parallelisation transforms the above system ...

Exponential Runge–Kutta methods constitute efficient integrators for semilinear stiff problems. So far, however, explicit exponential Runge–Kutta methods are available in the literature up to order 4 only. The aim of this paper is to construct a fifth-order method. For this purpose, we make use of a novel approach to derive the stiff order conditions for high-order exponential methods. This all...

We describe a new method for numerical integration, dubbed bandlimited collocation implicit Runge–Kutta (BLC-IRK), and compare its efficiency in propagating orbits to existing techniques commonly used in Astrodynamics. The BLC-IRK scheme uses generalized Gaussian quadratures for bandlimited functions. This new method allows us to use significantly fewer force function evaluations than explicit ...

This paper deals with the stability of Runge–Kutta methods for a class of stiff systems of nonlinear Volterra delay-integro-differential equations. Two classes of methods are considered: Runge–Kutta methods extended with a compound quadrature rule, and Runge– Kutta methods extended with a Pouzet type quadrature technique. Global and asymptotic stability criteria for both types of methods are de...

A Runge–Kutta method takes small time steps, to approximate the solution to an initial value problem. How accurate is this approximation? If the error is asymptotically proportional to hp, where h is the stepsize, the Runge–Kutta method is said to have “order” p. To find p, write the exact solution, after a single time-step, as a Taylor series, and compare with the Taylor series for the approxi...

The RK1GL2X3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on the RK1GL2 method which, in turn, is a particular case of the general RKrGLm method. The RK1GL2X3 method is a fourth-order method, even though its underlying Runge-Kutta method RK1 is the first-order Euler method, and hence, RK1GL2X3 is considerably more efficient tha...

Separable Hamiltonian systems of differential equations have the form dp/dt = -dH/dq, dq/dt = dH/dp, with a Hamiltonian function H that satisfies H = T(p) + K(q) (T and V are respectively the kinetic and potential energies). We study the integration of these systems by means of partitioned Runge-Kutta methods, i.e., by means of methods where different Runge-Kutta tableaux are used for the p and...

New Runge–Kutta methods for method of lines solution of systems of ordinary differential equations arising from discretizations of spatial derivatives in hyperbolic equations, by Chebyshev or modified Chebyshev methods, are introduced. These Runge–Kutta methods optimize the time step necessary for stable solutions, while holding dispersion and dissipation fixed. It is found that maximizing disp...