Volume 3, Issue 6 e1189
RESEARCH ARTICLE
Full Access

Approximate solution of the electrostatic nanocantilever model via optimal perturbation iteration method

Waleed Adel

Corresponding Author

Waleed Adel

Department of Mathematics and Engineering Physics, Faculty of Engineering, Mansoura University, Mansoura, Egypt

Correspondence Waleed Adel, Department of Mathematics and Engineering Physics, Faculty of Engineering, Mansoura University, Mansoura, Egypt.

Email: [email protected]

Search for more papers by this author
Sinan Deniz

Sinan Deniz

Department of Mathematics, Manisa Celal Bayar University, Manisa, Turkey

Search for more papers by this author
First published: 24 August 2021
Citations: 1

Abstract

In this article, a new technique is used to solve the nonlinear boundary value problem of a cantilever-type nanoelectromechanical system. The technique is called the optimal perturbation iteration method and it is used to solve the problem in the form of a nonlinear differential equation with negative power-law nonlinearity. A convergence and error estimation of the proposed method is presented proving that the method is convergent. Results for the application of the proposed technique are demonstrated through two examples and the tables and figures prove that the method is efficient and straightforward.

1 INTRODUCTION

The beam-type electrostatic actuator system has become one the most important system that can be used as an essential component in designing a micro-electromechanical system known as MEMS model and nanoelectromechanical system known as NEMS model.1 This beam is constructed from a conductive electrode suspended over a conductive substrate. When a voltage difference is noticed between the two electrodes, the upper movable electrode deflects toward the lower one. When this voltage reaches its critical value this upper electrode becomes unstable and pulls on the substrate. Voltage and deflection are some of the parameters that take the name pull-in parameters for the actuators in this situation. The behaviors of the MEMS actuators have been studied over the years to better understand their dynamics. Some brief illustrations for this issue can be found in References 2, 3. The intermolecular and quantum forces were neglected in these studies based on a physical scale. With the development of the use of nanotechnology and the extent of their use in different areas of science, an extensive ongoing search from researchers around the world is being conducted to understand more their performance. If the separation between two molecules is less than 20 nm, then it will be considered as intermolecular Van der Waals attraction.4-6 On the other hand, if the separation between is more than 20 nm, the force between the two surfaces can have the name of the quantum Camier effect.7-11 A mathematical model of this problem can be described in the following form
d 4 ζ d x 4 = α K 1 ζ ( x ) K + β 1 ζ ( x ) 2 + γ 1 ζ ( x ) ()
with boundary conditions
ζ ( 0 ) = ζ ( 0 ) = ζ ( 1 ) = ζ ( 1 ) = 0 ; 0 < x < 1 . ()

Over the past few years, there have been some considerable studies for acquiring the solution for the model (37) of this problem. However, very few works are found for solving it. For example, Duan et al.12 used a modified version of the adomian method called the Duan Rach adomian decomposition method for solving the problem. In Reference 12, the problem is converted in a Fredholm–Volterra integral equation and then this converted system is solved using the modified adomian method. Also, in Reference 13 the homotopy perturbation method is applied for solving this model. An approximation for the effect of different parameters of the Casimir force on the instability of electrostatic nanocantilevers is discussed in Reference 14. Due to the lack of works on solving this problem, the motivation of this article arises.

Homotopy perturbation method (HAM) and the optimal perturbation iteration method (OPIM) gained increasing interest recently with their ability to provide accurate solutions to different forms of similar problems. The method and other related techniques have been tested multiple times on models with application in science, engineering, biology, and other related applied fields. For instance, this method has been adapted for solving the Jeffery–Hamel flow problem which has great application in fluid mechanics.15 Also, the approximate solution for the squeezing flow between two plates is investigated using the same methods. Other important models including system of nonlinear coupled differential equations occurring in the phenomenon of fluid,16, 17 nonconservative dynamical system of a rotating electrical machine,18 strongly nonlinear equation,19-21 delay differential equation,22 nonlinear heat transfer equations,23 Lane-Emden-type equations,24, 25 Fisher's equations,26 Bratu-type problems,27 generalized regularized long wave equations,28 Burgers's equation,29 modified Boussinesq-Burger equations,30 coupled Drinfel'd-Sokolov-Wilson equation,31 and Klein-Gordon equations.32 Other models that have been solved using this method can be found in References 33-37 and references therein.

In this article, we are interested in investigating the effect of different parameters for solving the modem problem and their approximate solution. The organization of the article is as follows: Section 2 introduces the main steps of the OPIA method for solving the model (37). In Section 3 a detailed convergence analysis for the proposed technique is presented along with an error estimation for the solution. In Section 4, results for solving model (37) with the OPIA method are demonstrated through tables and figures proving the effectiveness of the method. Finally, Section 5 gives a conclusion of the study.

2 OPTIMAL PERTURBATION ITERATION METHOD

In this section, we shall provide the main steps for the optimal homotopy method. First, considering Equation (37), one can rewrite the main problem in a closed form as:
F ζ ( 4 ) , ζ , ε = 0 , ()
where ζ = ζ ( x ) and ε is the perturbation parameter. The optimal perturbation iteration algorithms (OPIAs) can be obtained by using the idea of perturbation theory and Taylor's theorem. One can take the approximate solution with one correction term from straightforward perturbation expansion as
ζ n + 1 = ζ n + ε ζ c n , ()
where n N 0 and ζ c n is the nth correction term of the iteration algorithm. Upon substitution of (4) into (3) then expanding it in a Taylor series with nth derivatives yields the OPIA-n s. Taking only first derivatives from the Taylor's expansion, we have OPIA-1 as
F + F ζ ( ζ c ) n ε + F ζ ( 4 ) ( ζ c ( 4 ) ) n ε + F ε ε = 0 , ()
where subscripts of F denotes partial differentiation and all derivatives and functions are computed at ε = 0 . We can reformulate the above algorithm as follows:
ζ c ( 4 ) n + F ζ F ζ ( 4 ) ζ c n = F ε + F ε F ζ ( 4 ) . ()
An initial function ζ 0 satisfying the prescribed condition(s) must be selected to obtain the first correction term from the following algorithm:
ζ c ( 4 ) 0 + F ζ F ζ ( 4 ) ζ c 0 = F ε + F ε F ζ ( 4 ) . ()
One can use the above equation to get the approximate results in the desired limits. To start the iteration procedure, a first trial function ζ 0 is selected appropriately according to the prescribed conditions. The first correction term ( ζ c ) 0 can be computed from the algorithms (36) by using u 0 and given condition(s). Then the first approximate solution ζ 1 is obtained by using ( ζ c ) 0 and so on. To get better and more effective approximations, we propose a new approach to these algorithms. Based on the idea of HAM,38-40 we insert a convergence-control parameters P 0 , P 1 , P 2 , into Equation (4) and then construct new components, defined by
ζ 1 ( x ; P 0 ) = ζ 0 + P 0 ζ c 0 , ζ 2 ( x ; P 1 ) = ζ 1 + P 1 ζ c 1 , ζ m ( x ; P m 1 ) = ζ m 1 + P m 1 ζ c m 1 . ()
In order to obtain the optimum values of these paramters, we make use of the similar strategy mentioned by Marinca et al.41 where the method of least squares or collocation techniques are used. Substituting the approximate solution ζ m into Equation (3), we will get the following residual:
R ( x , P 0 , , P m 1 ) = F ( ζ m ) ( 4 ) , ζ m . ()
It is clear that, when R ( x , P 0 , , P m 1 ) = 0 then the approximation ζ m is the exact solution of the problems. Generally such case will not arise for nonlinear equations, but one can minimize the functional
J ( P 0 , , P m 1 ) = a b R 2 ( x , P 0 , , P m 1 ) d x , ()
where a and b are elected from the domain of the problem. Optimum values of P 0 , P 1 , can be optimally defined from the conditions J P 0 = J P 1 = = J P m 1 . OPIM has been applied to many types of nonlinear equation. Some of them can be seen in References 42-46

3 CONVERGENCE ANALYSIS AND ERROR ESTIMATE

In this section, we will investigate the convergence of the proposed optimal perturbation iteration technique with the aid of some theorems. New approximate solution obtained by OPIM are considered as follows:
D 0 = ζ 0 , D n + 1 = P n ζ c n . ()
Correspondingly, other OPIM solutions can be determined as:
ζ 0 = D 0 , ζ 1 = ζ 0 + P 0 ζ c 0 = D 0 + D 1 , ζ 2 = ζ 1 + P 1 ζ c 1 = D 0 + D 1 + D 2 , ζ 3 = ζ 2 + P 2 ζ c 2 = D 0 + D 1 + D 2 + D 3 , ζ n + 1 = ζ n + P n ζ c n = D 0 + D 1 + D 2 + + D n + 1 = i = 0 n + 1 D i . ()
Therefore, one can represent the approximate solution of the problem as:
ζ ( x ) = lim n ζ n + 1 ( x ) = i = 0 D i . ()

Theorem 1.Let us assume that B denotes a Banach space and

A : B B ()
is a nonlinear mapping and also we suppose that
A y A y β y y , y , y B , ()
for 0 < β < 1 , where β is some constant. Then, the mapping A has a unique fixed point. Additionally, the following sequence
ζ n + 1 = A ζ n , ()
with an arbitrary selection of ζ 0 B , converges to the fixed point of the mapping A and
ζ r ζ s ζ 1 ζ 0 j = s 1 r 2 β j . ()

Banach fixed point theorem may be used to derive the following theorem.

Theorem 2.Let B represents a Banach space designated with an appropriate norm . over which the series i = 0 D i is defined and let us assume that the initial mapping ζ 0 = D 0 falls inside the ball of the exact solution ζ ( x ) . So, the solution i = 0 D i converges if there is a β such that

D n + 1 β D n , ()
where 0 < β < 1 .

Proof.To prove the above theorem, let us first define a sequence as:

A 0 = D 0 , A 1 = D 0 + D 1 , A 2 = D 0 + D 1 + D 2 , A n = D 0 + D 1 + D 2 + + D n . ()

We must show that A n n = 0 is a Cauchy sequence in B. In order to achieve that, we consider

A n + 1 A n = ζ n + 1 β ζ n β 2 ζ n 1 β n + 1 D 0 . ()

For every n , k N , n k , we have

A n A k = A n A n 1 + A n 1 A n 2 + + A k + 1 A k A n A n 1 + A n 1 A n 2 + + A k + 1 A k β n D 0 + β n 1 D 0 + + β k + 1 D 0 = 1 β n k 1 β β k + 1 D 0 . ()

Since it is known that 0 < β < 1 , one can easily get from (21)

lim n , k A n A k = 0 . ()

Finally, A n n = 0 is a Cauchy sequence in B and this implies that the series solution (12) is convergent. This completes the proof.

Theorem 3.If ζ 0 = D 0 falls inside the ball of the solution ζ ( x ) , then A n = i = 0 n D i remains inside that ball, too.

Proof.Assume that

D 0 B r ( ζ ) , ()
where
B r ( ζ ) = D A ζ D < r ()
is the ball of D ( x ) . From the hypothesis ζ = lim n A n = i = 0 D i and using Theorem 2, we get
ζ A n β n + 1 D 0 < D 0 < r , ()
where β ( 0 , 1 ) and n N .

Theorem 4.Let us now suppose that i = 0 D i , that is, the approximate OPIM solution, is convergent to the desired solution ζ ( x ) . If the truncated series i = 0 k D i is utilized as an approximation to the (3), we obtain

E k ( x ) β k + 1 1 β D 0 , ()
where the E k is the maximum error.

Proof.By using Equation (21), one can get

A n A k 1 β n k 1 β β k + 1 D 0 ()
for n k . By knowing
ζ ( x ) = lim n A n ( x ) = i = 0 D i ()
one can write
ζ ( x ) i = 0 k D i 1 β n k 1 β β k + 1 D 0 ()
and also it can be rewritten as
E k ( x ) = ζ ( x ) i = 0 k D i β k + 1 1 β D 0 ()
since 1 β n k < 1 . Here β is chosen as β = max β i , i = 0 , 1 , , n where
β i = D n + 1 D n . ()

4 NUMERICAL EXPERIMENTS

In this section, we try to find new approximate solutions to modified equation by using perturbation algorithms through two illustrative examples. Firstly, Equation (37) with perturbation parameter can be written as :
F ζ ( 4 ) , ζ , ε = ζ ( 4 ) ε α K 1 ζ ( x ) K ε β 1 ζ ( x ) 2 γ 1 ζ ( x ) . ()
Taking the approximate solutions as
ζ n + 1 = ζ n + ε ζ c n ()
and putting it into the algorithm
F + F ζ ( ζ c ) n ε + F ζ ( 4 ) ( ζ c ( 4 ) ) n ε + F ε ε = 0 ()
one can get
ζ c ( 4 ) 0 + F ζ F ζ ( 4 ) ζ c 0 = F ε + F ε F ζ ( 4 ) ()
or explicitly
ζ c ( 4 ) 0 K ( 1 ζ ) K 1 γ ( 1 ζ ) 2 + 2 β ( 1 ζ ) 3 = α K 1 ζ ( x ) K β 1 ζ ( x ) 2 γ 1 ζ ( x ) ()
by setting ε = 1 after computations. In order to see the efficiency of the proposed technique, one can start to iterations with an initial function which satisfies the boundary conditions.

Experiment 1

In the lights of above settings, let us consider
d 4 ζ d x 4 = α K 1 ζ ( x ) K + β 1 ζ ( x ) 2 + γ 1 ζ ( x ) ()
with boundary conditions
ζ ( 0 ) = ζ ( 0 ) = ζ ( 1 ) = ζ ( 1 ) = 0 ; 0 < x < 1 . ()
In order to initialize the iterations, one needs to choose the initial function which must satisfy the following conditions
ζ ( 0 ) = ζ ( 0 ) = ζ ( 1 ) = ζ ( 1 ) = 0 ()
such as
ζ ( x ) = 1 24 x 4 4 x 3 + 6 x 2 .
Therefore, the first-order approximate solution will be in the following form:
ζ 1 = P 0 24 x 4 β x 4 γ + 24 x 2 c 3 + 24 x 3 c 4 x 4 α K . ()
With the solution (40) and proceeding as in Section 3, second-order approximate solution can be obtained as:
ζ 2 = ζ 1 + 143 P 1 K 3072 × β 2 c 4 x 11 95040 + β γ c 4 x 11 95040 + K α K β 2 c 3 x 10 60480 + β γ c 3 x 10 60480 β c 3 c 4 x 9 1512 β c 3 2 x 8 1680 + 1 840 γ c 4 K α K x 7 + 1 180 β c 3 x 6 + 1 360 γ c 3 x 6 K α K β 3 x 12 6842880 K β 2 γ x 12 3421440 β 2 x 12 α K 855360 β 3 x 16 α K 150958080 β γ 2 x 12 6842880 K β 2 x 8 20160 β γ x 8 13440 γ 2 x 8 40320 β x 4 24 K γ x 4 24 β 4 x 20 α K 38578913280 β 2 γ x 16 α K 50319360 β γ 2 x 16 α K 50319360 β 3 γ x 20 α K 9644728320 7 K β γ x 12 α K 3421440 γ 2 x 12 α K 1140480 β x 8 α K 6720 γ x 8 α K 8064 + x 4 α K 24 β γ α K 3 x 20 3214909440 β γ 2 α K 2 x 20 3214909440 β 2 γ α K 2 x 20 3214909440 β 2 α K 3 x 20 6429818880 γ 2 α K 3 x 20 6429818880 β α K 4 x 20 9644728320 β 3 α K 2 x 20 9644728320 γ 3 α K 2 x 20 9644728320 α K 5 x 20 38578913280 + β c 3 α K 3 x 18 84602880 + c 3 α K 4 x 18 253808640 + c 4 α K 4 x 19 321490944 + β c 4 α K 3 x 19 107163648 + γ c 3 α K 3 x 18 84602880 γ α K 4 x 20 9644728320 + β γ c 4 α K 2 x 19 53581824 + γ c 4 α K 3 x 19 107163648 + β 2 c 4 α K 2 x 19 107163648 + γ 2 c 4 α K 2 x 19 107163648 + . ()
ζ 3 = ζ 2 + 8053 P 2 x 4 × β 2 c 3 K 2 α K 2 x 18 84602880 + γ 2 c 3 α K 2 x 18 84602880 + K ( K + 1 ) β γ c 3 α K 2 x 18 42301440 β c 4 2 α K 2 x 18 3525120 γ c 4 2 α K 2 x 18 3525120 c 4 2 α K 3 x 18 7050240 + K ( K + 2 ) c 4 3 α K 2 x 17 342720 β c 3 c 4 α K 2 x 17 1370880 γ c 3 c 4 α K 2 x 17 1370880 c 3 c 4 α K 3 x 17 2741760 + c 3 c 4 2 α K 2 x 16 87360 c 4 4 α K x 16 43680 β c 3 2 α K 2 x 16 2096640 γ c 3 2 α K 2 x 16 2096640 c 3 2 α K 3 x 16 4193280 β γ α K 2 x 16 25159680 β α K 3 x 16 50319360 γ α K 3 x 16 50319360 β 2 α K 2 x 16 50319360 γ 2 α K 2 x 16 50319360 α K 4 x 16 150958080 + c 4 α K 3 x 15 1572480 + c 3 2 c 4 α K 2 x 15 65520 + K ( K + 1 ) β c 4 α K 2 x 15 786240 + γ c 4 α K 2 x 15 786240 + c 3 c 4 3 α K x 15 8190 + c 3 α K 3 x 14 1153152 + K 3 c 3 3 α K 2 x 14 144144 + β γ c 4 x 19 α K 2 53581824 + γ 2 c 4 x 19 α K 2 107163648 β c 3 α K 2 x 14 576576 + γ c 3 α K 2 x 14 576576 c 4 2 α K 2 x 14 48048 c 3 c 4 α K 2 x 13 17160 c 3 2 α K 2 x 12 23760 γ α K 2 x 12 570240 α K 3 x 12 1140480 13 β α K 2 x 12 6842880 + c 4 α K 2 x 11 15840 + c 3 α K 2 x 10 10080 α K 2 x 8 10080 β 2 c 3 c 4 x 17 α K 2741760 β γ c 3 c 4 x 17 α K 1370880 β c 3 c 4 x 13 α K 17160 γ c 3 c 4 x 13 α K 17160 + ()

and so on. It should be mentioned that integration constants c 3 , c 4 in the first-order solution can be obtained by using the other boundary conditions. For instance, the values for the third-order OPIM approximations are c 3 = 0 . 50338 , c 4 = 1 . 08906 . By using these values and proceeding as in Section 2, one can get desired approximate OPIM solutions. Optimal values of convergence parameters are given in Tables 1 and 2. For different values and parameters, absolute errors between the numerical and analytical results can be seen in Tables 3–6. From Figures 1 and 2, one can see the absolute residual errors of third- and fourth-order OPIM approximations for β = 0 . 25 , β = 0 . 35 , and β = 0 . 45 where K = 3 , γ = 0 . 6 , α K = 0 . 2 . From those results, one can conclude that the more we iterate, the better results we have.

Details are in the caption following the image
Absolute residual errors of third-order OPIM approximation for β = 0 . 25 ( ), β = 0 . 35 ( ), and β = 0 . 45 ( ) where K = 3 , γ = 0 . 6 , α K = 0 . 2
Details are in the caption following the image
Absolute residual errors of fourth-order OPIM approximation for β = 0 . 25 ( ), β = 0 . 35 ( ), and β = 0 . 45 ( ) where K = 3 , γ = 0 . 6 , α K = 0 . 2
TABLE 1. OPIM constants for different values of parameters for third-order solutions
K = 3 , α K = 0 . 2 , β = 0 . 6 , γ = 0 . 25 K = 3 , α K = 0 . 25 , β = 0 . 8 , γ = 0 . 3
P 0 1.023617 2.55214
P 1 4.063215 1 . 30215
P 2 3 . 90588 0 . 83694
TABLE 2. OPIM constants for different values of parameters for fourth-order solutions and for K = 3
α K = 0 . 2 , β = 0 . 6 , γ = 0 . 25 α K = 0 . 2 , β = 0 . 5 , γ = 0 . 25 α K = 0 . 3 , β = 0 . 4 , γ = 0 . 25
P 0 1.33844 0.40283 0 . 05638
P 1 1.50447 1.08827 1.50842
P 2 0 . 99063 1 . 70244 0 . 80478
P 3 1.04727 0.80228 1.77014
TABLE 3. Absolute residual errors of the third-order OPIM solutions for K = 3 and β = 0 . 55
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 3 . 445 × 10 5 3 . 945 × 10 5 7 . 116 × 10 6 6 . 551 × 10 6
0.2 1 . 378 × 10 3 3 . 156 × 10 4 7 . 112 × 10 5 1 . 288 × 10 5
0.3 3 . 101 × 10 3 1 . 065 × 10 3 3 . 601 × 10 4 1 . 350 × 10 4
0.4 5 . 512 × 10 3 2 . 525 × 10 3 1 . 138 × 10 3 5 . 691 × 10 4
0.5 8 . 613 × 10 3 4 . 931 × 10 3 2 . 778 × 10 3 1 . 737 × 10 4
0.6 1 . 240 × 10 2 8 . 522 × 10 3 5 . 761 × 10 3 4 . 321 × 10 4
0.7 1 . 688 × 10 2 1 . 353 × 10 2 1 . 067 × 10 2 9 . 340 × 10 4
0.8 2 . 205 × 10 2 2 . 020 × 10 2 1 . 821 × 10 2 1 . 821 × 10 3
0.9 2 . 791 × 10 2 2 . 876 × 10 2 2 . 916 × 10 2 3 . 281 × 10 3
1.0 3 . 445 × 10 2 3 . 945 × 10 2 4 . 445 × 10 2 5 . 557 × 10 3
TABLE 4. Absolute residual errors of the third-order OPIM solutions for K = 3 and β = 0 . 75
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 3 . 106 × 10 6 8 . 054 × 10 7 4 . 111 × 10 6 9 . 777 × 10 6
0.2 5 . 741 × 10 4 4 . 208 × 10 5 1 . 044 × 10 6 9 . 011 × 10 6
0.3 1 . 937 × 10 3 2 . 130 × 10 4 3 . 086 × 10 5 1 . 006 × 10 5
0.4 4 . 593 × 10 3 6 . 733 × 10 4 1 . 301 × 10 4 1 . 770 × 10 5
0.5 8 . 969 × 10 3 1 . 644 × 10 3 3 . 969 × 10 4 6 . 753 × 10 5
0.6 1 . 550 × 10 2 3 . 408 × 10 3 9 . 876 × 10 4 2 . 017 × 10 4
0.7 2 . 461 × 10 2 6 . 315 × 10 3 2 . 135 × 10 3 5 . 085 × 10 4
0.8 3 . 674 × 10 2 1 . 077 × 10 2 4 . 162 × 10 3 1 . 133 × 10 3
0.9 5 . 231 × 10 2 1 . 726 × 10 2 7 . 499 × 10 3 2 . 297 × 10 3
1.0 7 . 176 × 10 2 2 . 631 × 10 2 1 . 270 × 10 2 4 . 322 × 10 3
TABLE 5. Absolute residual errors of the third-order OPIM solutions for K = 4 and β = 0 . 25
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 1 . 057 × 10 7 5 . 201 × 10 6 1 . 991 × 10 6 1 . 044 × 10 6
0.2 7 . 991 × 10 6 9 . 111 × 10 6 7 . 771 × 10 6 9 . 012 × 10 6
0.3 6 . 806 × 10 4 3 . 897 × 10 6 1 . 271 × 10 5 3 . 241 × 10 5
0.4 1 . 613 × 10 3 3 . 955 × 10 7 5 . 355 × 10 5 1 . 821 × 10 4
0.5 3 . 151 × 10 3 2 . 947 × 10 4 1 . 634 × 10 4 6 . 945 × 10 4
0.6 5 . 445 × 10 3 1 . 521 × 10 3 4 . 066 × 10 4 2 . 074 × 10 3
0.7 8 . 646 × 10 3 6 . 089 × 10 3 8 . 789 × 10 4 5 . 229 × 10 3
0.8 1 . 291 × 10 2 2 . 025 × 10 2 1 . 714 × 10 3 1 . 165 × 10 2
0.9 1 . 838 × 10 2 5 . 846 × 10 2 3 . 088 × 10 3 2 . 362 × 10 2
1.0 2 . 521 × 10 2 1 . 509 × 10 1 5 . 229 × 10 3 4 . 445 × 10 2
TABLE 6. Absolute residual errors of the third-order OPIM solutions for K = 4 and β = 0 . 45
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 2 . 362 × 10 4 1 . 525 × 10 4 4 . 673 × 10 3 3 . 357 × 10 4
0.2 6 . 047 × 10 3 1 . 952 × 10 3 2 . 991 × 10 3 4 . 297 × 10 3
0.3 5 . 499 × 10 3 3 . 336 × 10 3 3 . 407 × 10 3 7 . 341 × 10 4
0.5 1 . 142 × 10 3 1 . 204 × 10 4 7 . 354 × 10 4 2 . 626 × 10 4
0.6 4 . 911 × 10 3 4 . 314 × 10 4 2 . 196 × 10 3 9 . 408 × 10 4
0.7 1 . 685 × 10 3 3 . 232 × 10 4 1 . 234 × 10 3 7 . 048 × 10 3
0.9 1 . 259 × 10 3 7 . 370 × 10 3 2 . 501 × 10 3 1 . 608 × 10 3
1.0 2 . 924 × 10 3 1 . 541 × 10 3 4 . 707 × 10 3 3 . 361 × 10 3

Experiment 2

Next, let us now consider the main equation represented in Equation (37) with the new setting of boundary conditions in the form
ζ ( 0 ) = 1 , ζ ( 0 ) = ζ ( 1 ) = ζ ( 1 ) = 0 , ()
with the initial function can be chosen as
ζ ( x ) = 1 24 + 6 x 2 4 x 3 + x 4 ,
which is suitable for the conditions
ζ ( 0 ) = 1 , ζ ( 0 ) = ζ ( 1 ) = ζ ( 1 ) = 0 . ()

By doing the similar computations as in the previous example, one can reach the desired approximations. Optimal values of convergence parameters are given in Tables 7 and 8. For different values and parameters, absolute errors between the numerical and analytical results can be seen in Tables 9–12. From Figures 1 and 2, one can see the absolute residual errors of third- and fourth-order OPIM approximations for β = 0 . 25 , β = 0 . 35 , and β = 0 . 45 where K = 3 , γ = 0 . 6 , α K = 0 . 2 . We can get better solutions by taking more terms from the iterations.

TABLE 7. Experiment 2: OPIM constants for different values of parameters for third-order solutions
K = 3 , α K = 0 . 35 , β = 0 . 75 , γ = 0 . 45 K = 3 , α K = 0 . 3 , β = 0 . 8 , γ = 0 . 35
P 0 0.80563 1.800963
P 1 2.00963 0 . 990532
P 2 2 . 056381 1.020116
TABLE 8. Experiment 2: OPIM constants for different values of parameters for fourth-order solutions and for K = 3
α K = 0 . 35 , β = 0 . 75 , γ = 0 . 35 α K = 0 . 4 , β = 0 . 65 , γ = 0 . 25 α K = 0 . 3 , β = 0 . 4 , γ = 0 . 25
P 0 2.00124 1.10458 0.00238
P 1 0.83775 2.04580 3.77455
P 2 0 . 39688 0.004528 5 . 01445
P 3 2.11057 1.048891 6.05895
TABLE 9. Experiment 2: Absolute residual errors of the third-order OPIM solutions for K = 3 and β = 0 . 55
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 8 . 8733 × 1 0 4 1 . 9616 × 1 0 2 2 . 9424 × 1 0 2 3 . 9232 × 1 0 1
0.2 1 . 4907 × 1 0 3 4 . 6314 × 1 0 3 6 . 9471 × 1 0 3 9 . 2628 × 1 0 2
0.3 1 . 7042 × 1 0 3 1 . 8686 × 1 0 3 2 . 8029 × 1 0 3 3 . 7372 × 1 0 2
0.4 1 . 3982 × 1 0 3 9 . 1129 × 1 0 4 1 . 3669 × 1 0 3 1 . 8226 × 1 0 2
0.5 4 . 1926 × 1 0 4 4 . 7638 × 1 0 4 7 . 1457 × 1 0 4 9 . 5277 × 1 0 3
0.6 1 . 4096 × 1 0 3 2 . 4736 × 1 0 4 3 . 7105 × 1 0 4 4 . 9473 × 1 0 3
0.7 4 . 2888 × 1 0 3 1 . 1584 × 1 0 4 1 . 7375 × 1 0 4 2 . 3167 × 1 0 3
0.8 8 . 4424 × 1 0 3 3 . 6569 × 1 0 5 5 . 4854 × 1 0 5 7 . 3138 × 1 0 4
0.9 1 . 4118 × 1 0 2 1 . 2007 × 1 0 5 1 . 8011 × 1 0 5 2 . 4014 × 1 0 4
1.0 2 . 1585 × 1 0 2 4 . 1215 × 1 0 5 6 . 1823 × 1 0 5 8 . 243 × 1 0 4
TABLE 10. Experiment 2: Absolute residual errors of the third-order OPIM solutions for K = 3 and β = 0 . 75
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 1 . 5795 × 1 0 3 3 . 5902 × 1 0 2 2 . 8404 × 1 0 2 5 . 0017 × 1 0 1
0.2 2 . 6534 × 1 0 3 8 . 4766 × 1 0 3 6 . 7063 × 1 0 3 1 . 1809 × 1 0 1
0.3 3 . 0335 × 1 0 3 3 . 42 × 1 0 3 2 . 7057 × 1 0 3 4 . 7645 × 1 0 2
0.4 2 . 4888 × 1 0 3 1 . 6679 × 1 0 3 1 . 3195 × 1 0 3 2 . 3236 × 1 0 2
0.5 7 . 4627 × 1 0 4 8 . 719 × 1 0 4 6 . 898 × 1 0 4 1 . 2147 × 1 0 2
0.6 2 . 509 × 1 0 3 4 . 5274 × 1 0 4 3 . 5818 × 1 0 4 6 . 3073 × 1 0 3
0.7 7 . 6341 × 1 0 3 2 . 1201 × 1 0 4 1 . 6773 × 1 0 4 2 . 9536 × 1 0 3
0.8 1 . 5028 × 1 0 2 6 . 6931 × 1 0 5 5 . 2952 × 1 0 5 9 . 3244 × 1 0 4
0.9 2 . 513 × 1 0 2 2 . 1976 × 1 0 5 1 . 7386 × 1 0 5 3 . 0616 × 1 0 4
1.0 3 . 8422 × 1 0 2 7 . 5434 × 1 0 5 5 . 9679 × 1 0 5 1 . 0509 × 1 0 3
TABLE 11. Experiment 2: Absolute residual errors of the third-order OPIM solutions for K = 4 and β = 0 . 25
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 8 . 547 × 1 0 5 2 . 9232 × 1 0 3 3 . 143 × 1 0 3 5 . 9396 × 1 0 2
0.2 1 . 4359 × 1 0 4 6 . 9017 × 1 0 4 7 . 4207 × 1 0 4 1 . 4024 × 1 0 2
0.3 1 . 6415 × 1 0 4 2 . 7846 × 1 0 4 2 . 9939 × 1 0 4 5 . 6579 × 1 0 3
0.4 1 . 3468 × 1 0 4 1 . 358 × 1 0 4 1 . 4601 × 1 0 4 2 . 7593 × 1 0 3
0.5 4 . 0384 × 1 0 5 7 . 0991 × 1 0 5 7 . 6328 × 1 0 5 1 . 4424 × 1 0 3
0.6 1 . 3577 × 1 0 4 3 . 6862 × 1 0 5 3 . 9634 × 1 0 5 7 . 49 × 1 0 4
0.7 4 . 1311 × 1 0 4 1 . 7262 × 1 0 5 1 . 856 × 1 0 5 3 . 5074 × 1 0 4
0.8 8 . 1319 × 1 0 4 5 . 4495 × 1 0 6 5 . 8593 × 1 0 6 1 . 1073 × 1 0 4
0.9 1 . 3598 × 1 0 3 1 . 7893 × 1 0 6 1 . 9238 × 1 0 6 3 . 6357 × 1 0 5
1.0 2 . 0791 × 1 0 3 6 . 1419 × 1 0 6 6 . 6037 × 1 0 6 1 . 248 × 1 0 4
TABLE 12. Experiment 2: Absolute residual errors of the third-order OPIM solutions for K = 4 and β = 0 . 45
x α K = 0 . 2 , γ = 0 . 2 α K = 0 . 25 , γ = 0 . 25 α K = 0 . 3 , γ = 0 . 2 α K = 0 . 2 , γ = 0 . 3
0.1 1 . 4483 × 1 0 6 1 . 8686 × 1 0 3 9 . 8706 × 1 0 3 7 . 8353 × 1 0 6
0.2 2 . 4331 × 1 0 6 1 . 1528 × 1 0 4 2 . 4058 × 1 0 3 6 . 4627 × 1 0 4
0.3 2 . 7816 × 1 0 6 2 . 0798 × 1 0 4 1 . 0295 × 1 0 3 7 . 6398 × 1 0 4
0.4 2 . 2821 × 1 0 6 3 . 1999 × 1 0 4 5 . 526 × 1 0 4 8 . 0476 × 1 0 4
0.5 6 . 8431 × 1 0 7 3 . 7088 × 1 0 4 3 . 3595 × 1 0 4 8 . 2329 × 1 0 4
0.6 2 . 3007 × 1 0 6 3 . 9768 × 1 0 4 2 . 2186 × 1 0 4 8 . 3305 × 1 0 4
0.7 7 . 0002 × 1 0 6 4 . 1307 × 1 0 4 1 . 5634 × 1 0 4 8 . 3865 × 1 0 4
0.8 1 . 378 × 1 0 5 4 . 2234 × 1 0 4 1 . 1685 × 1 0 4 8 . 4203 × 1 0 4
0.9 2 . 3043 × 1 0 5 4 . 2802 × 1 0 4 9 . 2654 × 1 0 5 8 . 441 × 1 0 4
1.0 3 . 5232 × 1 0 5 4 . 3144 × 1 0 4 7 . 8104 × 1 0 5 8 . 4534 × 1 0 4

It can be easily deduced that as the number of iterations increase, the approximate solution becomes more tortuous and the use of the symbolic computer program becomes indispensable. Mathematica 9.0 is used to handle with the complex computations for solving this problem.

5 CONCLUSION

In this article, an analytical method is adapted for solving the nonlinear differential equation modeling the nanoelectromagnetic actuator model. This technique is based on a new modified method called the optimal iteration perturbation method. Detailed convergence analysis for the proposed technique is illustrated and the provided results through two numerical experiments confirm the convergence of this method. The graphical representation of the residual error confirms that the method is effective and provides accurate results. It is interesting to investigate the application of this technique for solving some similar nonlinear problems in the future.

ACKNOWLEDGMENT

The authors would like to thank the editor and anonymous reviewers for their helpful comments and suggestions which further enriched the paper and improved its scientific contents.

    CONFLICT OF INTEREST

    The authors declares no conflict of interest.

    Biographies

    • Waleed Adel received the B.Sc. degree civil engineering and the M.Sc. and Ph.D. degrees in engineering mathematics from Mansoura University, Egypt, in 2007, 2014, and 2019, respectively. He works now as an Assistant Professor with the department of mathematics and engineering physics at the Faculty of Engineering, Mansoura University since 2019. He published more than 40 papers in prestigious journals in the field of applied mathematics and a reviewer for several international reputed journals. His current research interests include but not limited to numerical analysis for differential equations, developing novel solutions using spectral methods, computational mathematics, stability analysis for some biological models.

    • Sinan Deniz was born in Uşak, Turkey, in 1989. He is a research assistant of Mathematics at Manisa Celal Bayar University since September 2012. He received his B.Sc. degree in Mathematics from Fatih University, Istanbul, Turkey. He completed his master study in Applied Mathematics at Manisa Celal Bayar University in 2014. He obtained his Ph.D. in 2018 at Manisa Celal Bayar University with a dissertation about optimization of analytical approximate solutions of ODEs and PDEs. He has more than 40 SCI papers about applied mathematics and physics. He is referee of several international journals in the frame of pure and applied mathematics. His main research interests are nonlinear ordinary and partial differential equations, asymptotic and computational methods for ODEs and PDEs, semianalytical and numerical methods, fractional differential equations, complex function theory, perturbation techniques, computational analysis, mathematical modeling, mathematical physics, integral equations, numerical analysis, and stability theory.

    DATA AVAILABILITY STATEMENT

    All data generated or analyzed during this study are included in this article.

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