Next Article in Journal
Kropina Metrics with Isotropic Scalar Curvature via Navigation Data
Previous Article in Journal
Finite-Time Fuzzy Fault-Tolerant Control for Nonlinear Flexible Spacecraft System with Stochastic Actuator Faults
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Methodology for the Development of Efficient Multistep Methods for First-Order IVPs with Oscillating Solutions

by
Theodore E. Simos
1,2,3,4,5,6
1
School of Mechanical Engineering, Hangzhou Dianzi University, Er Hao Da Jie 1158, Xiasha, Hangzhou 310018, China
2
Center for Applied Mathematics and Bioinformatics, Gulf University for Science and Technology, West Mishref 32093, Kuwait
3
Department of Medical Research, China Medical University Hospital, China Medical University, Taichung City 40402, Taiwan
4
Laboratory of Inter-Disciplinary Problems of Energy Production, Ulyanovsk State Technical University, 32 Severny Venetz Street, Ulyanovsk 432027, Russia
5
Data Recovery Key Laboratory of Sichuan Province, Neijiang Normal University, Dongtong Road 705, Neijiang 641100, China
6
Section of Mathematics, Department of Civil Engineering, Democritus University of Thrace, 67100 Xanthi, Greece
Mathematics 2024, 12(4), 504; https://doi.org/10.3390/math12040504
Submission received: 5 January 2024 / Revised: 31 January 2024 / Accepted: 4 February 2024 / Published: 6 February 2024
(This article belongs to the Section Engineering Mathematics)

Abstract

:
In this research, we provide a novel approach to the development of effective numerical algorithms for the solution of first-order IVPs. In particular, we detail the fundamental theory behind the development of the aforementioned approaches and show how it can be applied to the Adams–Bashforth approach in three steps. The stability of the new scheme is also analyzed. We compared the performance of our novel algorithm to that of established approaches and found it to be superior. Numerical experiments confirmed that, in comparison to standard approaches to the numerical solution of Initial Value Problems (IVPs), including oscillating solutions, our approach is significantly more effective.

1. Introduction

Equations or systems of equations of the form
y ( t ) = f ( t , y ) , y ( t 0 ) = y 0 ,
are used to solve problems in a wide variety of fields, including astrophysics, chemistry, physics, chemistry, electronics, nanotechnology, materials science, and more. The category of equations with an oscillatory/periodic solution deserves extra consideration (see [1,2]).
Significant effort has been put into studying the numerical solution to the above equation or system of equations during the past two decades (for examples, see [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17], and the references therein). For a more in-depth look at the techniques used to solve (1) with solutions presenting oscillating behavior, refer to [3,8,18] and the references therein; Quinlan and Tremaine [10] as well as [6,7,19]; and so on. All existing numerical methods for solving (1) in the literature have several commonalities, the most prominent one being that they are multistep or hybrid approaches. In addition, the vast majority of these techniques were developed for the numerical solution of second-order differential equations. We mention the following basic categories of methods and the bibliography for them:
From the above bibliography, it is easy to see that there has not been, until now, a contribution to the development of multistep methods with minimal phase lag or phase-fitted multistep methods for first-order IVPs.
In this paper, we introduce the theory for the calculation of the phase lag and amplification error (or amplification factor) of the multistep methods for first-order IVPs.
The paper is developed as follows:
  • In Section 2, we develop the general theory for the calculation of the phase lag and amplification error (or amplification factor) of the multistep methods for first-order IVPs.
  • In Section 3, we present methodologies for the achievement of the phase lag, amplification factor, phase-fitted, and amplification-fitted multistep methods. More specifically, we present methodologies for the achievement of minimal phase lag of the multistep method, a methodology for the achievement of the amplification-fitted multistep method, and a methodology for the achievement of the phase-fitted and amplification-fitted multistep method.
  • In Section 4, we present the stability analysis for the new proposed methods.
  • In Section 5, we present the numerical results.
The numerical results show that the methodology for the development of phase-fitted and amplification-fitted multistep methods produced the most efficient ones for problems with solutions of oscillating behavior.

2. The Theory

In order to study the phase lag of multistep methods for the problems (1), the following scalar test equation is used:
y t = I ω y t
The solution of the above equation is given by:
y t = exp I ω t
Consider the multistep methods for the numerical solution of the above-mentioned problem (1):
y n + k y n + k 1 = h j = 1 k A n + k j ω h f n + k j
where A n + k j ω h , j = 1 , 2 , , k are polynomials of ω h , and h is the step length of the integration.
Applying (4) to (2), we achieve:
y n + k y n + k 1 = I ω h j = 1 k A n + k j ω h y n + k j
Taking into account:
v = ω h
(5) gives:
y n + k y n + k 1 = I v j = 1 k A n + k j v y n + k j
and
y n + k 1 + I v A n + k 1 v y n + k 1 I v j = 2 k A n + k j v y n + k j = 0
The characteristic equation of the above difference equation is given by:
λ k 1 + I v A n + k 1 v λ k 1 I v j = 2 k A n + k j v λ k j = 0
Definition 1.
Taking into account that the theoretical solution of the scalar test Equation (1) for t = h is equal to exp I ω h , i.e., exp I v (see (6)), and the numerical solution of the scalar test Equation (1) for t = h is equal to exp I θ v , we have the following definition for the phase lag:
Φ = v θ v
The order of the phase lag is equal to q if and only if the quantity Φ = O v q + 1 as v 0 .
Taking into account the following relation:
λ n = exp n I θ ( v ) = cos n θ ( v ) + I sin n θ ( v ) n = 1 , 2 ,
we obtain:
cos k θ ( v ) + I sin k θ ( v ) 1 + I v A n + k 1 cos k 1 θ ( v ) + I sin k 1 θ ( v ) j = 2 k 1 I v A n + k j v cos k j θ ( v ) + I sin k j θ ( v ) I v A n v = 0
The following lemmas must be used to analyze the above relation (12).
Lemma 1.
The following relation is valid:
cos θ ( v ) = c o s v + c v q + 2 + O v q + 4
For the proof, see Appendix A.
Lemma 2.
The following relation is valid:
sin θ ( v ) = s i n v c v q + 1 + O v q + 3
For the proof, see Appendix B.
Lemma 3.
The following relation is valid:
cos j θ ( v ) = c o s j v + c j 2 v q + 2 + O v q + 4
sin j θ ( v ) = s i n j v c j v q + 1 + O v q + 3
For the proof, see Appendix C.
Taking into account relations (15) and (16), relation (12) becomes:
cos k v + c k 2 v q + 2 + I sin k v c k v q + 1 1 + I v A n + k 1 { cos k 1 v + c k 1 2 v q + 2 + I sin k 1 v c k 1 v q + 1 } j = 2 k 1 I v A n + k j v { cos k j v + c k j 2 v q + 2 + I sin k j v c k j v q + 1 } I v A n v = 0
The above relation (17) can be divided into two parts: the real part and the imaginary part.
  • The Real Part
The real part gives:
cos k v + c k 2 v q + 2 cos k 1 v c k 1 2 v q + 2 + v A n + k 1 sin k 1 v c k 1 v q + 1 + j = 2 k 1 v A n + k j v sin k j v c k j v q + 1 = 0
The relation (18) gives:
cos k v cos k 1 v + j = 1 k 1 v A n + k j v sin k j v = c v q + 2 [ k 2 k 1 2 j = 1 k 1 v A n + k j v ] c v q + 2 = cos k v cos k 1 v + j = 1 k 1 v A n + k j v sin k j v 2 k 1 j = 1 k 1 A n + k j v k j
This is the direct formula for the computation of the phase lag of the multistep method (4). Below, we will describe the procedure for the computation of the phase lag of method (4).
  • The Imaginary Part
The imaginary part gives:
sin k v c k v q + 1 sin k 1 v + c k 1 v q + 1 v A n + k 1 c o s k 1 v + c k 1 2 v q + 2 j = 2 k 1 v A n + k j v cos k j v + c k j 2 v q + 2 v A n = 0
Relation (20) gives:
sin k v sin k 1 v j = 1 k 1 v A n + k j v cos k j v v A n = c v q + 1 [ 1 j = 1 k 1 v 2 A n + k j v k j 2 ] c v q + 1 = sin k v sin k 1 v j = 1 k 1 v A n + k j v cos k j v v A n 1 j = 1 k 1 v 2 A n + k j v k j 2
This is the direct formula for the computation of the amplification factor of the multistep method (4).

3. Methodologies for Achievement of the Phase Lag, Amplification Factor, Phase-Fitted and Amplification-Fitted Methods

3.1. Classical Methods—Methods with Constant Coefficients Known in the Literature

We will focus our examples on the well-known method of Adams–Bashforth of the third algebraic order, i.e., on the method:
ψ n + 1 ψ n = h 12 23 ψ n 16 ψ n 1 + 5 ψ n 2
with the local truncation error ( L T E ) given by:
L T E = 3 8 h 4 y 4 t + O h 5
In order to determine the phase lag and amplification error of this method, we apply the theory developed in Section 2.
Application of the method (22) to the test Equation (2) leads to the difference Equation (7) with k = 3 and
A 2 v = 23 12 , A 1 v = 4 3 , A 0 v = 5 12
Based on the above formula (19) and using Taylor series expansion for cos m v , sin m v , m = 1 , 2 , we obtain:
cos 3 v cos 2 v + v A 2 v sin 2 v + v A 1 v sin v 5 2 A 2 v A 1 v = 3 20 v 4 61 360 v 6 +
Consequently, q = 2 and c = 3 20 . The third algebraic order Adams–Bashforth method is of the second-order phase lag.
Based now on the above formula (21) and using Taylor series expansion for cos m v , sin m v , m = 1 , 2 , we obtain:
sin 3 v sin 2 v v A 2 v cos 2 v v A 1 v cos v v A 0 v 1 4 v 2 A 2 v v 2 A 1 v = 193 360 v 5 + 54967 15120 v 7 +
Consequently, q = 4 and c = 193 360 . The third algebraic order Adams–Bashforth method is of the fourth order amplification error. For our computational purposes, we will call the third algebraic order Adams–Bashforth method Method I.

3.2. Minimal Phase Lag

In order to investigate the minimization of the phase lag, we study the following general four-step method:
ψ n + 1 ψ n = h A 2 v , ψ n + A 1 v ψ n 1 + A 0 v ψ n 2

3.2.1. Algorithm for the Minimization of the Phase Lag

The algorithm for the minimization of the phase lag is the following:
  • Elimination of the amplification factor.
  • Computation of the phase lag based on the coefficient obtained by the previous step.
  • Taylor series expansion of the phase lag computed above.
  • Determination of the system of equations in order to achieve minimal phase lag.
  • Computation of the new coefficients.
Based on the above algorithm, we obtain the following two methods with minimal phase lag.

3.2.2. First Method with Minimal Phase Lag (Method with Minimal Phase Lag and Eliminated Amplification Factor with Third Algebraic Order)

We consider the method (27) with A 0 v = 5 12
Using the direct formula for the computation of the amplification factor (21), we obtain:
A F = sin 3 v sin 2 v A 2 v v cos 2 v A 1 v v cos v A 0 v v 4 v 2 A 2 v v 2 A 1 v 1
where A F declares the amplification factor.
Requiring the elimination of the amplification factor, i.e., requiring A F = 0 , we obtain:
A 2 v = A 1 v v cos v A 0 v v + sin 3 v sin 2 v v cos 2 v
Substituting the values of A 0 v and A 2 v given above into the direct formula for the computation of the phase lag (19), we obtain:
P h E r r = v 5 6 sin v cos v v + A 1 v v sin v cos v + 1 A 3 v
where
A 3 v = 2 cos v 2 v A 1 v + 8 sin v cos v 2 10 cos v 2 v 2 A 1 v v cos v 4 sin v cos v A 1 v v + 25 v 6 2 sin v
and P h E r r declares the phase lag.
Taking the Taylor series expansion of the formula (30), we obtain:
P h E r r = 4 3 + A 1 v v 2 A 1 v 23 6 + v 4 A 4 v A 1 v 23 6 +
where
A 4 v = 43 72 1 6 A 1 v + 2 4 + 3 A 1 v A 1 v + 11 3 6 A 1 v + 23
Requesting the minimization of the phase lag, we obtain the following equation:
4 3 + A 1 v v 2 A 1 v 23 6 = 0 A 1 v = 4 3 .
The characteristics of this new method are:
A 0 v = 5 12 A 1 v = 4 3 A 2 v = 1 12 16 v cos ( v ) + 48 sin ( v ) cos ( v ) 2 12 sin ( v ) 24 sin ( v ) cos ( v ) 5 v v cos ( 2 v ) L T E = 3 8 h 4 y 4 t + O h 5 P h E r r = 3 20 v 4 + 467 1800 v 6 +
The Taylor series expansion of the coefficient A 2 v is given by:
A 2 v = 23 12 + 193 360 v 4 + 12583 15120 v 6 +
We will call the above new method Method II for our computational purposes.

3.2.3. Second Method with Minimal Phase Lag (Method with Minimal Phase Lag and Eliminated Amplification Factor with Second Algebraic Order)

We consider again the general four-step method presented in (27). Our strategy is the following.
  • Elimination of the Amplification Factor
In order to achieve this target, we have the following procedure:
  • Using the direct formula for the computation of the amplification factor (21) for k = 3 , we obtain the relation (28).
  • Requiring the elimination of the amplification factor for k = 3 , i.e., requiring A F = 0 , we obtain the relation (29).
Minimization of the Phase Lag
  • Using the direct formula for the computation of the phase lag (19) with the value of A 2 v calculated by (29), we obtain:
    P h E r r = v 2 cos v sin v v A 0 v + A 1 v v sin v cos v + 1 A 5 v
    where
    A 5 v = 2 cos v 2 v A 1 v + 8 sin v cos v 2 10 cos v 2 v 2 A 1 v v cos v 4 cos v sin v A 1 v v 2 A 0 v v 2 sin v + 5 v
    and P h E r r declares the phase lag.
  • Taking the Taylor series expansion of the formula (37), we obtain:
    P h E r r = 1 2 4 A 0 v + 2 A 1 v + 1 v 2 A 1 v + 3 + 2 A 0 v + 1 24 A 6 v v 4 A 1 v + 3 + 2 A 0 v 2 A 7 v v 6 720 A 1 v + 3 + 2 A 0 v 3 + A 8 v v 8 120960 A 1 v + 3 + 2 A 0 v 4 A 9 v v 10 725760 A 1 v + 3 + 2 A 0 v 5 +
    where
    A 6 v = 28 A 1 v 2 + 88 A 1 v A 0 v + 64 A 0 v 2 63 A 1 v 78 A 0 v 41 A 7 v = 1266 A 1 v 3 + 4536 A 1 v 2 A 0 v + 4392 A 1 v A 0 v 2 + 768 A 0 v 3 3331 A 1 v 2 7324 A 1 v A 0 v 4204 A 0 v 2 + 6852 A 1 v + 11244 A 0 v + 4717 A 8 v = 305448 A 1 v 4 + 1251120 A 1 v 3 A 0 + 1587168 A 1 v 2 A 0 v 2 + 625728 A 1 v A 0 v 3 + 24576 A 0 v 4 1138857 A 1 v 3 3145374 A 1 v 2 A 0 v 2160972 A 1 v A 0 v 2 + 116376 A 0 v 3 + 2964871 A 1 v 2 + 7033180 A 1 v A 0 v + 3960796 A 0 v 2 3414051 A 1 v 6053454 A 0 v 2816419 A 9 v = 2654582 A 1 v 5 + 12221120 A 1 v 4 A 0 v + 18932720 A 1 v 3 A 0 v 2 + 11125120 A 1 v 2 A 0 v 3 + 1823200 A 1 v A 0 v 4 + 16384 A 0 v 5 12358419 A 1 v 4 40966656 A 1 v 3 A 0 v 38619576 A 1 v 2 A 0 v 2 4641600 A 1 v A 0 v 3 + 3584400 A 0 v 4 + 42485492 A 1 v 3 + 121231992 A 1 v 2 A 0 v + 91483728 A 1 v A 0 v 2 + 5748064 A 0 v 3 73555030 A 1 v 2 167703472 A 1 v A 0 v 84236488 A 0 v 2 + 63314574 A 1 v + 132127224 A 0 v + 61142641
  • Requesting the minimization of the phase lag, we obtain the following system of equations:
    4 A 0 v + 2 A 1 v + 1 A 1 v + 3 + 2 A 0 v = 0 A 6 v A 1 v + 3 + 2 A 0 v 2 = 0
  • Solving the above system of Equation (41), we obtain:
    A 1 v = 7 12 , A 0 v = 1 24 .
The characteristics of this new method are:
A 0 v = 1 24 A 1 v = 7 12 A 2 v = 1 24 14 v cos ( v ) + 24 sin ( 3 v ) 24 sin ( 2 v ) v v cos 2 v L T E = 3 8 h 3 y 3 t + ω 2 y t + O h 5 P h E r r = 11 3600 v 6 2423 504000 v 8 +
The Taylor series expansion of the coefficient A 2 v is given by:
A 2 v = 37 24 3 8 v 2 + 7 1440 v 4 761 60480 v 6
We will call the above new method Method III for our computational purposes.

3.3. Amplification Fitted Method

We consider the method (27) with A 1 v = 4 3 and A 0 v = 5 12 .
Using the direct formula for the computation of the amplification factor (21), we obtain:
A F = 1 4 A 10 v 12 A 2 v v 2 4 v 2 + 3
where A F declares the amplification factor and
A 10 v = 24 A 2 v v cos v 2 + 48 sin v cos v 2 24 sin v cos v + 16 v cos v + 12 A 2 v v 12 sin v 5 v
Requiring the elimination of the amplification factor, i.e., requiring A F = 0 , we obtain:
A 2 v = 1 12 16 v cos v + 12 sin 3 v 12 sin 2 v 5 v v cos 2 v
Substituting the value of A 2 v given above into the direct formula for the computation of the phase lag (19), we obtain:
P h E r r = v 5 v sin v cos v 8 v sin v 6 cos v + 6 A 11 v
where
A 11 v = 48 sin v cos v 2 76 cos v 2 v 24 sin v cos v + 16 v cos v 12 sin v + 33 v
Taking the Taylor series expansion of the formula (48), we obtain:
P h E r r = 3 20 v 4 + 467 1800 v 6 + 245629 504000 v 8 +
Remark 1.
Consequently, q = 2 and c = 3 20 . The amplification-fitted Adams–Bashforth method developed in this section is of the second-order phase lag, i.e., has the same phase lag order of the the third algebraic order Adams–Bashforth method.
The Taylor series expansion of the coefficient A 2 v is given by:
A 2 v = 23 12 + 193 360 v 4 + 12583 15120 v 6 + 13973 10368 v 8 +
The characteristics of this new method are:
A 0 v = 5 12 A 1 v = 4 3 A 2 v = 1 12 16 v cos v + 12 sin 3 v 12 sin 2 v 5 v v cos 2 v L T E = 3 8 h 4 y 4 t + O h 5 P h E r r = 3 20 v 4 + 467 1800 v 6 +
We will call the above new method Method IV for our computational purposes.

3.4. Phase Fitted and Amplification Fitted Method

We consider the method (27).
Using the direct formula for the computation of the phase lag and (19) the amplification factor (21), we obtain:
P h E r r = cos 3 v cos 2 v + A 2 v v sin 2 v + A 1 v v sin v 5 2 A 2 v A 1 v
A F = sin 3 v sin 2 v A 2 v v cos 2 v A 1 v v cos v A 0 v v 4 A 2 v v 2 v 2 A 1 v 1
where P h E r r is the phase lag, and A F declares the amplification factor.
Requiring the elimination of the phase lag and the amplification factor, i.e., requiring P h E r r = 0 and A F = 0 , and considering that A 0 = 5 12 , we obtain:
A 1 v = 1 6 5 v sin v 3 5 v sin v + 6 cos v 2 6 cos v sin v cos v v
A 2 v = 1 12 5 v sin v + 12 24 cos v 2 + 12 cos v v sin v
Taking the Taylor series expansion of the above formulae, we obtain:
A 1 v = 4 3 + 3 / 8 v 2 7 v 4 180 + 89 v 6 120960 23 v 8 362880 1963 v 10 479001600
A 2 v = 23 12 3 / 8 v 2 + v 4 80 11 v 6 13440 v 8 26880 233 v 10 53222400 +
The characteristics of this new method are:
A 0 v = 5 12 A 1 v see ( 55 ) A 2 v see ( 56 ) L T E = 3 8 h 4 y 4 t + ω 2 y 2 t + O h 5 P h E r r = 0 A F = 0
We will call the above new method Method V for our computational purposes.

4. Stability Analysis

Let us consider the general form of Adams–Bashforth four-step methods:
ψ n + 1 ψ n = h C 2 f n + C 1 f n 1 + C 0 f n 2
where f n + j = y n + j , j = 2 1 0
The obtained methods in the previous section, i.e., the methods (24), (35), (36), (43), (44), (51), (52), (58), and (59), belong to the general method (60).
Applying the scheme (60) to the scalar test equation
ψ = λ y where λ C
we obtain the following difference equation:
ψ n + 1 A ( H ) ψ n B ( H ) ψ n 1 C ( H ) ψ n 2 = 0
where H = λ h and
A ( H ) = 1 + C 2 H , B ( H ) = C 1 H , C ( H ) = C 3 H
The characteristic equation of (62) is given by
r 3 A ( H ) r 2 B ( H ) r C ( H ) = 0
Solving the above equation in H and substituting r = exp ( i θ ) , where i = 1 , we can plot the stability regions for θ [ 0 , 2 π ] . In Figure 1, Figure 2, Figure 3, Figure 4 and Figure 5, we present the stability region for the obtained Methods IV. For the cases of Methods II–V, we present the stability regions for v = 1 , v = 10 , and v = 100 .

5. Numerical Results

5.1. Problem of Stiefel and Bettis

We consider the following almost periodic orbit problem studied by Stiefel and Bettis [122]:
y 1 ( x ) = y 1 ( x ) + 0.001 cos ( x ) , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 0 y 2 ( x ) = y 2 ( x ) + 0.001 sin ( x ) , y 2 ( 0 ) = 0 , y 2 ( 0 ) = 0.9995
The exact solution is
y 1 ( x ) = cos ( x ) + 0.0005 x sin ( x ) , y 2 ( x ) = sin ( x ) 0.0005 x cos ( x ) .
For this problem, we use ω = 1 .
Equation (65) is solved numerically for 0 x 100,000 using the following methods:
  • The classical Adams–Bashforth method of the third order, which is mentioned as Comp. Meth. I.
  • The classical Adams–Bashforth method of the fifth order, which is mentioned as Comp. Meth. II.
  • The Runge–Kutta Dormand and Prince fourth-order method [54], which is mentioned as Comp. Meth. III.
  • The Runge–Kutta Dormand and Prince fifth-order method [54], which is mentioned as Comp. Meth. IV.
  • The Runge–Kutta Fehlberg fourth-order method [123], which is mentioned as Comp. Meth. V.
  • The Runge–Kutta Fehlberg fifth-order method [123], which is mentioned as Comp. Meth. VI.
  • The Runge–Kutta Cash and Karp fifth-order method [124], which is mentioned as Comp. Meth. VII.
  • The Adams–Bashforth method with minimal phase lag (1st Case) which is developed in Section 3.2.2, which is mentioned as Comp. Meth. VIII.
  • The Adams–Bashforth method with minimal phase lag (2nd Case) which is developed in Section 3.2.3, which is mentioned as Comp. Meth. IX.
  • The Adams–Bashforth amplification fitted method which is developed in Section 3.3, which is mentioned as Comp. Meth. X.
  • The Adams–Bashforth phase-fitted and amplification-fitted method, which is developed in Section 3.4, which is mentioned as Comp. Meth. XI.
In Figure 6, we present the maximum absolute error of the solution achieved by each of the above-mentioned numerical methods for the problem of Stiefel and Bettis [122].
From Figure 6, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X give approximately the same results
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods.
  • Comp. Meth. VII gives more accurate results than the Comp. Meth. IV method.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. VI gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. III gives better results than the Comp. Meth. VI method for the most step sizes, but for small step sizes, it gives approximately the same results as Comp. Meth. VI.
  • Comp. Meth. IX gives mixed results. For big step sizes, it gives better results than Comp. Meth. III. For middle step sizes, it gives better results than Comp. Meth. VII but worse results than Comp. Meth. III, Comp. Meth. V, and Comp. Meth. VI. For small step sizes, it gives better results than Comp. Meth. IV but worse results than Comp. Meth. VII.
  • Finally, Comp. Meth. XI, gives the most accurate results.

5.2. Problem of Franco et al. [125]

We consider the following inhomogeneous linear problem studied by Franco et al. [125]:
y 1 ( x ) = 1 2 μ 2 + 1 y 1 ( x ) 1 2 μ 2 1 y 2 ( x ) , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 1 y 2 ( x ) = 1 2 μ 2 1 y 1 ( x ) 1 2 μ 2 + 1 y 2 ( x ) , y 2 ( 0 ) = 1 , y 2 ( 0 ) = 1
The exact solution is
y 1 ( x ) = cos ( x ) + sin ( x ) , y 2 ( x ) = cos ( x ) sin ( x ) .
where μ = 10 4 . For this problem, we use ω = 1 .
The system of Equation (67) is solved numerically for 0 x 100,000 using the methods presented in Section 5.1.
From the Figure 7, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X give approximately the same results
  • Comp. Meth. II gives more accurate results than the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. IV method.
  • Comp. Meth. VII gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. VI gives results with the same accuracy as the Comp. Meth. III method.
  • Comp. Meth. IX gives better results than the Comp. Meth. VI and Comp. Meth. III methods.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.3. Problem of Franco and Palacios [126]

We consider the following problem studied by Franco and Palacios [126]:
y 1 ( x ) = y 1 ( x ) + ε cos ( ϑ x ) , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 0 y 2 ( x ) = y 2 ( x ) + ε sin ( ϑ x ) , y 2 ( 0 ) = 0 , y 2 ( 0 ) = 1
The exact solution is
y 1 ( x ) = 1 ε ϑ 2 1 ϑ 2 cos ( x ) + ε 1 ϑ 2 cos ( ϑ x ) , y 2 ( x ) = 1 ε ϑ ϑ 2 1 ϑ 2 sin ( x ) + ε 1 ϑ 2 sin ( ϑ x ) .
where ε = 0.001 and ϑ = 0.01 . For this problem, we use ω = max 1 , | ϑ | .
The system of Equation (69) is solved numerically for 0 x 100,000 using the methods presented in Section 5.1.
From Figure 8, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X give approximately the same results.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. IV method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. VII gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. VI gives results with the same accuracy as the Comp. Meth. III method.
  • Comp. Meth. IX gives better results than the Comp. Meth. VI and Comp. Meth. III methods.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.4. A Nonlinear Orbital Problem [127]

We consider the following nonlinear orbital problem studied by Simos in [127]:
y 1 ( x ) = φ 2 y 1 ( x ) + 2 y 1 ( x ) y 2 ( x ) sin ( 2 φ x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 0 y 2 ( x ) = φ 2 y 2 ( x ) + y 1 ( x ) 2 y 2 ( x ) 2 cos ( 2 φ x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 , y 2 ( 0 ) = 0 , y 2 ( 0 ) = φ
The exact solution is
y 1 ( x ) = cos ( φ x ) , y 2 ( x ) = sin ( φ x ) .
where φ = 10 . For this problem, we use ω = 10 .
The system of Equation (71) is solved numerically for 0 x 100,000 using the methods presented in Section 5.1.
From Figure 9, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X give approximately the same results.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. IV method.
  • Comp. Meth. VII gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. VI gives results with the same accuracy as the Comp. Meth. VII method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. VI method.
  • Comp. Meth. IX gives better results than the Comp. Meth. VI and Comp. Meth. III method.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.5. Nonlinear Problem of Petzold [128]

We consider the following nonlinear problem studied by Petzold [128]:
y 1 ( x ) = λ y 2 ( x ) , y 1 ( 0 ) = 1 y 2 ( x ) = λ y 1 ( x ) + α λ sin ( λ x ) , y 2 ( 0 ) = α 2 λ 2
The exact solution is
y 1 ( x ) = 1 α 2 λ x cos ( λ x ) , y 2 ( x ) = 1 α 2 λ x sin ( λ x ) α 2 λ 2 cos ( λ x )
where λ = 1000 , α = 100 . For this problem, we use ω = 1000 .
The system of Equation (73) is solved numerically for 0 x 1000 using the methods presented in Section 5.1.
From Figure 10, we can observe the following.
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X give approximately the same results.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. IV method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. VII gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. VI gives results with the same accuracy as the Comp. Meth. VII method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. VI method.
  • Comp. Meth. IX gives mixed results. For big step sizes, it gives better results than Comp. Meth. III. For middle step sizes, it gives better results than Comp. Meth. VII but worse results than Comp. Meth. III and Comp. Meth. VI. For small step sizes, it gives better results than Comp. Meth. IV and Comp. Meth. V but worse results than Comp. Meth. VII.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.6. Two-Body Gravitational Problem

We consider the two-body gravitational problem
y 1 ( x ) = y 1 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 0 y 2 ( x ) = y 2 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 , y 2 ( 0 ) = 0 , y 2 ( 0 ) = 1
The exact solution is
y 1 ( x ) = cos ( x ) , y 2 ( x ) = sin ( x ) .
For this problem, we use ω = 1 y 1 ( x ) 2 + y 2 ( x ) 2 3 4 .
The system of Equations (75) is solved numerically for 0 x 100,000 using the methods presented in Section 5.1.
From Figure 11, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X are not convergent to the solution.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. VI gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. VI method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. IX gives results with the same accuracy as the Comp. Meth. III method.
  • Comp. Meth. IV gives results with approximately the same accuracy as the results given by the Comp. Meth. IX method.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.7. Perturbed Two-Body Gravitational Problem

5.7.1. Case μ = 0.1

We consider the perturbed two-body Kepler’s problem
y 1 ( x ) = y 1 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 μ ( μ + 2 ) y 1 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 5 2 , y 1 ( 0 ) = 1 , y 1 ( 0 ) = 0 y 2 ( x ) = y 2 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 3 2 μ ( μ + 2 ) y 2 ( x ) y 1 ( x ) 2 + y 2 ( x ) 2 5 2 , y 2 ( 0 ) = 0 , y 2 ( 0 ) = 1 + μ
The exact solution is
y 1 ( x ) = cos ( x + μ x ) , y 2 ( x ) = sin ( x + μ x ) .
For this problem, we use ω = 1 + μ μ + 2 y 1 ( x ) 2 + y 2 ( x ) 2 3 4 .
The system of Equation (77) is solved numerically for 0 x 100,000 with μ = 0.1 and using the methods presented in Section 5.1. From Figure 11, it is obvious that the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods are not convergent to the solution.
From Figure 12, we can observe the following.
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X are not convergent to the solution.
  • Comp. Meth. VI gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. VI method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. III method.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. IX gives more accurate results than the Comp. Meth. IV method.
  • Finally, Comp. Meth. XI gives the most accurate results.

5.7.2. Case μ = 0.4

The system of Equation (77) is solved numerically for 0 x 100,000 with μ = 0.4 and using the methods presented in Section 5.1. From Figure 12, it is obvious that the Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X methods are not convergent to the solution.
From Figure 13, we can observe the following:
  • Comp. Meth. I, Comp. Meth. VIII, and Comp. Meth. X are not convergent to the solution.
  • Comp. Meth. V gives more accurate results than the Comp. Meth. VII method.
  • Comp. Meth. VI gives more accurate results than the Comp. Meth. V method.
  • Comp. Meth. III gives more accurate results than the Comp. Meth. VI method.
  • Comp. Meth. II gives more accurate results than the Comp. Meth. III method.
  • Comp. Meth. IV gives more accurate results than the Comp. Meth. II method.
  • Comp. Meth. IX gives more accurate results than the Comp. Meth. IV method.
  • Finally, Comp. Meth. XI gives the most accurate results.
For the above numerical illustrations, we have the following conclusions:
  • The phase-fitted and amplification-fitted methods (Comp. Meth. XI) give the most efficient results for all the problems.
  • The Adams–Bashforth method with minimal phase lag (1st Case) (Comp. Meth. VIII) and the Adams–Bashforth amplification-fitted method (Comp. Meth. X) give approximately the same results as the classical Adams–Bashforth method of the third order (Comp. Meth. I).
  • The Adams–Bashforth method with minimal phase lag (2nd Case) (Comp. Meth. IX) gives the second most efficient results for most of the problems.
From the above conclusions, we can see that the methodologies presented in this paper which prepare the most efficient methods are as follows:
  • The methodology which emphasizes the minimization of the phase lag (ignoring the algebraic order of the method), which is developed in Section 3.2.3;
  • The methodology which emphasizes on the vanishing of the phase lag and the amplification error of the method, which is developed in Section 3.4.
It is easy to see that the efficiency of the frequency-dependent methods (like the newly introduced) is dependent on the choice of the parameter v. In many problems, this choice is easy to be defined from the model of the specific problem. For the cases that this is not easy, methodologies for the determination of the parameter v are introduced in the literature (see [129,130]).
Remark 2.
For the solution of systems of high-order ordinary differential equations using the above-mentioned newly introduced techniques, we note that there are well-known methods for reducing a system of high-order ordinary differential equations into a system of first-order differential equations, for example: variable substitution, the introduction of new variables, rewriting the system of higher-order ordinary differential equations as a system of first-order differential equations by introducing new variables for each derivative, etc. (see [131]).
For the solution of systems of partial differential equations using the above-mentioned newly introduced techniques, we note that there are well-known methods for reducing a system of partial differential equations into a system of first-order differential equations, for example, the method of characteristics (see [132]).

6. Conclusions

In the present paper, we developed the theory of the phase lag and amplification error analysis for the multistep methods of the first-order initial-value problems. Based on the above developed theory, we presented several methodologies for the development of efficient methods for the multistep methods. More specifically, we developed methodologies for the following:
  • Methodology for the minimization of the phase lag.
  • Methodology for the development of an amplification-fitted method.
  • Methodology for the development of a phase-fitted method.
Using the above-mentioned methodologies, we developed several multistep methods. We used as a basic method the Adams–Bashforth method of the third algebraic order.
The above produced methods were applied to several problems with oscillating solutions, in order to test their efficiency.
All calculations adhered to are carried out using a quadruple precision arithmetic data type.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Proof of Lemma 1.
The phase lag order q and the phase lag constant c are given by its definition (10) as follows:
Φ = v cos θ v = c v q + 1 + O v q + 2
then, and since (see (10))
θ v = v Φ
using expansions of trigonometric functions, we achieve:
cos θ v = cos v Φ = = cos v cos Φ + sin v sin Φ
Using (A1), the relation (A3) gives:
cos θ v = cos v cos c v q + 1 + O v q + 2 + sin v sin c v q + 1 + O v q + 2
With the help of the Taylor series expansions of the functions cos c v q + 1 + O v q + 2 , sin c v q + 1 + O v q + 2 and sin v , relation (A4) gives:
cos θ v = cos v + c v q + 2 1 6 c v q + 4 + = cos v + c v q + 2 + O v q + 4
and the lemma is proved. □

Appendix B

Proof of Lemma 2.
Using expansions of trigonometric functions, we achieve:
sin θ v = sin v Φ = = sin v cos Φ cos v sin Φ
Using (A1), the relation (A6) gives:
sin θ v = sin v cos c v q + 1 + O v q + 2 cos v sin c v q + 1 + O v q + 2
With the help of the Taylor series expansions of the functions cos c v q + 1 + O v q + 2 , sin c v q + 1 + O v q + 2 and cos v , relation (A7) gives:
sin θ v = sin v c v q + 1 + 1 2 c v q + 3 + = sin v c v q + 1 + O v q + 3
and the lemma is proved. □

Appendix C

Proof of Lemma 3 (Proof for the relation (15)).
 
We will prove first the relation (15). We can write (15) as follows:
  • Let us examine the case j = 1 for the relation (15):
    cos 1 θ ( v ) = cos 1 v + c 1 2 v q + 2 + O v q + 4 cos θ ( v ) = cos v + c v q + 2 + O v q + 4
    which is valid (see Lemma 1).
  • Let us consider the relations (15) to be valid for j = k , i.e., let us consider that the relations:
    cos k θ ( v ) = cos k v + c k 2 v q + 2 + O v q + 4
    are valid.
  • We will prove that the relation (15) is valid for j = k + 1 . For j = k + 1 , we have:
    cos k + 1 θ ( v ) = cos k θ ( v ) + θ ( v ) = cos k θ ( v ) cos θ ( v ) sin k θ ( v ) sin θ ( v )
    Taking into account the following:
    cos k θ ( v ) = cos k v + c k 2 v q + 2 + O v q + 4 (see (A10))
    cos θ ( v ) = cos v + c v q + 2 + O v q + 4 (see (13)
    sin k θ ( v ) = sin k v c k v q + 1 + O v q + 3 (see (A14))
    sin θ ( v ) = sin v c v q + 1 + O v q + 3 (see (14))
    the relation (A11) becomes:
    cos k + 1 θ ( v ) = cos k + 1 v + c v q + 2 + c k 2 v q + 2 1 2 c k 2 v q + 4 + 1 24 c k 4 v q + 6 1 2 c k 2 v q + 4 + 1 24 c k 2 v q + 6 + c 2 k 2 v 2 q + 4 + + c k v q + 2 1 6 c k 3 v q + 4 + 1 120 c k 5 v q + 6 + c k v q + 2 1 6 c k v q + 4 + 1 120 c k v q + 6 + c k v 2 q + 2 + cos k + 1 θ ( v ) = cos k + 1 v + c v q + 2 + 2 c k v q + 2 + c k 2 v q + 2 1 6 c k v q + 4 k 2 + 6 k + 1 + 1 120 c k k 4 + 5 k 3 + 5 k + 1 v q + 6 + cos k + 1 θ ( v ) = cos k + 1 v + c ( k + 1 ) 2 v q + 2 1 6 c k v q + 4 k 2 + 6 k + 1 +
and the relation (15) is proved for j = k + 1 . □
Proof of Lemma 3 (Proof for the relation (16)).
 
We will prove now the relation (16). We can write (16) as follows:
  • Let us examine the case j = 1 for the relation (16):
    sin 1 θ ( v ) = sin 1 v c 1 v q + 1 + O v q + 3 sin θ ( v ) = sin v c v q + 1 + O v q + 3
    which is valid (see Lemma 2).
  • Let us consider that relation (16) is valid for j = k , i.e., let us consider that the relation:
    sin k θ ( v ) = sin k v c k v q + 1 + O v q + 3
    is valid
  • we will prove that relation (16) is valid for j = k + 1 . For j = k + 1 , we have:
    sin k + 1 θ ( v ) = sin k θ ( v ) + θ ( v ) = sin k θ ( v ) cos θ ( v ) + cos k θ ( v ) sin θ ( v )
    We take into account the following:
    sin k θ ( v ) = sin k v c k v q + 1 + O v q + 3 (see (A14))
    cos θ ( v ) = c o s v + c v q + 2 + O v q + 4 (see (13)
    cos k θ ( v ) = cos k v + c k 2 v q + 2 + O v q + 4 (see (A10))
    sin θ ( v ) = s i n v c v q + 1 + O v q + 3 (see (14))
    and relation (A15) becomes:
    sin k + 1 θ ( v ) = sin k + 1 v c k v q + 3 1 6 c k 3 v q + 5 + 1 120 c k 5 v q + 7 c v q + 1 + 1 2 c k 2 v q + 3 1 24 c k 4 v q + 5 + + c k 2 v q + 3 1 6 c k 2 v q + 5 + 1 120 c k 2 v q + 7 c k v q + 1 + 1 2 c k v q + 3 1 24 c k v q + 5 c k + 1 v 2 q + 3 + sin k + 1 θ ( v ) = sin k + 1 v c ( k + 1 ) v q + 1 + 1 2 c k v q + 3 3 k 2 + 1 1 24 c k v q + 5 k 3 + 4 k 2 + 4 k + 1 +
and relation (16) is proved for j = k + 1 . □

References

  1. Landau, L.D.; Lifshitz, F.M. Quantum Mechanics; Pergamon: New York, NY, USA, 1965. [Google Scholar]
  2. Prigogine, I.; Rice, S. (Eds.) Advances in Chemical Physics Vol. 93: New Methods in Computational Quantum Mechanics; John Wiley & Sons: Hoboken, NJ, USA, 1997. [Google Scholar]
  3. Simos, T.E. Numerical Solution of Ordinary Differential Equations with Periodical Solution. Doctoral Dissertation, National Technical University of Athens, Athens, Greece, 1990. (In Greek). [Google Scholar]
  4. Raptis, A.D. Exponential multistep methods for ordinary differential equations. Bull. Greek Math. Soc. 1984, 25, 113–126. [Google Scholar]
  5. Thomas, R.M.; Simos, T.E. A family of hybrid exponentially fitted predictor-corrector methods for the numerical integration of the radial Schrodinger equation. J. Comput. Appl. Math. 1997, 87, 215–226. [Google Scholar] [CrossRef]
  6. Vigo-Aguiar, J.; Ferrandiz, J.M. A general procedure for the adaptation of multistep algorithms to the integration of oscillatory problems. SIAM J. Numer. Anal. 1998, 35, 1684–1708. [Google Scholar] [CrossRef]
  7. Vigo-Aguiar, J. Mathematical Methods for the Numerical Propagation of Satellite Orbits. Doctoral Dissertation, University of Valladolid, Valladolid, Spain, 1993. (In Spanish). [Google Scholar]
  8. Ixaru, L.G. Numerical Methods for Differential Equations and Applications, aus der Reihe: Mathematics and Its Applications; D. Reidel Publishing Company: Dordrecht, The Netherlands; Boston, MA, USA; Lancaster, PA, USA, 1984. [Google Scholar]
  9. Avdelas, G.; Simos, T.E. Dissipative high phase-lag order Numerov-type methods for the numerical solution of the Schrödinger equation. Phys. Rev. 2000, 62, 1375–1381. [Google Scholar] [CrossRef] [PubMed]
  10. Quinlan, G.D.; Tremaine, S. Symmetric multistep methods for the numerical integration of planetary orbits. Astron. J. 1990, 100, 1694–1700. [Google Scholar] [CrossRef]
  11. Avdelas, G.; Simos, T.E. Embedded methods for the numerical solution of the Schrödinger equation. Comput. Math. Appl. 1996, 31, 85–102. [Google Scholar] [CrossRef]
  12. Avdelas, G.; Simos, T.E. A generator of high-order embedded P-stable method for the numerical solution of the Schrödinger equation. J. Comput. Appl. Math. 1996, 72, 345–358. [Google Scholar] [CrossRef]
  13. Simos, T.E. Predictor-corrector phase-fitted methods for y′′ = f(x,y) and an application to the Schrödinger equation. Int. J. Quantum Chem. 1995, 53, 473–483. [Google Scholar] [CrossRef]
  14. Lyche, T. Chebyshevian multistep methods for ordinary differential equations. Numer. Math. 1972, 10, 65–75. [Google Scholar] [CrossRef]
  15. Raptis, A.D.; Allison, A.C. Exponential—fitting methods for the numerical solution of the Schrödinger equation. Comput. Phys. Commun. 1978, 14, 1–5. [Google Scholar] [CrossRef]
  16. Simos, T.E. An eighth order exponentially-fitted method for the numerical solution of the Schrödinger equation. Int. J. Mod. Phys. 1998, 9, 271–288. [Google Scholar] [CrossRef]
  17. Konguetsof, A.; Simos, T.E. On the construction of Exponentially-Fitted Methods for the Numerical Solution of the Schrödinger Equation. J. Comput. Meth. Sci. Eng. 2001, 1, 143–165. [Google Scholar] [CrossRef]
  18. Hinchliffe, A.; Simos, T.E. Atomic structure computations. In Chemical Modelling: Applications and Theory; The Royal Society of Chemistry: Cambridge, UK, 2000; pp. 38–142. [Google Scholar]
  19. Simos, T.E.; Vigo-Aguiar, J. On the construction of efficient methods for second order IVPs with oscillating solution. Int. J. Mod. Phys. 2001, 10, 1453–1476. [Google Scholar] [CrossRef]
  20. 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]
  21. Vyver, H.V.D. A Symplectic Exponentially Fitted Modified Runge-Kutta-Nyström Method for the Numerical Integration of Orbital Problems. New Astron. 2005, 10, 261–269. [Google Scholar] [CrossRef]
  22. Vyver, H.V.D. On the Generation of P-Stable Exponentially Fitted Runge-Kutta-Nyström Methods By Exponentially Fitted Runge-Kutta Methods. J. Comput. Appl. Math. 2006, 188, 309–318. [Google Scholar] [CrossRef]
  23. Franco, J.M.; Khiar, Y.; Rández, L. Two new embedded pairs of explicit Runge-Kutta Methods adapted to the numerical solution of oscillatory problems. Appl. Math. Comput. 2015, 252, 45–57. [Google Scholar] [CrossRef]
  24. Franco, J.M.; Gomez, I. Symplectic explicit Methods of Runge-Kutta-Nyström type for solving perturbed oscillators. J. Comput. Appl. Math. 2014, 260, 482–493. [Google Scholar] [CrossRef]
  25. Franco, J.M.; Gomez, I. Some procedures for the construction of high-order exponentially fitted Runge-Kutta-Nyström Methods of explicit type. Comput. Phys. Commun. 2013, 184, 1310–1321. [Google Scholar] [CrossRef]
  26. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. On some new low storage implementations of time advancing Runge-Kutta Methods. J. Comput. Appl. Math. 2012, 236, 3665–3675. [Google Scholar] [CrossRef]
  27. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. Symmetric and symplectic exponentially fitted Runge-Kutta Methods of high order. Comput. Phys. Commun. 2010, 181, 2044–2056. [Google Scholar] [CrossRef]
  28. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. On high order symmetric and symplectic trigonometrically fitted Runge-Kutta Methods with an even number of stages. BIT Numer. Math. 2010, 50, 3–21. [Google Scholar] [CrossRef]
  29. Franco, J.M.; Gomez, I. Accuracy and linear Stability of RKN Methods for solving second-order stiff problems. Appl. Numer. Math. 2009, 59, 959–975. [Google Scholar] [CrossRef]
  30. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. Sixth-order symmetric and symplectic exponentially fitted Runge-Kutta Methods of the Gauss type. J. Comput. Appl. Math. 2009, 223, 387–398. [Google Scholar] [CrossRef]
  31. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. Structure preservation of exponentially fitted Runge-Kutta Methods. J. Comput. Appl. Math. 2008, 218, 421–434. [Google Scholar] [CrossRef]
  32. Calvo, M.; Franco, J.M.; Montijano, J.I.; Rández, L. Sixth-order symmetric and symplectic exponentially fitted modified Runge-Kutta Methods of Gauss type. Comput. Phys. Commun. 2008, 178, 732–744. [Google Scholar] [CrossRef]
  33. Franco, J.M. Exponentially fitted symplectic integrators of RKN type for solving oscillatory problems. Comput. Phys. Commun. 2007, 177, 479–492. [Google Scholar] [CrossRef]
  34. Franco, J.M. New Methods for oscillatory systems based on ARKN Methods. Appl. Numer. Math. 2006, 56, 1040–1053. [Google Scholar] [CrossRef]
  35. Franco, J.M. Runge-Kutta-Nyström Methods adapted to the numerical integration of perturbed oscillators. Comput. Phys. Commun. 2002, 147, 770–787. [Google Scholar] [CrossRef]
  36. Franco, J.M. Stability of explicit ARKN Methods for perturbed oscillators. J. Comput. Appl. Math. 2005, 173, 389–396. [Google Scholar] [CrossRef]
  37. Wu, X.Y.; You, X.; Li, J.Y. Note on derivation of order conditions for ARKN Methods for perturbed oscillators. Comput. Phys. Commun. 2009, 180, 1545–1549. [Google Scholar] [CrossRef]
  38. Tocino, A.; Vigo-Aguiar, J. Symplectic conditions for exponential fitting Runge-Kutta-Nyström Methods. Math. Comput. Model. 2005, 42, 873–876. [Google Scholar] [CrossRef]
  39. de Vyver, H.V. Comparison of some special optimized fourth-order Runge-Kutta Methods for the numerical solution of the Schrödinger equation. Comput. Phys. Commun. 2005, 166, 109–122. [Google Scholar] [CrossRef]
  40. de Vyver, H.V. Frequency evaluation for exponentially fitted Runge-Kutta Methods. J. Comput. Appl. Math. 2005, 184, 442–463. [Google Scholar] [CrossRef]
  41. Vigo-Aguiar, J.; Martín-Vaquero, J.; Ramos, H. Exponential fitting BDF-Runge-Kutta Algorithms. Comput. Phys. Commun. 2008, 178, 15–34. [Google Scholar] [CrossRef]
  42. Demba, M.A.; Senu, N.; Ramos, H.; Kumam, P.; Watthayu, W. A Phase– and Amplification–Fitted 5(4) Diagonally Implicit Runge–Kutta–Nyström Pair for Oscillatory Systems. Bull. Iran. Math. Soc. 2023, 49, 24. [Google Scholar] [CrossRef]
  43. Demba, M.A.; Ramos, H.; Watthayu, W.; Ahmed, I. A New Phase- and Amplification-Fitted Sixth-Order Explicit RKN Method to Solve Oscillating Systems. Thai J. Math. 2023, 21, 219–236. [Google Scholar]
  44. Monovasilis, T.; Kalogiratou, Z. High Order Two-Derivative Runge-Kutta Methods with Optimized Dispersion and Dissipation Error. Mathematics 2021, 9, 232. [Google Scholar] [CrossRef]
  45. Ahmad, N.A.; Senu, N.; Ibrahim, Z.B.; Othman, M.; Ismail, Z. Higher Order Three Derivative Runge–Kutta Method with Phase–Fitting and Amplification–Fitting Technique for Periodic IVPs. Malays. J. Math. Sci. 2020, 14, 403–418. [Google Scholar]
  46. Lee, K.; Alias, M.A.; Senu, N.; Ahmadian, A. On efficient frequency-dependent parameters of explicit two-derivative improved Runge-Kutta-Nystr|"rom method with application to two-body problem. Alex. Eng. J. 2023, 72, 605–620. [Google Scholar] [CrossRef]
  47. Chien, L.K.; Senu, N.; Ahmadian, A.; Ibrahim, S.N.I. Efficient Frequency-Dependent Coefficients of Explicit Improved Two-Derivative Runge-Kutta Type Methods for Solving Third- Order IVPs. Pertanika J. Sci. Technol. 2023, 31, 843–873. [Google Scholar] [CrossRef]
  48. Demba, M.A.; Ramos, H.; Kumam, P.; Watthayu, W.; Senu, N.; Ahmed, I. A trigonometrically adapted 6(4) explicit Runge-Kutta-Nyström pair to solve oscillating systems. Math. Methods Appl. Sci. 2023, 46, 560–578. [Google Scholar] [CrossRef]
  49. Chen, B.Z.; Zhai, W.J. Optimal three-stage implicit exponentially-fitted RKN methods for solving second-order ODEs. Calcolo 2022, 59, 14. [Google Scholar] [CrossRef]
  50. Senu, N.; Ahmad, N.A.; Othman, M.; Ibrahim, Z.B. Numerical study for periodical delay differential equations using Runge-Kutta with trigonometric interpolation. Comput. Appl. Math. 2022, 41, 25. [Google Scholar] [CrossRef]
  51. Zhai, W.J.; Fu, S.H.; Zhou, T.C.; Xiu, C. Exponentially-fitted and trigonometrically-fitted implicit RKN methods for solving y” = f (t, y). J. Appl. Math. Comput. 2022, 68, 1449–1466. [Google Scholar] [CrossRef]
  52. Senu, N.; Lee, K.C.; Ismail, W.F.W.; Ahmadian, A.; Ibrahim, S.N.I.; Laham, M. Improved Runge-Kutta Method with Trigonometrically-Fitting Technique for Solving Oscillatory Problem. Malays. J. Math. Sci. 2021, 15, 253–266. [Google Scholar]
  53. Fang, Y.L.; Yang, Y.P.; You, X. An explicit trigonometrically fitted Runge-Kutta method for stiff and oscillatory problems with two frequencies. Int. J. Comput. Math. 2020, 97, 85–94. [Google Scholar] [CrossRef]
  54. Dormand, J.R.; Prince, P.J. A family of embedded Runge-Kutta formulae. J. Comput. Appl. Math. 1980, 6, 19–26. [Google Scholar] [CrossRef]
  55. Franco, J.M. Runge-Kutta methods adapted to the numerical integration of oscillatory problems. Appl. Numer. Math. 2004, 50, 427–443. [Google Scholar] [CrossRef]
  56. Franco, J.M. A 5(3) pair of explicit ARKN methods for the numerical integration of perturbed oscillators. J. Comput. Appl. Math. 2003, 161, 283–293. [Google Scholar] [CrossRef]
  57. Kalogiratou, Z.; Monovasilis, T.; Psihoyios, G.; Simos, T.E. Runge–Kutta type methods with special properties for the numerical integration of ordinary differential equations. Phys. Rep. 2014, 536, 75–146. [Google Scholar] [CrossRef]
  58. Anastassi, Z.A.; Simos, T.E. Numerical multistep methods for the efficient solution of quantum mechanics and related problems. Phys. Rep. 2009, 482–483, 1–240. [Google Scholar] [CrossRef]
  59. Chawla, M.M.; Rao, P.S. A Noumerov-Type Method with Minimal Phase-Lag for the Integration of 2nd Order Periodic Initial-Value Problems. J. Comput. Appl. Math. 1984, 11, 277–281. [Google Scholar] [CrossRef]
  60. Simos, T.E.; Williams, P.S. A Finite Difference Method for the numerical solution of the Schrödinger equation. J. Comput. Appl. Math. 1997, 79, 189–205. [Google Scholar] [CrossRef]
  61. Thomas, R.M. Phase properties of high order, almost P-stable formulae. BIT Numer. Math. 1984, 24, 225–238. [Google Scholar] [CrossRef]
  62. Chawla, M.M.; Rao, P.S.; Neta, B. 2-Step 4Th-Order P-Stable Methods with Phase-Lag of Order 6 for Y′′ = F(T,Y). J. Comput. Appl. Math. 1986, 16, 233–236. [Google Scholar] [CrossRef]
  63. Chawla, M.M.; Rao, P.S. An Explicit 6Th-Order Method with Phase-Lag of Order 8 for Y′′ = F(T, Y). J. Comput. Appl. Math. 1987, 17, 365–368. [Google Scholar] [CrossRef]
  64. Coleman, J.P. Numerical-Methods for Y′′ = F(X,Y) Via Rational-Approximations for the Cosine. Ima J. Numer. Anal. 1989, 9, 145–165. [Google Scholar] [CrossRef]
  65. Coleman, J.P.; Ixaru, L.G. P-Stability and Exponential-Fitting Methods for Y′′ = F(X, Y). IMA J. Numer. Anal. 1996, 16, 179–199. [Google Scholar] [CrossRef]
  66. Coleman, J.P.; Duxbury, S.C. Mixed Collocation Methods for Y′′ = F(X,Y). J. Comput. Appl. Math. 2000, 126, 47–75. [Google Scholar] [CrossRef]
  67. Ixaru, L.G.; Berceanu, S. Coleman Method Maximally Adapted to the Schrödinger-Equation. Comput. Phys. Commun. 1987, 44, 11–20. [Google Scholar] [CrossRef]
  68. Ixaru, L.G.; Rizea, M. Numerov Method Maximally Adapted to the Schrödinger-Equation. J. Comput. Phys. 1987, 73, 306–324. [Google Scholar] [CrossRef]
  69. Ixaru, L.G.; Berghe, G.V.; Meyer, H.D.; Daele, M.V. Four-Step Exponential-Fitted Methods for Nonlinear Physical Problems. Comput. Phys. Commun. 1997, 100, 56–70. [Google Scholar] [CrossRef]
  70. Ixaru, L.G.; Rizea, M. Four Step Methods for Y′′ = F(X,Y). J. Comput. Appl. Math. 1997, 79, 87–99. [Google Scholar] [CrossRef]
  71. Daele, M.V.; Berghe, G.V.; Meyer, H.D.; Ixaru, L.G. Exponential-Fitted Four-Step Methods for Y′′ = F(X,Y). Int. J. Comput. Math. 1998, 66, 299–309. [Google Scholar] [CrossRef]
  72. Ixaru, L.G.; Paternoster, B. A Conditionally P-Stable Fourth-Order Exponential-Fitting Method for Y′′ = F(X, Y). J. Comput. Appl. Math. 1999, 106, 87–98. [Google Scholar] [CrossRef]
  73. Ixaru, L.G. Numerical operations on oscillatory functions. Comput. Chem. 2001, 25, 39–53. [Google Scholar] [CrossRef] [PubMed]
  74. Ixaru, L.G.; Berghe, G.V.; Meyer, H.D. Exponentially Fitted Variable Two-Step BDF Algorithm for First Order Odes. Comput. Phys. Commun. 2003, 150, 116–128. [Google Scholar] [CrossRef]
  75. Ixaru, L.G.; Rizea, M. Comparison of some four-Step Methods for the numerical solution of the Schrödinger equation. Comput. Phys. Commun. 1985, 38, 329–337. [Google Scholar] [CrossRef]
  76. Ixaru, L.G.; Rizea, M. A Numerov-like scheme for the numerical solution of the Schrödinger equation in the deep continuum spectrum of energies. Comput. Phys. Commun. 1980, 19, 23–27. [Google Scholar] [CrossRef]
  77. Chawla, M.M.; Rao, P.S. A Noumerov-type Method with minimal phase-lag for the integration of second order periodic initial-value problems II Explicit Method. J. Comput. Appl. Math. 1986, 15, 329–337. [Google Scholar] [CrossRef]
  78. Rizea, M. Exponential fitting Method for the time-dependent Schrödinger equation. J. Math. Chem. 2010, 48, 55–65. [Google Scholar] [CrossRef]
  79. Ixaru, L.G.; Rizea, M.; Berghe, G.V.; Meyer, H.D. Weights of the Exponential Fitting Multistep Algorithms for First-Order Odes. J. Comput. Appl. Math. 2001, 132, 83–93. [Google Scholar] [CrossRef]
  80. Raptis, A.D.; Cash, J.R. Exponential and Bessel Fitting Methods for the Numerical-Solution of the Schrödinger-Equation. Comput. Phys. Commun. 1987, 44, 95–103. [Google Scholar] [CrossRef]
  81. Raptis, A.D. Exponentially-Fitted Solutions of the Eigenvalue Shrödinger Equation with Automatic Error Control. Comput. Phys. Commun. 1983, 28, 427–431. [Google Scholar] [CrossRef]
  82. Raptis, A.D. 2-Step Methods for the Numerical-Solution of the Schrödinger-Equation. Comput. Phys. Commun. 1982, 28, 373–378. [Google Scholar] [CrossRef]
  83. Raptis, A.D. On the Numerical-Solution of the Schrödinger-Equation. Comput. Phys. Commun. 1981, 24, 1–4. [Google Scholar] [CrossRef]
  84. Raptis, A.D. Exponential-Fitting Methods for the Numerical-Integration of the 4Th-Order Differential-Equation Yiv + F·Y = G. Computing 1980, 24, 241–250. [Google Scholar] [CrossRef]
  85. Van Daele, M.; Van den Berghe, G. P-stable exponentially-fitted Obrechkoff Methods of arbitrary order for second-order differential equations. Numer. Algorithms 2007, 46, 333–350. [Google Scholar] [CrossRef]
  86. Fang, Y.; Wu, X. A Trigonometrically Fitted Explicit Numerov-Type Method for Second-Order Initial Value Problems with Oscillating Solutions. Appl. Numer. Math. 2008, 58, 341–351. [Google Scholar] [CrossRef]
  87. Berghe, G.V.; Daele, M.V. Exponentially-fitted Obrechkoff Methods for second-order differential equations. Appl. Numer. Math. 2009, 59, 815–829. [Google Scholar] [CrossRef]
  88. Hollevoet, D.; Daele, M.V.; Berghe, G.V. The Optimal Exponentially-Fitted Numerov Method for Solving Two-Point Boundary Value Problems. J. Comput. Appl. Math. 2009, 230, 260–269. [Google Scholar] [CrossRef]
  89. Franco, J.M.; Rández, L. Explicit exponentially fitted two-Step hybrid Methods of high order for second-order oscillatory IVPs. Appl. Math. Comput. 2016, 273, 493–505. [Google Scholar] [CrossRef]
  90. Franco, J.M.; Gomez, I.; Rández, L. Optimization of explicit two-Step hybrid Methods for solving orbital and oscillatory problems. Comput. Phys. Commun. 2014, 185, 2527–2537. [Google Scholar] [CrossRef]
  91. 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]
  92. Konguetsof, A. A generator of families of two-Step numerical Methods with free parameters and minimal phase-lag. J. Math. Chem. 2017, 55, 1808–1832. [Google Scholar] [CrossRef]
  93. Konguetsof, A. A hybrid Method with phase-lag and derivatives equal to zero for the numerical integration of the Schrödinger equation. J. Math. Chem. 2011, 49, 1330–1356. [Google Scholar] [CrossRef]
  94. de Vyver, H.V. A phase-fitted and amplification-fitted explicit two-Step hybrid Method for second-order periodic initial value problems. Int. J. Mod. Phys. 2006, 17, 663–675. [Google Scholar] [CrossRef]
  95. de Vyver, H.V. An explicit Numerov-type Method for second-order differential equations with oscillating solutions. Comput. Math. Appl. 2007, 53, 1339–1348. [Google Scholar] [CrossRef]
  96. Fang, Y.; Wu, X. A trigonometrically fitted explicit hybrid Method for the numerical integration of orbital problems. Appl. Math. Comput. 2007, 189, 178–185. [Google Scholar] [CrossRef]
  97. de Vyver, H.V. Phase-fitted and amplification-fitted two-Step hybrid Methods for y′′ = f (x, y). J. Comput. Appl. Math. 2007, 209, 33–53. [Google Scholar] [CrossRef]
  98. de Vyver, H.V. Efficient one-Step Methods for the Schrödinger equation. Match-Commun. Math. Comput. Chem. 2008, 60, 711–732. [Google Scholar]
  99. Martín-Vaquero, J.; Vigo-Aguiar, J. Exponential fitted Gauss, Radau and Lobatto Methods of low order. Numer. Algorithms 2008, 48, 327–346. [Google Scholar]
  100. Konguetsof, A. A new two-Step hybrid Method for the numerical solution of the Schrödinger equation. J. Math. Chem. 2010, 47, 871–890. [Google Scholar] [CrossRef]
  101. Fatheah, A. Hendi, P-Stable Higher Derivative Methods with Minimal Phase-Lag for Solving Second Order Differential Equations. J. Appl. Math. 2011, 2011, 407151. [Google Scholar]
  102. Wang, Z.; Zhao, D.; Dai, Y.; Wu, D. An improved trigonometrically fitted P-stable Obrechkoff Method for periodic initial-value problems. Proc. R. Soc. Math. Phys. Eng. Sci. 2005, 461, 1639–1658. [Google Scholar] [CrossRef]
  103. Daele, M.V.; Berghe, G.V.; Meyer, H.D. Properties and Implementation of R-Adams Methods Based On Mixed-Type Interpolation. Comput. Math. Appl. 1995, 30, 37–54. [Google Scholar] [CrossRef]
  104. Wang, Z. Trigonometrically-fitted Method with the Fourier frequency spectrum for undamped Duffing equation. Comput. Phys. Commun. 2006, 174, 109–118. [Google Scholar] [CrossRef]
  105. Wang, Z. Trigonometrically-fitted Method for a periodic initial value problem with two frequencies. Comput. Phys. Commun. 2006, 175, 241–249. [Google Scholar] [CrossRef]
  106. Tang, C.; Yan, H.; Zhang, H.; Li, W. The various order explicit multistep exponential fitting for systems of ordinary differential equations. J. Comput. Appl. Math. 2004, 169, 171–182. [Google Scholar] [CrossRef]
  107. Tang, C.; Yan, H.; Zhang, H.; Chen, Z.; Liu, M.; Zhang, G. The arbitrary order implicit multistep schemes of exponential fitting and their applications. J. Comput. Appl. Math. 2005, 173, 155–168. [Google Scholar] [CrossRef]
  108. Coleman, J.P.; Ixaru, L.G. Truncation Errors in exponential fitting for oscillatory problems. Siam J. Numer. Anal. 2006, 44, 1441–1465. [Google Scholar] [CrossRef]
  109. Paternoster, B. Present state-of-the-art in exponential fitting. A contribution dedicated to Liviu Ixaru on his 70th birthday. Comput. Phys. Commun. 2012, 183, 2499–2512. [Google Scholar] [CrossRef]
  110. Wang, C.; Wang, Z. A P-stable eighteenth-order six-Step Method for periodic initial value problems. Int. J. Mod. Phys. 2007, 18, 419–431. [Google Scholar] [CrossRef]
  111. Wang, Z. Obrechkoff one-Step Method fitted with Fourier spectrum for undamped Duffing equation. Comput. Phys. Commun. 2006, 175, 692–699. [Google Scholar] [CrossRef]
  112. Raptis, A.D.; Simos, T.E. A four-step phase-fitted method for the numerical integration of second order initial-value problems. BIT Numer. Math. 1991, 31, 160–168. [Google Scholar] [CrossRef]
  113. Shokri, A.; Khalsaraei, M.M. A new family of explicit linear two-step singularly P-stable Obrechkoff methods for the numerical solution of second-order IVPs. Appl. Math. Comput. 2020, 376, 125116. [Google Scholar] [CrossRef]
  114. Abdulganiy, R.I.; Ramos, H.; Okunuga, S.A.; Majid, Z.A. A trigonometrically fitted intra-step block Falkner method for the direct integration of second-order delay differential equations with oscillatory solutions. Afr. Mat. 2023, 34, 36. [Google Scholar] [CrossRef]
  115. Salih, M.M.; Ismail, F. Trigonometrically-Fitted Fifth Order Four-Step Predictor-Corrector Method for Solving Linear Ordinary Differential Equations with Oscillatory Solutions. Malays. J. Math. Sci. 2022, 16, 739–748. [Google Scholar] [CrossRef]
  116. Godwin, O.J.; Adewale, O.S.; Otuwatomi, O.P. An efficient block solver of trigonometrically fitted method for stiff odes. Adv. Differ. Equ. Control Process. 2022, 28, 73–98. [Google Scholar] [CrossRef]
  117. Lee, K.C.; Senu, N.; Ahmadian, A.; Ibrahim, S.N.I. High-order exponentially fitted and trigonometrically fitted explicit two-derivative Runge-Kutta-type methods for solving third-order oscillatory problems. Math. Sci. 2022, 16, 281–297. [Google Scholar] [CrossRef]
  118. Obaidat, S.; Butt, R. A new implicit symmetric method of sixth algebraic order with vanished phase-lag and its first derivative for solving Schrodinger’s equation. Open Math. 2021, 19, 225–237. [Google Scholar] [CrossRef]
  119. Shokri, A.; Neta, B.; Khalsaraei, M.M.; Rashidi, M.M.; Mohammad-Sedighi, H. A Singularly P-Stable Multi-Derivative Predictor Method for the Numerical Solution of Second-Order Ordinary Differential Equations. Mathematics 2021, 9, 806. [Google Scholar] [CrossRef]
  120. Fang, Y.L.; Huang, T.; You, X.; Zheng, J.; Wang, B. Two-frequency trigonometrically-fitted and symmetric linear multi-step methods for second-order oscillators. J. Comput. Appl. Math. 2021, 392, 113312. [Google Scholar] [CrossRef]
  121. Chun, C.; Neta, B. Trigonometrically-Fitted Methods: A Review. Mathematics 2019, 7, 1197. [Google Scholar] [CrossRef]
  122. Stiefel, E.; Bettis, D.G. Stabilization of Cowell’s method. Numer. Math. 1969, 13, 154–175. [Google Scholar] [CrossRef]
  123. Erwin Fehlberg, Classical Fifth-, Sixth-, Seventh-, and Eighth-Order Runge-Kutta Formulas with Stepsize Control. NASA Technical Report 287. 1968. Available online: https://ntrs.nasa.gov/api/citations/19680027281/downloads/19680027281.pdf (accessed on 3 February 2024).
  124. Cash, J.R.; Karp, A.H. A variable order Runge–Kutta method for initial value problems with rapidly varying right-hand sides. ACM Trans. Math. Softw. 1990, 16, 201–222. [Google Scholar] [CrossRef]
  125. Franco, J.; Gómez, I.; Rández, L. Four-stage symplectic and P–stable SDIRKN methods with dispersion of high order. Numer. Algorithms 2001, 26, 347–363. [Google Scholar] [CrossRef]
  126. Franco, J.M.; Palacios, M. High-order P-stable multistep methods. J. Comput. Appl. Math. 1990, 30, 1–10. [Google Scholar] [CrossRef]
  127. Simos, T.E. New Open Modified Newton Cotes Type Formulae as Multilayer Symplectic Integrators. Appl. Math. Model. 2013, 37, 1983–1991. [Google Scholar] [CrossRef]
  128. Petzold, L.R. An efficient numerical method for highly oscillatory ordinary differential equations. SIAM J. Numer. Anal. 1981, 18, 455–479. [Google Scholar] [CrossRef]
  129. Ramos, H.; Vigo-Aguiar, J. On the frequency choice in trigonometrically fitted methods. Appl. Math. Lett. 2010, 23, 1378–1381. [Google Scholar] [CrossRef]
  130. Ixaru, L.G.; Berghe, G.V.; Meyer, H.D. Frequency evaluation in exponential fitting multistep algorithms for ODEs. J. Comput. Appl. Math. 2002, 140, 423–434. [Google Scholar] [CrossRef]
  131. Boyce, W.E.; DiPrima, R.C.; Meade, D.B. Elementary Differential Equations and Boundary Value Problems, 11th ed.; John Wiley & Sons: Hoboken, NJ, USA, 2017. [Google Scholar]
  132. Evans, L.C. Partial Differential Equations, 2nd ed.American Mathematical Society: Providence, RI, USA, 2010; Chapter 3; pp. 91–135. [Google Scholar]
Figure 1. Stability region for the classical third-order Adams–Bashforth method (Method I).
Figure 1. Stability region for the classical third-order Adams–Bashforth method (Method I).
Mathematics 12 00504 g001
Figure 2. Stability region for the amplification-fitted Adams–Bashforth method (Method II).
Figure 2. Stability region for the amplification-fitted Adams–Bashforth method (Method II).
Mathematics 12 00504 g002
Figure 3. Stability region for the amplification-fitted Adams–Bashforth method (Method III).
Figure 3. Stability region for the amplification-fitted Adams–Bashforth method (Method III).
Mathematics 12 00504 g003
Figure 4. Stability region for the amplification-fitted Adams–Bashforth method (Method IV).
Figure 4. Stability region for the amplification-fitted Adams–Bashforth method (Method IV).
Mathematics 12 00504 g004
Figure 5. Stability region for the phase-fitted and amplification-fitted Adams–Bashforth method (Method V).
Figure 5. Stability region for the phase-fitted and amplification-fitted Adams–Bashforth method (Method V).
Mathematics 12 00504 g005
Figure 6. Numerical results for the problem of Stiefel and Bettis [122].
Figure 6. Numerical results for the problem of Stiefel and Bettis [122].
Mathematics 12 00504 g006
Figure 7. Numerical results for the problem of Franco et al. [125].
Figure 7. Numerical results for the problem of Franco et al. [125].
Mathematics 12 00504 g007
Figure 8. Numerical results for the problem of Franco and Palacios [126].
Figure 8. Numerical results for the problem of Franco and Palacios [126].
Mathematics 12 00504 g008
Figure 9. Numerical results for the nonlinear orbital problem of [127].
Figure 9. Numerical results for the nonlinear orbital problem of [127].
Mathematics 12 00504 g009
Figure 10. Numerical results for the nonlinear problem of [128].
Figure 10. Numerical results for the nonlinear problem of [128].
Mathematics 12 00504 g010
Figure 11. Numerical results for two-body gravitational problem (Kepler’s plane problem).
Figure 11. Numerical results for two-body gravitational problem (Kepler’s plane problem).
Mathematics 12 00504 g011
Figure 12. Numerical results for perturbed two-body gravitational problem (perturbed Kepler’s problem) with μ = 0.1 .
Figure 12. Numerical results for perturbed two-body gravitational problem (perturbed Kepler’s problem) with μ = 0.1 .
Mathematics 12 00504 g012
Figure 13. Numerical results for perturbed two-body gravitational problem (perturbed Kepler’s problem) with μ = 0.4 .
Figure 13. Numerical results for perturbed two-body gravitational problem (perturbed Kepler’s problem) with μ = 0.4 .
Mathematics 12 00504 g013
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Simos, T.E. A New Methodology for the Development of Efficient Multistep Methods for First-Order IVPs with Oscillating Solutions. Mathematics 2024, 12, 504. https://doi.org/10.3390/math12040504

AMA Style

Simos TE. A New Methodology for the Development of Efficient Multistep Methods for First-Order IVPs with Oscillating Solutions. Mathematics. 2024; 12(4):504. https://doi.org/10.3390/math12040504

Chicago/Turabian Style

Simos, Theodore E. 2024. "A New Methodology for the Development of Efficient Multistep Methods for First-Order IVPs with Oscillating Solutions" Mathematics 12, no. 4: 504. https://doi.org/10.3390/math12040504

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