Volume 2023, Issue 1 4144552
Research Article
Open Access

Numerical Solutions of Duffing Van der Pol Equations on the Basis of Hybrid Functions

M. Mohammadi

M. Mohammadi

Department of Mathematics, South Tehran Branch, Islamic Azad University, Tehran, Iran iau-ahar.ac.ir

Search for more papers by this author
A. R. Vahidi

Corresponding Author

A. R. Vahidi

Department of Mathematics, Yadegar-e-Emam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Tehran, Iran iau-ahar.ac.ir

Search for more papers by this author
T. Damercheli

T. Damercheli

Department of Mathematics, Yadegar-e-Emam Khomeini (RAH) Shahr-e-Rey Branch, Islamic Azad University, Tehran, Iran iau-ahar.ac.ir

Search for more papers by this author
S. Khezerloo

S. Khezerloo

Department of Mathematics, South Tehran Branch, Islamic Azad University, Tehran, Iran iau-ahar.ac.ir

Search for more papers by this author
First published: 06 June 2023
Citations: 2
Academic Editor: Ivan Giorgio

Abstract

In the present work, a new approximated method for solving the nonlinear Duffing-Van der Pol (D-VdP) oscillator equation is suggested. The approximate solution of this equation is introduced with two separate techniques. First, we convert nonlinear D-VdP equation to a nonlinear Volterra integral equation of the second kind (VIESK) using integration, and then, we approximate it with the hybrid Legendre polynomials and block-pulse function (HLBPFs). The next technique is to convert this equation into a system of ordinary differential equation of the first order (SODE) and solve it according to the proposed approximate method. The main goal of the presented technique is to transform these problems into a nonlinear system of algebraic equations using the operational matrix obtained from the integration, which can be solved by a proper numerical method; thus, the solution procedures are either reduced or simplified accordingly. The benefit of the hybrid functions is that they can be adjusted for different values of n and m, in addition to being capable of yield greater correct numerical answers than the piecewise constant orthogonal function, for the results of integral equations. Resolved governance equation using the Runge-Kutta fourth order algorithm with the stepping time 0.01 s via numerical solution. The approximate results obtained from the proposed method show that this method is effective. The evaluation has been proven that the proposed technique is in good agreement with the numerical results of other methods.

1. Introduction

The nonlinear differential equations become the most important topic in various scientific problems that arise in the field of engineering and physics that can be represented by nonlinear ordinary differential equation such as oscillator equations. Oscillators are found in most of the electronic systems, which provide an important limiting cycle of the mathematical model. For example, phenomena arise in all fields of the natural and engineering sciences [1, 2] and in many physical problems [3, 4]. In recent studies, extensive studies have focused on the concept capable of damping harmful vibrations in environmental energy, which are generated or induced by mechanical machinery, vehicles, wind, and so on. These vibrations can be harvested and turned to useful electrical energy like [57]. Numerous studies have been dedicated to the exploitation of various vibratory energy harvesting systems, for instance, He et al. [8] have shown vibration alleviation and energy harvesting in a dynamical system of a spring pendulum, Tien and Dsouza [9] investigated a theoretical model of a piecewise-linear nonlinear vibration harvester, Shorakaei et al. [10] studied the nonlinear vibration energy harvesting from a magneto-electro-elastic plate. Based on the aim of this article, we consider the mathematical of unforced D-VdP oscillator equation as follows:
(1)
where dots denote time derivative; α and γ are two positive coefficients. Usually, getting exact solutions by the analytical methods for these systems, even if the exact solutions exist, seems to be difficult. Hence, it needs of numerical techniques for approximate solutions. Some of these numerical methods applied by various researchers include the following: Haar wavelet [11], Adomian decomposition method [12], successive linearisation method [13], iterative method [14], restarted Adomian decomposition method [15], variational iteration method [16], parameter expansion method [17], the chaotic motions [18], and block multistep method [19]. Numerical integration is a particularly effective and multipurpose technique in solving the solution to arbitrary nonlinear differential equations. We will solve Equation (1) in two ways using the HLBPF method. In the first way, we convert Equation (1) to a VIESK using integration and then approximate it with the proposed technique. In the next way, we transform Equation (1) into a SODE and then solve it with the proposed method. The main feature of this method is to convert this problem to a system of algebraic equations which, using the operational matrix obtained from the integration, simplifies complex calculations. When the integration operation is eliminated using the resulting operational matrix, there are several methods of approximation, such as the block-pulse function [20], modified block-pulse function [21], HLBPF method [22], Bernoulli polynomials [23], and many other methods. In this article, since the D-VdP equations do not have an exact solution, we first solved all the examples with the Runge-Kutta of the fourth order method (RK4), which uses 0.01 s time step, and consider the answers obtained from the RK4 as the exact solution, and then, we do a comparative study between methods such as Adomian’s decomposition method (ADM), homotopy perturbation method (HPM) [24], and the presented method in this article. Now, we get the absolute error of method’s ADM and HPM as well as the proposed technique with the RK4 method, which in some cases, these are more efficient than the presented method.

The present article is divided into the following sections: in Section 2, the D-VdP oscillator equation will be described. In Section 3, HLBPFs and operational matrix are reviewed. Our proposed method for solving D-VdP is studied in Section 4. In Section 5, the HPM is described for solving this equation. In Section 6, an error analysis for the suggested methods is presented. Then, Section 7 presents numerical results. Finally, conclusion is described in Section 8.

2. The Duffing-Van der Pol Oscillator Equation

In this section, we describe the D-VdP oscillator equation. This equation is a self-maintained electrical circuit. Consider the general hybrid Rayleigh-Duffing-Van der Pol oscillator equation as follows [25].
(2)
where a1, a2, a3, a4, λ, and γ are constants. Equation (2) contains several well-known oscillator equations. For a2 = a3 = γ = 0, Equation (2) becomes the Rayleigh oscillator [26]. Whena2 = γ = 0, this equation reduces to the Rayleigh-Van der Pol oscillator, and whena1 = a2 = 0, it transforms into the famous Duffing-Van der Pol oscillator equation. An interesting feature of the hybrid oscillator is that depending on the relation among the values, it assumes comparable behavior to the Van der Pol oscillator or Duffing oscillator. Suppose an oscillator of mass m and stiffness coefficient k is moving under the influence of damping force, and b is the damping coefficient, which is usually considered a constant number, all of which are connected in series as indicated (Figure 1).
Details are in the caption following the image
Damping mechanical oscillator.
We consider the damping force on the oscillator as a function of the oscillator velocity. In this case, the equation of motion of the oscillator will be as follows:
(3)
where k is the linear stiffness term and k3 is the nonlinear stiffness term. If we consider the damping coefficient as a function of the oscillator place as b(1 − y2), in other words, as the oscillator moves, damping force on the oscillator changes, and then, the oscillator motion equation will be as follows:
(4)
where and . By substituting τ = ω0t, we can get that
(5)
Now, we will substitute by using the move equation:
(6)
Therefore, we get to a D-VdP oscillator equation
(7)
where α = b/mω0 and .

3. Some Properties of Hybrid Functions

In this section, some properties of hybrid functions are recalled.

3.1. Hybrid Legendre Polynomials and Block-Pulse Function

Hybrid functions, bij(t), i = 1, ⋯, n and j = 0, ⋯, m − 1, possess three arguments; i and j denote the order of BPFs and Legendre polynomials, respectively, and t is cited to the normalized time that is defined on [0, Tf) as [27].
(8)
where Pj(t) denotes the Legendre polynomials of order j that is satisfied in the following relation:
(9)
And on the interval [0, 1), a set of BPFs bi(t), i = 1, ⋯n is given as the following [20].
(10)

The BPFs on [0, 1) interval are disjoint; that is, for i, j = 1, ⋯, n, we have bi(t)bj(t) = δijbi(t). Furthermore, one of the properties of these functions on interval [0, 1) is orthogonality. The set of hybrid functions bij(t) is taken as a complete orthogonal system in L2[0, 1), since bij(t) are a combination of BPFs and Legendre polynomials; each of them is orthogonal and complete.

3.2. Approximating a Function

The expansion of function f, that is square integrable over the interval [0, 1), can be given as the following [28]:
(11)
where
(12)
(13)
where
(14)
In Equation (11), the hybrid coefficients are given by cij = <f(t), bij(t) > /<bij(t), bij(t) > , i = 1, ⋯, n, j = 0, ⋯, m − 1, and <..> denotes an inner product. In addition, the function k(s, t) ∈ L2([0, 1) × [0, 1)) can be approximated as
(15)
where K = (kij) is an mn × mn matrix
(16)

3.3. The Operational Matrix of Integration

The integration of the vector B(t) given by Equation (13) can be approximated using the following equation:
(17)
where P is the mn × mn operational matrix used for integration, which is shown as follows [28].
(18)
where E and S are m × m matrices as the following:
(19)

3.4. The Product Operational Matrix of the HLBPFs

Additionally, the property of a couple of hybrid function vectors will be used, which is presented as the following [29]. Let us consider
(20)
where C and B(t) are given in Equations (12) and (13), respectively. Also, is a m × m product operational matrix as
(21)
In Equation (21), 0 denotes a m × m-dimensional zero matrix, and are m × m matrices that are influenced by m. We consider that n = 2 and m = 8, and then, in Equation (20) can be determined by
(22)
where are an array of 8 × 8 matrices as the following
(23)

4. The HLBPFs for Solving Duffing-Van der Pol

4.1. Converting Duffing-Van der Pol Equation to a Volterra Integral Equation of the Second Kind

of second order
(24)
where y(t0) and y(t0) are known. For this present, we converted Equation (24) into nonlinear VIESK, and now that Equation (24) based on t from t0 to t is integrated, we have
(25)
Again, Equation (25) would be integrated based on t from t0 to t so that
(26)
and then, we have
(27)
Finally, we obtain the VIE2 as follows:
(28)
so that
(29)
where gγ(s, t) ∈ L2([0, 1) × [0, 1)) and q, yL2([0, 1)). y(t) is an unknown function, and q(t), gγ(s, t) are known functions that can be expanded into hybrid functions as follows [30].
(30)
where Y is an unknown nm-vector, Q is a known nm-vector, and Gγ is a known nm × nm-dimensional matrix. We consider computing Yγ in terms of Y, which is Yγ is the nm-vectors whose elements are nonlinear combination of the elements of the vector Y. Now, substituting Equation (30) into Equation (27), we have
(31)
By using Equations (17) and (20), we get
(32)
For making approximations for y(t), by collocating the system of Equation (32) at the point ti = (2i − 1)/2nm, i = 1, 2, ⋯, nm and using Equation (14), we obtain
(33)
and by solving the obtained nonlinear system of algebraic equations by numerical method for example Newton’s method, obviously, the unknown vector Y can be obtained by solving Equation (33).

4.1.1. Evaluating Yγ

We need to evaluate Yγ so that each element is a nonlinear combination of the components of vector Y. From Equation (20) and y(t)≅YTB(t), we have [31]
(34)
where is a nm-row vector. Then, for (y(s))3, we get
(35)
As a result, through this approach, we can approximate (y(s))γ for arbitrary γ. Suppose that this technique holds for γ − 1 where (y(t))γ−1 = Yγ−1B(t), we can get it for γ as shown in the following:
(36)

So, the component of Yγ can be calculated in terms of the component of the unknown vector Y.

4.2. Converting Duffing-Van der Pol Equation to a System of Ordinary Differential Equation of the First Order

In this section, considering Equation (24), we convert this equation into a SODE, and we put w1 = y(t), w2 = y(t), and w2 = y′′(t). Substituting w1, w2, and w2 into Equation (23), this leads
(37)
with the initial conditions
(38)
In order to solve Equation (37) with HLBPFs, by expanding w2(0), in terms of hybrid functions, it gives
(39)
Let
(40)
where C can be obtained similar to Equation (12). Integrating of Equation (40) from 0 to t and using Equation (39), we have
(41)
(42)
where HT = ATP and P are the operational matrix of integration given in Equation (17). By substituting Equations (40)–(42) in Equation (37), we obtain
(43)
and using Equation (20) gives
(44)
(45)
where Equation (45) is a nonlinear system of algebraic equation which can be solved by Newton’s method.

5. Homotopy Perturbation Method

In this section, the HPM is described for the solution of nonlinear differential equations, and this method can be extensively used to solve different nonlinear problems [3234]. To that end, assume
(46)
where N is a general differential operator. A homotopy H(y(t), p) can be defined as
(47)
where F(y(t)) is the functional operator with known solution y0 that can be easily achieved, and L(y(t)) = N(y(t)). Usually, a convex homotopy is selected by
(48)
and continuously trace an implicitly defined curve from a starting point H(y0(t), 0) to a solution function H(Y(t), 1), where Y is a solution of Equation (46). The embedding parameter p is applied as the classical perturbation technique, and it can be assumed that the solution of Equation (46) can be given through a power series in p,
(49)
and setting p = 1 gives in the approximate solution of Equation (46) as
(50)

5.1. The HPM for Solving Duffing-Van der Pol

In this part, we look at the D-VdP equation and use HPM to solve it. For this purpose, as a result (Equation (24)), we put d2/dt2 by κ and κ−1 as the two integral from 0 to t. Therefore, we have
(51)
which is converted to the following equation after applying κ−1:
(52)
where p is the constant of integration and satisfies Lp = 0. As a possible solution, we consider the convex homotopy
(53)
(54)
By substituting Equations (53) and (54) into Equation (48), we get
(55)
Rewriting Equation (55) as
(56)
And using the initial condition y(t0) = β0, y(t0) = β1 in Equation (24), we have
(57)
By substituting Equation (49) into Equation (57) and by assimilating terms with equal powers of p, we obtain
(58)
Lastly, the approximate solution of Equation (24) is computed as
(59)

6. Error Analysis

In this section, we calculate the error bound of the presented method for the approximate solution D-VdP equation in Section 4. When we convert the D-VdP equation to a SODE, we refer the readers to the error bound that is calculated in [22], and we get an error bound for the approximate solutions of nonlinear VIESK which implies the convergence of the present method in Section 4, and we have the following theorems. Suppose that Ω = ⋃1≤inΩi where Ωi = [(i − 1)/n, i/n).

Theorem 1. Suppose that yCm[0, 1] is an m times continuous function and |y(m)(t)| ≤ λ, such that , where yi is the restriction of to Ωi and Ei = span{bi0(t), bi1(t), ⋯, bi(m − 1)(t)}, i = 1, 2, ⋯, n. If is the best approximation of yi(t) from Ei, where , then approximates y(t) with the following error bound

(60)

Proof. Let . Assume that P(m − 1)i for i = 1, 2, ⋯, n, are the interpolating polynomials to yi at points tj, j = 0, 1, ⋯, m − 1 that implies the zeros of m-degree-shifted Chebyshev polynomials in the interval [(i − 1)/n, i/n). Then, we have [35]

(61)

The following equation is obtained by considering the estimates for Chebyshev interpolation nodes [36]. Therefore, we obtain

(62)

Since is the best approximation of yi from Ei and P(m − 1)iEi, we obtain

(63)

Now,

(64)

The following equation is obtained by calculating the square root of both sides and through replacing CTB by ,

(65)

Theorem 2. Assume that is the hybrid expansion of function k with the real value expressed by Equation (15) and k is adequately smooth on every single subdomain [(i − 1)/n, i/n) × [(j − 1)/n, j/n), i, j = 1, 2, ⋯, n, and then, there is a positive constant γ as shown in the following

(66)

Proof. Suppose that , where kij is the restriction of k to [(i − 1)/n, i/n) × [(j − 1)/n, j/n). For i, j = 1, 2, ⋯, n assume that P(m − 1)ij is the interpolating polynomial to kij at points (sr, tl), where sr, tl, r, l = 0, 1, 2, ⋯, m − 1 implies the zeros of m-degree-shifted Chebyshev polynomials in [(i − 1)/n, i/n), [(j − 1)/n, j/n) intervals, respectively, and then, we have [35]

(67)

Now, suppose that γ = max{γ1, γ2, γ3}, in which

(68)

Then, the equation mentioned in the following is obtained by considering the estimates for Chebyshev interpolation nodes [36].

(69)

Since is the best unique approximation of kij from Ei × Ej, we obtain

(70)

Now,

(71)

The following equation is obtained by calculating the square roots and replacing BTKB, by . Then, we have

(72)

Lemma 3 (Gronwall Inequality). Let e(t), a(t), and b(t) be real continuous functions defined on Ω, for fixed t0Ω. If

(73)
then
(74)
where .

Proof. In [37].

The following discrete Gronwall lemma can be found in [38].

Lemma 4. Assume that {kj}, j ≥ 0 is a given nonnegative sequence, and the sequence {εn} satisfies ε0ρ0 and

(75)
with ρ0 ≥ 0, qj ≥ 0(j ≥ 0). Then
(76)

Now, consider the nonlinear integral equation (Equation (27)) or under the following assumptions:

  • (1)

    q and g satisfy the hypotheses of Theorems 1 and 2, respectively, and ,

  • (2)

    C1 = sup|H(s)| < ∞

  • (3)

    C2 = sup|Hς(s)| < ∞

  • (4)

    C3 = sup|g(s, t)| < ∞

Theorem 5. Suppose y and are, respectively, the exact and approximate solutions of Equation (27) obtained by Section 4. Suppose also that the assumption (1-4) is fulfilled. Then, there exist positive constants ζ and ϱ such that

(77)

Proof. From Equation (28), we have

(78)

The above equation can be rewritten in the following form:

(79)

By using the mean value theorem, the following result is concluded

(80)
where . Suppose that
(81)

Since 0 ≤ t < 1, by taking L2-norm in Equation (66) and applying the error bounds obtained in Theorems 1 and 2, we get

(82)
where ζ = λ + C13γ. Now let
(83)
considering the above equation, together with Equations (80) and (81), we have
(84)
where ϱ = C2C3. Now, let fix the values n and m, and then, for 1 ≤ i < n, we can define
(85)

From Equation (84), we have that for any tΩi = [(i − 1)/n, i/n),

(86)
The above equation can be rewritten as
(87)

Let tΩ1 = [0, 1/n), and then, the inequality (Equation (87)) reduces to

(88)

It follows from Gronwall Inequality in Lemma 3 that

(89)

Therefore, we get

(90)
where ϑ = 1 + ϱ/nexp(ϱ/n). Let us assume that tΩi, and then, the inequality (Equation (87)) can be rewritten as
(91)
where
(92)

By using the Gronwall inequality for tΩ, we obtain

(93)

Therefore, . Now, taking L2-norm in Equation (92), we obtain

(94)
which results
(95)

Now, a suitable application of Lemma 4 to Equation (95) yields

(96)

Since, , regarding the disjointness of ei for i = 1, 2, ⋯, n, we obtain

(97)

By taking the square root of both sides, we get

(98)

Finally, considering the error bound of ‖I2 obtained in Equation (82) and substituting ϑ with ϑ = 1 + (ϱ/n)exp(ϱ/n), we get

(99)

It is obvious that error bound tends to zero as n and m tend to infinity.

7. Numerical Examples

In this section, the HLBPFs are applied with n = 2, m = 8, and Tf = 1.00001 for all examples. As a result, the methodology suggested in Section 4 is used to find the approximate solution directly. In these examples, the approximate results given by presented method, HPM, and ADM are compared to the numerical solution obtained from RK4. In all cases, the results are presented in Tables 13. Based on these results, we see that the results of the HLBPFs are closer to the numerical solutions obtained using RK4. All experiments are implemented using MATLAB.

Example 7.1. Take the following unforced Van der Pol equation into consideration [39, 40].

(100)

The approximate analytical solution of Equation (100) is obtained by method’s RK4, HPM, and ADM.

Table 1. Numerical result for Example 7.1.
t Approximate solution (RK4) Absolute error
|RK4-ADM| |RK4-HPM| |RK4-VIESK| |RK4-SODE|
0 0.200000 0 0 2.88 × 10−10 1.13×10-11
0.1 0.198569 1.36 × 10−12 3.98 × 10−9 1.42 × 10−8 3.92 × 10-12
0.2 0.194322 1.90 × 10−12 7.68 × 10−8 3.61 × 10−8 2.99 × 10-12
0.3 0.187362 1.33 × 10−10 4.63 × 10−7 3.18 × 10−7 6.64 × 10-12
0.4 0.177826 1.53 × 10−9 1.67 × 10−6 1.22 × 106 1.24 × 10-11
0.5 0.165889 1.06 × 10−8 4.51 × 10−6 3.41 × 10−6 1.93 × 10-11
0.6 0.151756 5.34 × 10−8 1.00 × 10−5 7.76 × 10−6 1.99 × 10-11
0.7 0.135662 2.15 × 10−7 1.94 × 10−5 1.53 × 10−5 2.42 × 10-11
0.8 0.117866 7.33 × 10−7 3.37 × 10−5 2.68 × 10−5 2.90 × 10(-11)
0.9 0.098649 2.19 × 10−6 5.35 × 10−5 4.32 × 105 3.44 × 10−11
1.0 0.078307 5.90 × 10−6 7.86 × 10−5 6.45 × 10−5 3.84 × 10−11
Table 2. Numerical result for Example 7.2.
t Approximate solution (RK4) Absolute error
|RK4-ADM| |RK4-HPM| |RK4-VIESK| |RK4-SODE|
0 -0.288680 0 0 2.63 × 10−10 1.13 × 10−11
0.1 -0.277018 1.13 × 10−7 3.05 × 10−5 3.99 × 10−6 3.04 × 10−12
0.2 -0.265993 8.40 × 10−6 4.87 × 10−5 2.76 × 10−5 8.79 × 10−13
0.3 -0.255551 1.11 × 10−4 1.11 × 10−4 8.37 × 10−5 1.21 × 10−12
0.4 -0.245646 7.23 × 10−4 6.97 × 10−4 1.80 × 10−4 4.04 × 10−12
0.5 -0.236235 3.20 × 10−3 2.06 × 10−3 3.19 × 10−4 6.73 × 10−12
0.6 -0.227283 1.11 × 10−2 4.67 × 10−3 5.03 × 10−4 2.81 × 10−12
0.7 -0.218756 3.25 × 10−2 9.16 × 10−3 7.30 × 10−4 1.99 × 10−12
0.8 -0.210624 8.41 × 10−2 1.64 × 10−2 9.96 × 10−4 2.25 × 10−12
0.9 -0.202863 1.98 × 10−1 2.74 × 10−2 1.30 × 10−3 2.54 × 10−12
1.0 -0.195446 4.32 × 10−1 4.37 × 10−2 1.63 × 10−3 2.19 × 10−12
Table 3. Numerical result for Example 7.3.
t Approximate solution (RK4) Absolute error
|RK4-ADM| |RK4-HPM| |RK4-VIESK| |RK4-SODE|
0 0.000000 0 0 1.18 × 10−10 8.80 × 10−12
0.1 0.050042 4.18 × 10−12 1.54 × 10−9 6.04 × 10−7 6.04 × 10−12
0.2 0.099832 8.39 × 10−12 5.37 × 10−8 2.66 × 10−6 8.03 × 10−12
0.3 0.148870 1.25 × 10−11 4.36 × 10−7 9.80 × 10−6 1.22 × 10−11
0.4 0.196656 1.64 × 10−11 1.94 × 10−6 2.76 × 10−5 1.80 × 10−11
0.5 0.242704 1.99 × 10−11 6.15 × 10−6 6.38 × 10−5 2.35 × 10−11
0.6 0.286537 2.26 × 10−11 1.57 × 10−5 1.26 × 10−4 2.07 × 10−11
0.7 0.327703 1.90 × 10−11 3.42 × 10−5 2.22 × 10−4 2.64 × 10−11
0.8 0.365772 3.88 × 10−11 6.63 × 10−5 3.58 × 10−4 2.64 × 10−11
0.9 0.400343 4.51 × 10−10 1.17 × 10−4 5.39 × 10−4 2.72 × 10−11
1.0 0.431051 2.67 × 10−9 1.90 × 10−4 7.68 × 10−4 2.80 × 10-11
Now, we converted Equation (100) into nonlinear VIESK, by integrating of this equation in order to have
(101)
We solve above-mentioned equation using the present method, as well as we converted Equation (100) into a SODE that gives
(102)
where w1 = y and w2 = y. Again, we solve Equation (102) with the present method. Now, according to Subsection 5.1, we solve Equation (100) with HPM, and we have
(103)
Based on Equation (59), the approximate answer is obtained as follows:
(104)

Table 1 can be used to compare the results of the absolute errors of methods with RK4. Figure 2 shows the approximate answers obtained by HLBPFs for Equations (101) and (102) with RK4.

Example 7.2. In this example, the famous Duffing-Van der Pol equation is included like the following [41, 42].

(105)
where α = −0.28868 and β = 0.12. The approximate analytical solution of Equation (105) is obtained by method’s RK4, HPM, and ADM.

Details are in the caption following the image
The comparison results by HLBPF method with RK4 for Example 7.1.
Now, we converted Equation (105) into nonlinear VIESK, by integrating the both sides in order to have
(106)
We solve above-mentioned equation using the present method, as well as we converted Equation (105) into a SODE that gives
(107)
where w1 = y and w2 = y. Again, we solve Equation (107) with the present method. According to Subsection 5.1, we solve Equation (105) with HPM that gives
(108)
according to Equation (59), the approximate answer is obtained as follows:
(109)

Table 2 can be used to compare the results of the absolute errors of methods with RK4. Figure 3 shows the approximate answers obtained by HLBPFs for Equations (106) and (107) with RK4.

Example 7.3. Let us solve the following oscillator equation [11, 4345].

(110)

The approximate analytical solution of Equation (110) is obtained by method’s RK4, HPM, and ADM.

Details are in the caption following the image
The comparison results by HLBPFs method with RK4 for (Example 7.2).
Now, we converted Equation (110) into nonlinear VIESK, by integrating of this equation in order to have
(111)
We solve above-mentioned equation using the present method, as well as we converted Equation (110) into a SODE that gives
(112)
where w1 = y and w2 = y. Again, we solve Equation (112) with the present method. According to Subsection 5.1, we solve Equation (110) with HPM, and we have
(113)
According to Equation (59), the approximate answer is obtained as follows:
(114)

Table 3 can be used to compare the results of the absolute errors of methods with RK4. Figure 4 shows the approximate answers obtained by HLBPFs for Equations (111) and (112) with RK4.

Details are in the caption following the image
The comparison results by HLBPF method with RK4 for (Example 7.3).

8. Conclusions

In this work, we solved the D-VdP problem by transformation into a Volterra integral equation of the second kind and a system of ordinary differential equation of the first order. It was found that the numerical solution of these equations is using the expansion based on HLBPFs and their integration operational matrix. In this technique, integration is not needed because examples are solved quickly, and calculation time is minimized by employing the matrices P and . The advantage of our proposed method is its high accuracy when the D-VdP equation converted to a SODE.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Authors’ Contributions

All authors contributed to the study’s conception.

Data Availability

No data were used to support this study.

    The full text of this article hosted at iucr.org is unavailable due to technical difficulties.