Next Article in Journal
Multiple Benefit Thresholds Problem in Online Social Networks: An Algorithmic Approach
Next Article in Special Issue
A Tensor Splitting AOR Iterative Method for Solving a Tensor Absolute Value Equation
Previous Article in Journal
An Inertial Extragradient Direction Method with Self-Adaptive Step Size for Solving Split Minimization Problems and Its Applications to Compressed Sensing
Previous Article in Special Issue
A Simple Affine-Invariant Spline Interpolation over Triangular Meshes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a New Family of Runge–Kutta–Nyström Pairs of Orders 6(4)

by
Vladislav N. Kovalnogov
1,
Ruslan V. Fedorov
1,
Dmitry A. Generalov
1,
Ekaterina V. Tsvetova
1,
Theodore E. Simos
1,2,3,4,5,* and
Charalampos Tsitouras
6
1
Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, 432027 Ulyanovsk, Russia
2
Department of Mathematics, University of Western Macedonia, GR-52100 Kastoria, Greece
3
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung City 40402, Taiwan
4
Data Recovery Key Laboratory of Sichuan Province, Neijiang Normal University, Neijiang 641100, China
5
Deptartment of Civil Engineering, Section of Mathematics, Democritus University of Thrace, GR-67100 Xanthi, Greece
6
General Deptartment, Euripus Campus, National & Kapodistrian University of Athens, GR-34400 Psachna, Greece
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 875; https://doi.org/10.3390/math10060875
Submission received: 25 January 2022 / Revised: 2 March 2022 / Accepted: 7 March 2022 / Published: 9 March 2022
(This article belongs to the Special Issue Numerical Analysis and Scientific Computing II)

Abstract

:
In this study, Runge–Kutta–Nyström pairs of orders 6(4) using six stages per step are considered. The main contribution of the present work is that we introduce a new family of pairs (i.e., new methodology of solution for order conditions) that possesses seven free parameters instead of four, as used by similar pairs until now. Using these extra coefficients efficiently we may construct methods with better properties. Here, we exploit the free parameters in order to derive a pair with extended imaginary stability interval. This type of method may furnish better results on problems with periodic solutions. Extended numerical tests justify our effort.

1. Introduction

The second order initial value problem with the special form
y = f ( x , y ) , y ( x 0 ) = y 0 , y ( x 0 ) = y 0
where f : × m m , and ( y 0 , y 0 ) 2 m , is under consideration here.
We make an approximation to the solution of problem (1) at a collection of separate points x n , y n , y n using an explicit Runge–Kutta–Nyström (RKN) pair sharing algebraic orders p ( q ) , p > q . The format of this method is as follows [1]
f i = f ( x n + c i h n , y n + c i h n y n + h n 2 j = 1 s α ˜ i j f j ) , i = 1 , 2 , , s
y n + 1 = y n + h n y n + h n 2 i = 1 s w i f i , y ^ n + 1 = y n + h n y n + h n 2 i = 1 s w ^ i f i , y n + 1 = y n + h n i = 1 s w i f i , y ^ n + 1 = y n + h n i = 1 s w ^ i f i ,
where h n = x n + 1 x n , is the stepsize. The higher order approximations y n , y n are used to propagate the solutions. The weights w ^ and w ^ furnish the lower accuracy approximations used for error estimation.
The latter can be computed by the expression
ϵ n = h n p q + 1 · max ( h n 2 i = 1 s ( w i w ^ i ) f i , h n i = 1 s ( w i w ^ i ) f i ) ,
and the compared can be a very small positive number T O L set by the user of the pair. Then, using this small number, called tolerance, we may guess the length of the next step length
h n + 1 = 0.9 · h n · T O L ϵ n 1 / p .
In the exceptional case when T O L < ϵ n , we do not allow the solution to propagate. We actually repeat the current step and use h n + 1 instead of h n as its new and shorter version.
All the coefficients can be formulated using the Butcher tableau [2,3]. So, the method takes the form
Mathematics 10 00875 i001
with A ˜ s × s , w T ,   w ^ T ,   w T ,   w ^ T ,   c s .
Pairs of orders six and four (i.e., p = 6 and q = 4 ) were studied in [1,4]. There, pairs DEP6(4) and PT6(4) were respectively presented. The following Butcher tableau characterizes these pairs.
Mathematics 10 00875 i002
From the tableau above it can be seen that the last stage (i.e., the sixth) shares as coefficients the vector w. These are actually six stages pairs (i.e., s = 6 ) using the FSAL (First Stage As Last) device. Thus, only five stages are wasted every step. The PT6(4) pair was specially designed to address periodic problems since it shares higher phase-lag order. Reducing the phase lag we try to keep the difference in angles between the theoretical and numerical solution small when integrating harmonic oscillator.
In the following we are interested to study a six stages (i.e., s = 6 ) pair of orders six and four (i.e., p = 6 and q = 4 ). These pairs are shown in the following Butcher tableaus
Mathematics 10 00875 i003
Such pairs were firstly studied in [5]. No FSAL device is used on these pairs. In [5] all the coefficients are expressed with respect to four free parameters that can be chosen arbitrarily. Namely c 3 , c 4 , c 5 and w 6 . The pair ER6(4) was presented there, achieving small local truncation errors. However, it seems that we may use seven free parameters for constructing pairs of this form, as will be seen below. We aim to exploit these extra parameters for achieving long imaginary stability intervals.

2. The New Family of Runge–Kutta–Nyström Pairs Sharing Orders 6(4)

According to the relevant theory, there are 47 equations of condition for achieving a pair of orders six and four [5,6]. We may consider the simplifying assumption
A ˜ · e = 1 2 c 2 ,
with e = [ 1 , 1 , , 1 ] T s and c 2 = c c the component wise multiplication between the elements of vector c. Then the number of order conditions reduces to just 29. Another common assumption is
w = w · ( I s diag ( c ) ) , w ^ = w ^ · ( I s diag ( c ) ) ,
with I s s × s the identity matrix. After (3) holds, only 18 equations remain to be solved. Namely, 13 of them correspond to the higher order formula:
The 1st, 2nd, and 3rd order conditions, respectively.
w · e = 1 , w · c = 1 2 , w · c 2 = 1 3 .
The 4th order conditions.
w · c 3 = 1 4 , w · A ˜ · c = 1 24 .
The 5th order conditions.
w · c 4 = 1 5 , w · ( c A ˜ · c ) = 1 30 , w · A ˜ · c 2 = 1 60 .
The 6th order conditions.
w · c 5 = 1 6 , w · c 2 A ˜ · c = 1 36 , w · c A ˜ · c 2 = 1 72 ,
w · A ˜ · c 3 = 1 120 , w · A ˜ 2 · c = 1 720 .
Whereas for the lower order formula, the following five equations must be satisfied,
w ^ · e = 1 , w ^ · c = 1 2 , w ^ · c 2 = 1 3 , w ^ · c 3 = 1 4 , w ^ · A ˜ · c = 1 24 .
In these equations, “∗” is to be understood as a component-wise multiplication among vectors and has the lowest priority after all other operations. Also, c 2 = c c , c 3 = c 2 c , etc. This latter operation (“raising” a vector to a power) has the highest priority and is evaluated before dot products and “∗”.
The parameters available are 25. Specifically
c 2 , c 3 , c 4 , c 5 , α ˜ 32 , α ˜ 42 , α ˜ 43 , α ˜ 52 , α ˜ 53 , α ˜ 54 , α ˜ 62 , α ˜ 63 , α ˜ 64 , α ˜ 65 , w 1 , w 2 , w 3 , w 4 , w 5 , w 6 , w ^ 1 , w ^ 2 , w ^ 3 , w ^ 4 , w ^ 6 .
Thus, we may choose 7 of them arbitrarily. We select c 2 , c 3 , c 4 , c 5 , α ˜ 62 , α ˜ 63 and α ˜ 64 as free parameters. Then we may explicitly evaluate all the remaining coefficients. The algorithm for this is as follows.
Firstly, set
α ˜ 65 = ( c 2 1 ) ( c 3 1 ) ( c 4 1 ) ( c 5 1 ) 2 ( c 2 ( 5 c 3 ( 2 c 4 1 ) 5 c 4 + 3 ) + c 3 ( 3 5 c 4 ) + 3 c 4 2 ) 2 c 5 ( c 5 c 2 ) ( c 3 c 5 ) ( c 5 c 4 ) ( c 2 ( 5 c 3 ( 6 c 4 c 5 4 c 4 4 c 5 + 3 ) 20 c 4 c 5 + 15 c 4 + 15 c 5 12 ) + c 3 ( 20 c 4 c 5 + 15 c 4 + 15 c 5 12 ) + 15 c 4 c 5 12 c 4 12 c 5 + 10 ) .
Continue evaluating w 1 , w 2 , w 3 , w 4 , w 5 , and w 6 after solving the linear system
w · e = 1 , w · c = 1 2 , w · c 2 = 1 3 , w · c 3 = 1 4 , w · c 4 = 1 5 , w · c 5 = 1 6 .
The remaining six equations (except w · A ˜ 2 · c = 1 720 ) for the higher order formula can also be solved explicitly, since they are linear in a ˜ 32 , a ˜ 42 , a ˜ 43 , a ˜ 52 , a ˜ 53 , a ˜ 54 . The 13th equation was already satisfied by a ˜ 65 . The remaining coefficients of the first column of A ˜ (i.e., a ˜ 21 , a ˜ 31 , a ˜ 41 , a ˜ 51 and a ˜ 61 ) are found by expression (2).
We proceed by evaluating the weights of the lower order formula. Thus, we set
w ^ 5 = c 4 ( c 2 c 4 ) ( 2 a ˜ 32 c 2 ( 6 c 2 c 4 4 c 2 4 c 4 + 3 ) + c 3 ( c 2 c 3 ) ( c 3 c 4 ) ) 2 a ˜ 42 c 2 c 3 c 2 2 ( 6 c 3 4 ) + c 2 3 6 c 3 2 + c 3 ( 4 c 3 3 ) + 2 a ˜ 43 c 3 2 c 2 2 ( 4 6 c 3 ) + c 2 6 c 3 2 3 + ( 3 4 c 3 ) c 3 24 a ˜ 32 c 2 3 c 4 2 c 5 a ˜ 32 c 2 3 c 4 c 5 2 a ˜ 32 c 2 2 c 4 3 c 5 + a ˜ 32 c 2 2 c 4 c 5 3 + a ˜ 32 c 2 c 4 3 c 5 2 a ˜ 32 c 2 c 4 2 c 5 3 a ˜ 42 c 2 3 c 3 2 c 5 + a ˜ 42 c 2 3 c 3 c 5 2 + a ˜ 42 c 2 2 c 3 3 c 5 a ˜ 42 c 2 2 c 3 c 5 3 a ˜ 42 c 2 c 3 3 c 5 2 + a ˜ 42 c 2 c 3 2 c 5 3 a ˜ 43 c 2 2 c 3 3 c 5 + a ˜ 43 c 2 2 c 3 2 c 5 2 + a ˜ 43 c 2 c 3 4 c 5 a ˜ 43 c 2 c 3 2 c 5 3 a ˜ 43 c 3 4 c 5 2 + a ˜ 43 c 3 3 c 5 3 + a ˜ 52 c 2 c 3 c 4 ( c 2 c 3 ) ( c 2 c 4 ) ( c 3 c 4 ) + a ˜ 53 c 3 2 c 4 ( c 2 c 3 ) ( c 2 c 4 ) ( c 3 c 4 ) + a ˜ 54 c 2 2 c 3 2 c 4 2 a ˜ 54 c 2 2 c 3 c 4 3 a ˜ 54 c 2 c 3 3 c 4 2 + a ˜ 54 c 2 c 3 c 4 4 + a ˜ 54 c 3 3 c 4 3 a ˜ 54 c 3 2 c 4 4
and conclude by finding w ^ 1 , w ^ 2 , w ^ 3 , w ^ 4 , after solving the linear system
w ^ · e = 1 , w ^ · c = 1 2 , w ^ · c 2 = 1 3 , w ^ · c 3 = 1 4 ,
with respect to these parameters.
Finally, the coefficients in vectors w and w ^ can be found explicitly by expressions (3).

3. Stability Intervals

Having at hand seven free coefficients instead of four we may exploit them in various directions. Here, we will try to derive a pair that performs best on periodic problems.
Following Horn [7] or Dormand et al. [1], we consider the test problem y = μ 2 y (with μ complex). Since y = μ y , we conclude to the following recursions for y and y ,
y n + 1 = 1 + v 2 w I v 2 A ˜ 1 e + v 1 + v 2 w I v 2 A ˜ 1 c   ·   y n = R v   ·   y n , y n + 1 = v w I v 2 A ˜ 1 e + 1 + v 2 w I v 2 A ˜ 1 c   ·   y n = R v   ·   y n ,
with v = μ h . Thus, the RKN methods posses a couple of stability regions associated with their higher orders formulas. Namely, for y and y . We may produce them requiring | R ( v ) | < 1 and | R ( v ) | < 1 . This type of stability analysis is associated to the corresponding A-stability of Runge–Kutta methods.
Let, for i 1 ,
δ 2 i 1 = w A ˜ i 1 e , δ 2 i = w A ˜ i 1 c , δ 2 i 1 = w A ˜ i 1 e , δ 2 i = w A ˜ i 1 c ,
with δ 1 = 0 , δ 0 = δ 1 = δ 0 = 1 . Applying the formal Neumann expansion of I z A 1 and since A ˜ is strictly lower triangular, we may write
R ( v ) = 1 + v + 1 2 v 2 + 1 6 v 3 + 1 24 v 4 + 1 120 v 5 + 1 720 v 6 + δ 6 v 7 + δ 7 v 8 + δ 8 v 9 + δ 9 v 10 ,
R ( v ) = 1 + v + 1 2 v 2 + 1 6 v 3 + 1 24 v 4 + 1 120 v 5 + 1 720 v 6 + δ 7 v 7 + δ 8 v 8 + δ 9 v 9 + δ 10 v 10 + δ 11 v 11 .
The stability region defined by R ( v ) is characterized by its first cuts (i.e., those closest to origin) with the two axes, i.e., the real and imaginary axes. Thus, we define the corresponding intervals. Namely (i) the real stability interval ( v ˜ , 0 ) (ii) the imaginary stability interval ( 0 , v ^ ) with both v ˜ and v ^ being real numbers. Analogously we define the corresponding intervals ( v ˜ , 0 ) and ( 0 , v ^ ) associated with R ( v ) .
We focus on pairs with long imaginary stability intervals since such pairs are expected to perform better on periodic problems. For deriving such a method we expressed R ( v ) and R ( v ) with respect to the free parameters and v. Let us assume v = v 1 , v , i.e., concentrate on the imaginary axis. Then, for a sixth order method, we conclude to
| R ( v ) | 2 = ( 1 v 2 2 + v 4 24 v 6 720 + δ 7 v 8 δ 9 v 10 ) 2 + ( v v 3 6 + v 5 120 δ 6 v 7 + δ 8 v 9 ) 2
and
| R ( v ) | 2 = ( 1 v 2 2 + v 4 24 v 6 720 + δ 8 v 8 δ 10 v 10 ) 2 + ( v v 3 6 + v 5 120 δ 7 v 7 + δ 9 v 9 δ 11 v 11 ) 2 .
Then, we used Differential Evolution Algorithm [8,9] for maximizing v with respect to | R ( v ) | 2 1 and | R ( v ) | 2 1 . We manage to get such a pair (named NEW6(4)) with coefficients presented in the Appendix A as part of a MATLAB [10] listing.
In fact, we compute with these coefficients
| R ( v ) | 2 1 v 2 / 2 + v 4 / 24 v 6 / 720 + 2.477993886208964524 × 10 5 v 8 2.15355114080193519 × 10 7 v 10 2 + v v 3 / 6 + v 5 / 120 + 1.984043154492196 × 10 4 v 7 2.5011619564014669781 × 10 6 v 9 2 .
Observe that | R ( v ) | 2 1 for v [ 0 , 5.39 ] and thus we get an imaginary stability interval for y. Analogously, we may work for y .
The main characteristics of the major RKN pairs of orders 6(4) that have appeared until now in the literature are given in Table 1. As can be seen there, they do not posses an imaginary stability interval for y . In addition, the new pair has longer stability interval for y. The corresponding regions are presented in Figure 1 and Figure 2.

4. Numerical Tests

We tested the following pairs
  • The five stages (effectively) pair PT6(4) given in [4];
  • The five stages (effectively) pair DEP6(4) given in [1];
  • The six stages pair ER6(4) given in [5];
  • The six stages Runge–Kutta–Nyström pairs of orders 6(4) presented here.
The problems with periodic solutions selected for tests are the following. All these examples were tested using the listing in the Appendix A and changing only the coefficients in the preamble according to the pair under consideration.
(A)
The model problem
y = 9 y , y ( 0 ) = 1 , y ( 0 ) = 0 , x [ 0 , 10 π ] ,
with analytical solution y ( x ) = cos ( 3 x ) . We integrated the problem in the interval x 0 , 10 π for tolerances 10 5 , 10 6 , , 10 11 .
The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 3. All figures of efficiency plots are in log-log scale.
(B)
In-homogeneous problem [11]
y ( x ) = 100 y ( x ) + 99 sin ( x ) , y ( 0 ) = 1 , y ( 0 ) = 11 ,
with analytical solution
y ( x ) = cos ( 10 x ) + sin ( 10 x ) + sin ( x ) .
We integrated the problem in the interval x 0 , 10 π for tolerances 10 5 , 10 6 , , 10 11 . The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 4.
(C)
Bessel problem [12]
The well known Bessel equation
y = y ( x ) · 1 + 400 x 2 4 x 2 ,
is verified by an analytical solution of the form
y ( x ) = J 0 10 x · x ,
with J 0 being the zeroth order Bessel function of the first kind. We solved the above equation in the interval 1 , 10 π for tolerances 10 5 , 10 6 , , 10 11 . The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 5.
(D)
The Duffing equation
Next, we choose the equation [13]
y ( x ) = y ( x ) y ( x ) 3 + 1 500 · cos 1.01 x , y ( 0 ) = 0.2004267280699011 , y 0 = 0 ,
with an approximate analytical solution
y ( x ) 0.2001794775368452 cos ( 1.01 x ) + 2.469461432611 × 10 4 cos ( 3.03 x ) + 3.040149839 × 10 7 cos ( 5.05 x ) + 3.743495 × 10 10 cos ( 7.07 x ) + 4.609 × 10 13 cos ( 9.09 x ) + 6 × 10 16 cos ( 11.11 x ) .
We solved the above equation in the interval 0 , 20.5 1.01 π for tolerances 10 5 , 10 6 , , 10 11 . The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 6.
(E)
semi-Linear system
The nonlinear problem proposed by Franco and Gomez [14] follows.
y x = 199 198 99 98 · y x + y 1 + y 2 2 + sin 2 10 x 1 y 1 + 2 y 2 2 10 6 sin 2 x , x 0 , 10 π ,
with theoretical solution
y x = 2 cos 10 x 10 3 sin x cos 10 x + 10 3 sin x .
Notice that y 1 , y 2 may be understood here as components of vector y. We solved the above equation in the interval 0 , 20.5 1.01 π for tolerances 10 5 , 10 6 , , 10 10 . The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 7.
(F)
Wave equation
We finally consider the Wave equation of the form [15],
2 y t 2 = 4 2 y r 2 + sin t · cos π r 100 , 0 r 100 , t [ 0 , 10 π ] , y r t , 0 = y r t , 100 = 0 y 0 , r 0 , y t 0 , r = 100 2 4 π 2 100 2 cos π r 100 ,
with the exact solution
y t , r = 100 2 4 π 2 100 2 · sin ( t ) · cos π r 100 .
We semi-discretisize 2 y r 2 with fourth order symmetric differences at internal points and one sided differences of the same order at the boundaries and conclude to the system:
y 1 y 2 y N + 1 = 4 Δ r 2 415 72 8 3 8 9 1 8 0 257 144 10 3 7 4 2 9 1 48 0 1 12 4 3 5 2 4 3 1 12 0 0 1 12 4 3 5 2 4 3 1 12 0 1 48 2 9 7 4 10 3 257 144 0 1 8 8 9 3 8 415 72 · y 1 y 2 y N + 1 + sin t · cos 0 · Δ r r · π cos 1 · Δ r r · π cos N · Δ r r · π .
By choosing Δ r = 1 4 we arrive at a constant coefficients linear system with N = 401 . Then y 1 y ( t , 0 ) , y 2 y ( t , Δ r ) , y 3 y ( t , 2 Δ r ) , , y 401 y ( t , 400 Δ r ) . In addition, here y 1 , y 2 , may be understood as components of vector y.
We solved the above equation in the interval 0 , 10 π for tolerances 10 7.5 , 10 8 , , 10 9.5 , 10 10 . The efficiency plot recording the stages used by the four pairs versus the maximum global errors observed over the whole grid is presented in Figure 8.
The wave equation is a mildly stiff problem. This explains the peculiar performance of the pairs. The maximum accuracy is limited due to the space discretezation error there. Even so, the new pair reaches it faster. Lower order finite difference methods (e.g., Crank–Nicolson) have difficulties in attaining such high accuracies as NEW6(4).
The overall results indicate the superiority of the new pair over non stiff problems with periodic solutions.
It is standard in RKN literature to present comparisons with stages vs. error. This is independent from the hardware used and programming issues. Besides, some runs here ended after very few stages and the timing might be unreliable even using the same machine. In the following we present a couple of figures (in log-log scale) with efficiency plots including times vs. accuracies. The tests were carried on AMD Ryzen 9-3900X, 12-Core Processor at 3.79 GHz. Parallel computation of MATLAB was not applied in time or space direction of the problems.
The similarity of the above Figure 9 and Figure 10 with the corresponding Figure 5 and Figure 7, respectively, is indicative.

5. Conclusions

We considered the Runge–Kutta–Nyström pairs of orders 6(4) for addressing the special second order Initial Value Problem. We focused on problems with periodic solutions. Thus, we proposed a new family of such pairs and derived a certain representative with extended imaginary stability regions. The extensive results justified our effort.

Author Contributions

Conceptualization, V.N.K., R.V.F., D.A.G., E.V.T., T.E.S. and C.T.; Data curation, R.V.F., D.A.G., E.V.T., T.E.S. and C.T.; Formal analysis, V.N.K., R.V.F., D.A.G., E.V.T., T.E.S. and C.T.; Funding acquisition, T.E.S.; Investigation, V.N.K., D.A.G., T.E.S. and C.T.; Methodology, E.V.T., T.E.S. and C.T.; Project administration, T.E.S.; Resources, R.V.F., T.E.S. and C.T.; Software, V.N.K., Ruslan V. Fedorov, D.A.G., E.V.T., T.E.S. and C.T.; Supervision, T.E.S.; Validation, V.N.K., R.V.F., T.E.S. and C.T.; Visualization, V.N.K., R.V.F., T.E.S. and C.T.; Writing—review & editing, T.E.S. and C.T. All authors have read and agreed to the published version of the manuscript.

Funding

The research was supported by a Mega Grant from the Government of the Russian Federation within the framework of the federal project No. 075-15-2021-584.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The research was supported by a Mega Grant from the Government of the Russian Federation within the framework of the federal project No. 075-15-2021-584.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

We present a MATLAB listing with a naive program outlining the new implementation NEW6(4). We give explanations for inputs and outputs in the listing. In the following program the coefficients for w ^ are given in the vector ww while the coefficients for w ^ are given in vector dww.
Mathematics 10 00875 i004Mathematics 10 00875 i005
We proceed with an application of the above to the semi linear problem for tolerance 10 11 . Thus, we write in the command window of MATLAB:
Mathematics 10 00875 i006
After this we may extract the stages and the global error observed by typing:
Mathematics 10 00875 i007
The last two numbers above correspond to the bottom rightmost square of Figure 7.

References

  1. Dormand, J.R.; El-Mikkawy, M.E.A.; Prince, P.J. Families of Runge-Kutta-Nyström formulae. IMA J. Numer. Anal. 1987, 7, 235–250. [Google Scholar] [CrossRef]
  2. Butcher, J.C. On Runge-Kutta processes of high order. J. Aust. Math. Soc. 1964, 4, 179–194. [Google Scholar] [CrossRef] [Green Version]
  3. Butcher, J.C. Numerical Methods for Ordinary Differential Equations, 3rd ed.; John Wiley & Sons: Chichester, UK, 2016. [Google Scholar]
  4. Papakostas, S.N.; Tsitouras, C. High phase-lag order Runge-Kutta and Nyström pairs. SIAM J. Sci. Comput. 1999, 21, 747–763. [Google Scholar] [CrossRef]
  5. El-Mikkawy, M.E.A.; Rahmo, E. A new optimized non-FSAL embedded Runge-Kutta-Nyström algorithm of orders 6 and 4 in six stages. Appl. Math. Comput. 2003, 145, 3343. [Google Scholar] [CrossRef]
  6. Fehlberg, E. Eine Runge-Kutta-Nystrom-Formel g-ter Ordnung rnit Schrittweitenkontrolle fur Differentialgleichungen x ¨ = f(t,x). ZAMM 1981, 61, 477–485. [Google Scholar] [CrossRef]
  7. Horn, M.K. Developments in High Order Runge-Kutta-Nystrom Formulas. Ph.D. Thesis, The University of Texas, Austin, TX, USA, 1977. [Google Scholar]
  8. Storn, R.; Price, K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  9. Storn, R.; Price, K.; Neumaier, A.; Zandt, J.V. DeMat. Available online: https://www.swmath.org/software/24853 (accessed on 23 August 2021).
  10. Matlab. MATLAB Version 7.10.0; The MathWorks Inc.: Natick, MA, USA, 2010. [Google Scholar]
  11. Van de Vyver, H. Scheifele two-step methods for perturbed oscillators. J. Comput. Appl. Math. 2009, 224, 415–432. [Google Scholar] [CrossRef] [Green Version]
  12. Van de Vyver, H. A Runge-Kutta-Nyström pair for the numerical integration of perturbed oscillators. Comput. Phys. Commun. 2005, 167, 129–142. [Google Scholar] [CrossRef]
  13. Vanden Berghe, G.; Van Daele, M. Exponentially-fitted Obrechkoff methods for second-order differential equations. Appl. Numer. Math. 2009, 59, 815–829. [Google Scholar] [CrossRef]
  14. Franco, J.M.; Gomez, I. Trigonometrically fitted nonlinear two-step methods for solving second order oscillatory IVPs. Appl. Math. Comput. 2014, 232, 643–657. [Google Scholar] [CrossRef]
  15. Simos, T.E.; Tsitouras, C. Explicit, Ninth Order, Two Step Methods for solving Inhomogeneous Linear problems x(t) = Λx(t) + f(t). Appl. Numer. Math. 2020, 153, 344–351. [Google Scholar] [CrossRef]
Figure 1. Absolute stability regions for y.
Figure 1. Absolute stability regions for y.
Mathematics 10 00875 g001
Figure 2. Absolute stability regions for y .
Figure 2. Absolute stability regions for y .
Mathematics 10 00875 g002
Figure 3. Efficiency plots for the model problem.
Figure 3. Efficiency plots for the model problem.
Mathematics 10 00875 g003
Figure 4. Efficiency plots for the Inhomogeneous problem.
Figure 4. Efficiency plots for the Inhomogeneous problem.
Mathematics 10 00875 g004
Figure 5. Efficiency plots for Bessel problem.
Figure 5. Efficiency plots for Bessel problem.
Mathematics 10 00875 g005
Figure 6. Efficiency plots for the Duffing problem.
Figure 6. Efficiency plots for the Duffing problem.
Mathematics 10 00875 g006
Figure 7. Efficiency plots for semi-Linear problem.
Figure 7. Efficiency plots for semi-Linear problem.
Mathematics 10 00875 g007
Figure 8. Efficiency plots for Wave equation.
Figure 8. Efficiency plots for Wave equation.
Mathematics 10 00875 g008
Figure 9. Efficiency plots (time vs. accuracy) for the Bessel problem.
Figure 9. Efficiency plots (time vs. accuracy) for the Bessel problem.
Mathematics 10 00875 g009
Figure 10. Efficiency plots (time vs. accuracy) for the semi linear problem.
Figure 10. Efficiency plots (time vs. accuracy) for the semi linear problem.
Mathematics 10 00875 g010
Table 1. Basic characteristics of the RKN Pairs considered.
Table 1. Basic characteristics of the RKN Pairs considered.
PairStages T ( p + 1 ) 2 T ( p + 1 ) 2 v ^ v ^ v ˜ v ˜
PT6(4) [4]5 8.4 × 10 5 6.7 × 10 5 4.3905.325.33
DEP6(4) [1]5 8.7 × 10 5 7.7 × 10 5 3.2706.956.93
ER6(4) [5]6 4.9 × 10 9 4.8 × 10 9 1.8204.614.61
NEW6(4)6 1.1 × 10 5 1.4 × 10 5 5.394.445.135.19
v ^ : Length of Imaginary Stability Interval associated with y. v ^ : Length of Imaginary Stability Interval associated with y′. v ˜ : Length of Real Stability Interval associated with y. v ˜ : Length of Real Stability Interval associated with y′. T ( p + 1 ) 2 : Euclidean norm of the vector consisting of all the principal truncation error coefficients of the higher order method of a pair (regarding the solution y). T ( p + 1 ) 2 : as before, but regarding y′.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kovalnogov, V.N.; Fedorov, R.V.; Generalov, D.A.; Tsvetova, E.V.; Simos, T.E.; Tsitouras, C. On a New Family of Runge–Kutta–Nyström Pairs of Orders 6(4). Mathematics 2022, 10, 875. https://doi.org/10.3390/math10060875

AMA Style

Kovalnogov VN, Fedorov RV, Generalov DA, Tsvetova EV, Simos TE, Tsitouras C. On a New Family of Runge–Kutta–Nyström Pairs of Orders 6(4). Mathematics. 2022; 10(6):875. https://doi.org/10.3390/math10060875

Chicago/Turabian Style

Kovalnogov, Vladislav N., Ruslan V. Fedorov, Dmitry A. Generalov, Ekaterina V. Tsvetova, Theodore E. Simos, and Charalampos Tsitouras. 2022. "On a New Family of Runge–Kutta–Nyström Pairs of Orders 6(4)" Mathematics 10, no. 6: 875. https://doi.org/10.3390/math10060875

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop