Solving high-order nonlinear differential equations using operational matrix based on exponential co
* Author to whom correspondence should be addressed.
Sigma Journal of Engineering and Natural Sciences 2023, Vol. 41, Issue 4, pp. 689-698; doi.org/10.14744/sigma.2023.00080
Abstract
Keywords: Exponential Approximation; Nonlinear Differential Equations; Collocation Method; Operational Matrix; Error Analysis
Introduction
Differential equations have a remarkable role in several scientific and engineering phenomena that have always been considered in physical and technical applications and they are appeared in various areas such as mathematics, physics and engineering sciences ([1-4]). Among these equations, nonlinear differential equations are the most important. Many of these nonlinear ordinary differential equations have no exact(analytical) solution, which this is why so many researchers are interested in employing numerical methods, therefore, numerical approximation
methods may be utilized to acquire approximate solutions. Numerical methods for solving nonlinear differential equations, especially high-order nonlinear differential equations, have always been considered. For example, some methods like the Homotopy Analysis Method (HAM) [5], the Adomian Decomposition Method (ADM)[6], the Homotopy Perturbation Method (HPM) ([7-12]), the Variational Iteration Method (VIM)[13], and so on, have been employed for solving some nonlinear differential equations. Most of the methods, which used to solve nonlinear differential equations, convert the equation to a system of nonlinear equations and then solve the system
*Corresponding author. *E-mail address: abbasbandy@ikiu.ac.ir, abbasbandy@yahoo.com This paper was recommended for publication in revised form by Hijaz Ahmad Published by Yıldız Technical University Press, İstanbul, Turkey Copyright 2021, Yıldız Technical University. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
theoretically or numerically. Also, the system of nonlinear equations can also be solved with software. In recent years, Yüzbaşi et al. have applied the collocation method based on exponential approximation to solve some problems like pantograph equation, the linear neutral delay differential, Fredholm integro-differential difference equations and so on ([14-19]). In this work, we will extend the exponential collocation method for approximating the solution of the high-order nonlinear differential equations in the general formulation as
this purpose, assuming the exact solution of equation (1) is analytic, an upper bound for the absolute error of the approximate solution is given in terms of the Taylor truncation error of the exact solution. Section 5 contains numerical examples, where approximate solutions corresponding to various N values are obtained using the proposed method that numerical experiments are examined to illustrate efficiency and accuracy of the method, and results are reported. Finally, last section consists of a brief conclusion.
(1) subject to initial and/or boundary conditions (2) where u(x) E Cm[a, b] is an unknown function and u(O)(x) denotes function u(x) itself, namely u(O) (x) = u(x). Here, Qk,s, Pk,s and h are known given functions that are defined on the interval [a, b]. Also aik, bik, cik and ai are real or complex constants and c E [a, b]. We try to find the approximate solution of Equation (1) with condition (2) as series of exponential functions. Exponential functions or exponential polynomials are based on the linearly independent exponential basis set
Preliminaries And Matrix Relations
In this section, we outline operational matrices of the exponential method we will use in order to solve equation. The method, was employed to obtain approximate solutions of high-order nonlinear differential equations. In the first step, we create the differentiation matrices that are the basic tools of the current approach. Differentiation matrices make this method more suitable for managing high-order differential equations. By constructing an operational matrix, it is easy to derive high-order derivatives of the unknown in terms of values at collocation points. Firstly, we inscribe the approximated solution uN(x) defined by linear combination (5) of equation (1) in the matrix form as, (6) where
(3) To begin with, we assume that the unique solution u(x) of equation (1) can be expressed as a exponential series of the form (4) then by truncation this power series after the (N + 1) st term, their linear combination defined by the expansion (5) which, coefficients an are unknown and N is an arbitrary positive integer such that N ≥ m. Note that u(x) is the exact solution and uN(x) is the approximate solution of the problem. The organization of this article is structured as follows: In Section 2, we express briefly required mathematical elementary and matrix relations for exponential functions of the method. In Section 3, we present the numerical implementation of matrix operation of method. Section 4 involves the error analysis and method convergence. For
Taking advantage of the linearity of expansion , we can compute the derivative of u by differentiating the basic functions. The derivatives of u are obtained as follows (7) and for higher order derivatives of u we present a matrix form. Next, we explain how to create a differentiation matrix through the method, and we extract and create a matrix D so that the equations are in the collocation points. The derivative of the approximate solution can also be expressed as a product of matrices. Namely, E(x) has a relation with its first derivative Eı(x) that is demonstrated by
where the operational (differentiation) matrix D corresponding to above relation is represented
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
Implementation of Matrix Operation In this section, we explain how to employ the exponential collocation method for the problem . For this purpose, we use the following procedure. To acquire an exponential series solution of equation under the conditions, the operational matrix method is applied as follows. The foundation of this method is based on calculating the unknown coefficients using the collocation points. In the first step, the collocation points are placed in (1) as
holds for any nonnegative integer k, that Do is the identity matrix which its dimension is: (N + 1) x (N + 1). Note that and afterwards the above system can be expressed in the following matrix form
By using of the matrix relations (6) and (8), we can write matrix representation as
(9) After replacing the collocation points in , we turn into the following system of matrix equations as
After the substitution of the above relations, we obtain to the following matrix equation
where such that (10) As the same way, by putting the collocation points into the ur(x)u(k)(x), and using the above relations, the following matrix representation is obtained as
(11) Here, (10) conforms to a nonlinear system of the (N + 1) algebraic equations with the unknown coefficients an. Finally, in order to impose initial and/or boundary conditions, we try to acquire a matrix presentation of the conditions (2). By employing the relation(9) at points a, b and c, the matrix presentation of conditions that related to the coefficients matrix A becomes
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
Error Analysis and Convergence In this section, we investigate error analysis and convergence of the method. We suppose that u(x) be an infinitely differentiable function on interval [a,b] and uN(x) be the approximated solution of u(x) at collocation points xi Here, we give an upper bound for the absolute error in terms of the Taylor truncation error of the exact solution. A criteria for convergence: If we consider an (N + 1)-term truncation approximation of exponential series, that is
we can investigate the error of the method from the residual function by employing (1) as follows: (12) In order to discuss the convergency and error analysis of the main problem with the initial and the boundary condition let us introduce the following norm. Definition. The least-square norm is defined by (13) where ω(x) as weight function is non-negative[20] . Now compute the error (14) for the desired approximation. Since the series (5) converges, we can specify the reliable N for an proper error, ε > 0, by employing the Cauchy condition (15) that N, M ≥ N0 – 1, for some fixed integer number N0. In special case, let us consider h(x) = 0 and M = N – 1 for u(x) E Cm[0,1], then
which by ignoring the small term, we have the following criteria
It is a necessary criteria to stop the procedure of calculations. Obviously, If it increases the number of series sentences, then the accuracy of the approximate solution will increase. In fact, this inequality offers a necessary criteria to stop calculations process when ε be an arbitrary Cauchy error and aN be the last coefficient. Error bound for the solution In this part, we relate the error bound for the approximate solution uN(x) to the truncation error of the Taylor polynomial corresponding to the exact solution. Theorem. Suppose u(x) and uN(x) denote the exact and the approximate solutions of problem , respectively. If u(x) ∈ CN+1[a,b], then where denotes the N-th degree Taylor polynomial expresses its of u around the point x = q ∈ [a,b] and remainder term. Proof. See [21]. As a result, this theorem is very helpful to find an upper bound of the absolute error in terms of the Taylor truncation error of the exact solution. Notice that this is not an a priori error bound; it only serves as a means to compare the actual error to this Taylor truncation error. Illustrative Examples In this section, we apply the method explained in Section 2 to several high-order nonlinear equations and compare the resulting approximate solutions with some other methods present in the literature. All the calculations have been performed using MAPLE. We solve four examples by using the method, and report the numerical results along with comparison with other methods. The absolute error
has been used to show that this method is efficient and reasonably accurate. Example 1. As a first example, consider the Riccati differential equation ([23]-[24]) as
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
with initial condition u(0) = 1, which the exact solution of this problem is
Table 2. The absolute error of the solution for Example 1 with N = 3 and = 10.
For implementation of the method, from for m = 1, n = 1 the coefficients are
Table.1 compares the absolute errors of the solutions obtained by the present method, the Bessel Polynomials Method [22] , the Taylor Method [23] and the Decomposition [24] Method for N = 3. It can be concluded that for each choice of the parameter , the present method outperforms the aforementioned ones for most, if not all, of the sample points taken from [0,1]. The values in the table also imply that the absolute error functions resulting from the present method is more evenly distributed over the interval [0,1] compared to the other methods. This procedure has also been carried out for the values N = 3 and N = 10. The obtained bounds are shown in Table 2 together with the maximum actual errors corresponding to these N values. Furthermore, the last column indicates that increasing N decreases the absolute error by a significant amount. The data in the table can be seen in a visual setting in Figure.1. This figure shows the graph of absolute error function with N = 3 (top left), graph of numerical and exact solution with N = 3 (top right), graph of absolute error function with N = 10 (bottom left) and graph of numerical and the exact solution with N = 10 (bottom right). Example 2. As a high-order complex problem, examine following fifth-order nonlinear ODE([25]-[26])
so that, the exact solution of this nonlinear differential equation is exponential function as u(x) = ex. For implementation of the method, from for m = 5, n = 1 the coefficients are
and other coefficients are zero. The behavior of absolute error is reported in Table.3 and compared by Shifted Chebyshev Polynomial Method (SCPM) and Chebyshev collocation matrix method (CCMM) at same conditions with N = 6. Figure 2 shows graphs of absolute error function(left) and graph of numerical and the exact solution (right) with N = 6. Example 3. For third example, consider the LaneEmden equation([29]-[30]) as follows
Table 1. Comparison of the absolute errors of present method and other methods for Example 1. x
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
Figure 1. Graph of absolute error function with N = 3(a), graph of numerical and exact solution with N = 3(b), graph of absolute error function with N = 10(c) and graph of numerical and exact solution with N = 10(d) for Example 1.
Table 3. The comparison the absolute error of the solution with other methods for Example 2 xi
2.0. × 10-2
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
Figure 2. Graph of absolute error function(left) and graph of numerical and exact solution(right) with N = 6 for Example 2. with initial conditions
Table 4. The absolute error obtained by the Method for Example 3
In special case, for g(x,u) = u (x) and h(x) = 0, this equation is the standard Lane-Emden equation. In this example, let n = 5, α = 2 and h(x) = 0 then n
For implementation of the method, from for m = 2, n = 4 the coefficients are with conditions and other coefficients are zero. The mentioned procedure has also been carried out for the values N = 5 and N = 10. The obtained bounds are shown in Table 4 together with the maximum actual errors corresponding to these N values. Figure 3 shows the absolute error function with N = 5 (top left), graph of numerical and the exact solution with N = 5 (top right), graph of absolute error function with N = 10 (bottom left) and comparison of numerical and the exact solution with N = 10 (bottom right). Example 4. As another example, consider a nonlinear third-order differential equation([29]-[30]) as follows
which its exact(analytical) solution is u(x) = e-x. For implementation of the method, from for m = 1, n = 1 the coefficients are
and the rest of the coefficients are zero. For this example, when we assume the following approximation
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
Figure 3. Graph of absolute error function with N = 5(a), graph of numerical and exact solution with N = 5(b), graph of absolute error function with N = 10(c) and graph of numerical and exact solution with N = 10(d) for Example 3. because its exact solution u(x) = e-x belongs to the basis set B = {1, e-x, e-2x, …} implementing the present method for any N yields the solution u(x) = e-x, that is the exact solution of the problem. In fact, for any choice of N we get as a result of the algorithm, which means any N yields the exact solution. This is not a surprise since the scheme described in Section 2 makes it clear that the unknown coefficients of the approximate solution uN(x) obtained as a result are equal to the actual coefficients of the exact solution and we reach to exact solution means
Conclusion
In this paper exponential approximation has been employed to solve high-order nonlinear differential equations. The method based on exponential functions and collocation method as operational matrix. As observed, there is no concern about approximating higher-order derivatives of the unknowns. Also, to demonstrate the accuracy and efficiency of the method, four examples with different order and complexity have been examined. Through the examples provided, we realize that the obtained numerical results are in good contract with the exact analytical solutions. As a result of comparisons with other methods,
Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
it has been observed that the method presented gives good results. In addition, it is realized that errors decrease when N values increase. As shown in the results obtained from computations, we conclude that implementation of this method will be very easy with less computational costs for similar problems.
Data Availability Statement
The authors confirm that the data that supports the findings of this study are available within the article. Raw data that support the finding of this study are available from the corresponding author, upon reasonable request.
Conflict Of Interest
The author declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.
Ethics
There are no ethical issues with the publication of this manuscript.
References
- Shivanian E, Aslefallah M. Stability and conver- tion for solutions of generalized pantograph-de- gence of spectral radial point interpolation method lay differential equations. Appl Math Model locally applied on two-dimensional pseudo-para- 2013;37:9160−9173. [CrossRef] bolic equation. Numer Methods Partial Differ Equ [15] Yüzbaşi S. An operational method for solutions of 2017;33:724−741. [CrossRef] Riccati type differential equations with functional argu-
- Aslefallah M, Shivanian E. Nonlinear fractional ments. J Taibah Univ Sci 2020;14:661−669. [CrossRef] integro-differential reaction-diffusion equation via [16] Yüzbaşi S. An exponential method to solve lin- radial basis functions. Eur Phys J Plus 2015;130:1−9. ear Fredholm-Volterra integro-differential equa- [CrossRef] tions and residual improvement. Turk J Math
- Aslefallah M, Abbasbandy S, Shivanian E. Meshless 2018;42:2546−2562. [CrossRef] singular boundary method for two dimensional [17] Yüzbaşi S, Ismailov N. An operational matrix method pseudo-parabolic equation: analysis of stability and for solving linear Fredholm-Volterra integro-dif- convergence. J Appl Math Comput 2020;63:585−606. ferential equations. Turk J Math 2018;42:243−256. [CrossRef] [CrossRef]
- Aslefallah M, Abbasbandy S, Shivanian E. Numerical solution of a modified anomalous diffusion equa- for numerical solutions of Hantavirus infection tion with nonlinear source term through meshless model. Appl Appl Math 2013;8:99−115. singular boundary method. Eng Anal Bound Elem [19] Yüzbaşi S. An exponential method to solve lin- 2019;107:198−207. [CrossRef] ear Fredholm-Volterra integro-differential equa-
- Liao SJ. Homotopy Analysis Method in Nonlinear tions and residual improvement, Turk J. Math Differential Equations, Berlin & Beijing: Springer & 2018;42:2546−2562. [CrossRef] Higher Education Press; 2012. [CrossRef] [20] Chadwick E, Hatam A, Kazem S. Exponential func-
- Hosseini S, Abbasbandy S. Solution of lane-em- tion method for solving nonlinear ordinary dif- den type equations by combination of the spectral ferential equations with constant coefficients on a method and adomian decomposition method. Math semi-infinite domain. Proc Indian Acad Sci (Math Problems Eng 2015;2015:534754. [CrossRef] Sci) 2016;126:79−97. [CrossRef] 698 Sigma J Eng Nat Sci, Vol. 41, No. 4, pp. 689−698, August, 2023
- Yüzbaşi S, Karacayir M. A Galerkin-like method for solving linear functional differential equations boundary value problems by the variational itera- under initial conditions, Turk J Math (2020;44:85- tion method. Comp Math Appl 2009;58:2347-2350.
- Yüzbaşi S, Sahin N. On the solutions of a class of nonlinear ordinary differential equations by the Abel equations of the first kind. Appl Math Lett Bessel polynomials, J Numer Math 2012;20:55-79. 2009;22:1401-1405. [CrossRef] [CrossRef]
- Gulsu M, Sezer M. On the solution of the Riccati equation by the Taylor matrix method. Appl Math boundary-value problems by Adomian decomposi- Comp 2006;176:414-421. [CrossRef] tion. J Comp Appl Math 2001;136:259-270. [CrossRef]
- Bulut H, Evans DJ. On the solution of the Riccati equation by the decomposition method. Int J Comp of the Adomian decomposition method for lin- Math 2002;79:103-109. [CrossRef] ear and nonlinear operators. Appl Math Comp
- Ozturk Y, Gulsu M. The approximate solution of 2001;122:393-404. [CrossRef] high-order nonlinear ordinary differential equa- [35] Yang CC. On entire solutions of a certain type of tions by improved collocation method with terms of nonlinear differential equations. Bull Austral Math shifted Chebyshev polynomials. Int J Appl Comput Soc 2001;64:377-380. [CrossRef] Math 2016;2:519-531. [CrossRef]
- Chen B, Garcia-Bolos R, Jodar L, Rosello MD. Chebyshev polynomial approximations for non- for solutions of Pantograph-type Volterra-Fredholm linear differential initial value problems. Nonlinear integro-differential equations with functional upper Anal 2005;63:629-637. [CrossRef] limit. Sigma J Eng Nat Sci 2020;38:995−1005.
- Lebrun JPM. On two coupled Abel-type differen- tial equations arising in a magnetostatic problem. Il functional differential equation. J Inst Math Appl Nuovo Cimento1990;103A:1369-1379. [CrossRef] 1971;8:271-307. [CrossRef]
- Mak MK, Chan HW, Harko T. Solutions generating technique for Abel-type nonlinear ordinary differ- derivative and its applications. Int Conf Vib Eng ential equations, Comp Math Appl 2001;41:1395- 1998;98:288-291. 1401. [CrossRef] [39] Heydari M, Loghmani GB, Hosseini SM, Karbassi
- Singh OP, Pandey RK, Singh VK. An analytic algo- SM, Application of hybrid functions for solv- rithm of Lane-Emden type equations arising in astro- ing duffing-harmonic oscillator. Adv Differ Equ physics using modified Homotopy analysis method. Comput Phys Comm 2009;180:1116-1124. [CrossRef] 2014;2014:210754. [CrossRef]
- Yildirim A, Ozi ST. Solutions of singular IVPs of Lane-Emden type by the variational itera- holm integro-differential equations by using hybrid tion method. Nonlinear Anal 2009;70:2480-2484. function operational matrix of derivative. J Inf [CrossRef] Comput Sci 2013;10:2757−2764. [CrossRef]
Share and Cite
ASLEFALLAH, M.; ABBASBANDY, S.; YÜZBAŞI, S. Solving high-order nonlinear differential equations using operational matrix based on exponential co. Sigma Journal of Engineering and Natural Sciences 2023, Vol. 41, pp. 689-698. https://doi.org/10.14744/sigma.2023.00080

