Quintic B-Spline Method for Solving Sharma Tasso Oliver Equation ()
1. Introduction
Numerical Analysis is considered an important branch in mathematics which plays an important solution in finding an approximate solution for feature nonlinear PDEs which has no exact solution. Most numerical solution depends on interpolation and spline interpolation plays an important base in polynomial interpolation in most mathematical branches such as numerical analysis, computation, integration, differentiation, etc. Many physicists and mathematicians have paid their attentions to the Sharma-Tasso-Olver (STO) equation in recent years due to its appearance in scientific applications. The researchers who solved the Sharma-Tasso-Olver (STO) equation include Wazwaz (2007) who used the tanh method, the extended tanh method, and other ansatz involving hyperbolic and exponential functions efficiently used for the analytic study of this equation [1]. In [2], Yan investigated the Sharma-Tasso-Olver Equation (1) by using the Cole-Hopf transformation method. The simple symmetry reduction procedure is used in [3] to obtain exact solutions where soliton fission and fusion have been examined. Wang et al. examined the soliton fission and fusion thoroughly by means of the Hirotas bilinear method and the Bäcklund transformation method in [4]. The generalized Kaup-Newell-type hierarchy of nonlinear evolution equations is explicitly related to Sharma-Tasso-Olver equation from [5]. Chao Yue in [6] provided theta function representation of algebro-geometric solutions and related crucial quantities for the complex Sharma-Tasso-Olver (CSTO) hierarchy. In [7] the simple symmetry reduction procedure is repeated by examining soliton fission and fusion to obtain the exact solutions for STO. Using the improved tanh function method in [8], the Sharma-Tasso-Olver equation with its fission and fusion has some exact solutions. In 2006 Klaus et al. developed the instability of algebraic solitons for integrable nonlinear equations in one spatial dimension that include modified KdV, focusing NLS, derivative NLS, and massive Thirring equations [8] [9]. In [9], the Korteweg-de Vries-Burgers’ (KdVB) equation is solved numerically by a new differential quadrature method based on quintic B-spline functions. In [10] S. I. Zaki introduced the quintic B-spline finite elements scheme for the KdVB equation. R.C. Mittal and R.K. Jain discussed a collocation method for solving some Rosenau type non-linear higher in [11]. In [12] H. Tariq and G. Akram solved the fourth-order partial differential equations with Caputo time fractional derivative on a finite domain with quintic polynomial spline technique. Krwan Jwame and Najim Abdullah developed the B-spline method for solving higher order differential equations in [13]. In [14], K. R Raslan et al. proposed the numerical solution of a coupled system of Burgers’ equation by using the quintic B-spline collocation scheme on the uniform mesh points. Ding and Wong solved a time-fractional nonlinear Schrödinger equation by using the quintic non-polynomial spline in [15]. In 1946, J. H. Ahlberg [16] introduced spline functions. Mathematically, a spline function consists of polynomial pieces on sub intervals joined together with certain continuity conditions. Second order linear two-point boundary value problems were solved using extended cubic B-spline interpolation method by Hamid et al. in 2011 [17]. In the same year, Eisa et al. used uniform quartic spline polynomial functions to develop some consistency relations, which are then used to derive a numerical method for approximating the solution [18]. In 2006, Caglar et al. considered the B-spline interpolation and compares this method with finite difference, finite element and finite volume methods which applied to the two-point boundary value problem [19]. Fauzi and Sulaiman, discussed the application of Half-Sweep Modified Successive Over Relaxation (HSMSOR) iterative method for solving second order two-point boundary value problems [20]. Recently, in 2021 Hadhoude et al. showed how to approximate the solution to the generalized time-fractional Huxley Burgers’ equation by a numerical method based on the cubic B-spline collocation method and the mean value theorem for integrals [21]. Next year, Hadhoude et al. introduced the cubic non-polynomial spline functions to develop a computational method for solving the fractional modified Burgers’ equation [22], Mustafa Inc and, Zeliha S Korpinar, Maysaa, Mohamed Al Qurashi and Dumitru Baleanu, introduced numerical solutions by Residual power series method of the sharma Tasso Oliver equation [23]. Doğan Kaya et al. compared exact and numerical Solutions for the Sharma-Tasso-Olver Equation [24]. Alzaid, N. and Alrayiqi, B. introduced Adomian decomposition method (ADM) implemented to approximate the solution of the KdV equations of the seventh order, which are Kaup-Kuperschmidt equation and seventh order Kawahara equation, the ADM is very efficient [25]. An, J. and Guo, X. discussed the numerical solution of the boundary value problem that is two-order fuzzy linear differential equations [26].
This paper is designed to determine the approximate solution of Sharma-Tasso-Olive (STO) equation. The approximate solution is based on forward difference formula and B-spline collocation method. The paper is divided into four sections. The quintic B-spline basis function was given in Section 2. The stability and convergence analysis using the Von-Neumann method is discussed in Section 3. In Section 4 we apply an illustration example to discuss the applicability of our designed method.
The generalized STO equation [1] [2] [3] is defined as:
(1.1)
where,
is a parameter that
.
2. Description of Method
In quintic B-splines collocation method the approximate solution which is obtained as a linear combination of quintic B-spline basis functions
approximation space under consideration and undetermined coefficients
, From the above basis, the approximation solution
can be written in terms of linear combination of quentic B-Spline base function as follows:
(2.1)
And its derivatives be in the form:
(2.2)
(2.3)
In our work, we will use the quintic B-spline polynomial as a base function to construct the approximate solution. quintic splines defined as follow:
where
, then the quintic spline function and its derivatives at nodes
defined as in Table 1 as follows:
By substitution in Equations (2.1) and (2.2), with the values of the
at nodel points determined in terms of
can be written by:
(2.4)
Also we can define:
(2.5)
On substituting global approximation (2.1) and its necessary derivatives (2.2) in (1.1), following set of the first order ordinary differential equations is obtained as,
Then the equation takes the form:
![]()
Table 1. The values of
and its derivatives at the knots.
Let we define:
(2.6)
So the D.E be:
(2.7)
So we can represent the components of the general solution
and its derivatives by using Table 1 for the coefficients for
:
After simplifying the previous equation we will get the following system of equations:
(2.8)
where
and
given as follows:
(2.9)
For this purpose, we will use initial and boundary conditions. Then the system of linear equation with N + 3 unknown for expression (2.4) becomes:
(2.10)
3. Stability Analysis
The Von Neumann technique will be used to investigate the stability of our system (2.8) as in [18] [19]:
Where
and
given as (2.9):
To apply Von Neumann technique, we must linearize all of the nonlinear terms of system (2.9) by a local constant as follow:
(3.1)
According to the Von Neumann stability analysis, we have
(3.2)
where
the waves number and h are the step size of x.
By substituting (3.2) in the system (2.8) with coefficients (2.9) we will get:
Dividing both sides of the last equation by
, we get the following relation:
So we can get the value of by the following relation:
(3.3)
With linear coefficients:
,
,
,
,
.
So we have:
(3.4)
After substitution by the previous coefficients and simplifying the equation we get the final values of X and Y we get:
(3.5)
We can put
in the following form:
with
It is very clear that X and Y are complex numbers so:
(3.6)
It is clear that the value of
so
so the value of
depends only on the value of
and
, also the only condition that this method is stable that the value of
, so we must proof that
.
The previous condition is very difficult to prove but it is easy to prove that
by taking the value of
near zero and this happens when the value of (k) the step size of time (t) much less the value of (h) the step size of (x) as from Equation (2.5) the value of
.
This tends to reduce the step size of t to the maximum possible degree to guarantee stability.
4. Applications and Discussion
In this section, we apply the suggested method to solve STO equation with different initial value and exact solution, and we will show that our method produces a good approximation. Our proposed scheme’s accuracy is measured by computing the
error norm and maximum absolute error for several choices.
Error norms are defined as follows:
The computations associated with the experiments were performed in the Mathematica software package.
Example 1: Consider Sharma-Tasso-Oliver Equation (STO) [23]
Subject to initial condition:
The exact solution for this equation is given by:
The numerical results are presented in Tables 2-4 which show the comparison between the approximate solution and exact solution values at different values of
, within
,
and
. Table 5 show a comparison between the maximum absolute error and
error norm at different values time levels. Figures 1-3 show that the numerical approximate solution and exact solution are randomly same at different values of time. Figure 4 shows the behavior of approximate solutions at different time levels.
Example 2: [23]
Consider the STO equation with different initial value and exact solution as follow:
![]()
Figure 1. The behaviour of approximate and exact solutions at
,
,
and
.
![]()
Figure 2. The behaviour of approximate and exact solutions at
,
,
and
.
![]()
Figure 3. The behaviour of approximate and exact solutions at
,
,
and
.
![]()
Figure 4. The behaviour of approximate solutions at different time levels when
,
and
.
![]()
Table 2. Comprising between the approximate and exact solutions with errors at
,
,
and
.
![]()
Table 3. The Comprising between the approximate and exact solutions with errors at
,
,
and
.
![]()
Table 4. The Comprising between the approximate and exact solutions with errors at
,
,
and
.
![]()
Table 5. The obtained
and
errors at different time steps
and
,
.
Subject to initial condition:
The exact solution for this equation is given by:
The numerical results are presented in Tables 6-8 which show the comparison between the approximate solution and exact solution values at
,
and
. Table 9 shows a comparison between the maximum absolute error and
error norm at different values time levels. Figures 5-7 show that the numerical approximate solution and exact solution are randomly the same at different values of time. Figure 8 shows the 3D behavior of approximate solutions at different time levels.
![]()
Figure 5. The behaviour of approximate and exact solutions at
with
,
.
![]()
Figure 6. The behaviour of approximate and exact solutions at
with
,
.
![]()
Figure 7. The behaviour of approximate and exact solutions at
with
,
.
![]()
Table 6. The comprising between the approximate and exact solutions with errors at
and
,
.
![]()
Table 7. The Comprising between the approximate and exact solutions with errors at
with
,
.
![]()
Table 8. The Comprising between the approximate and exact solutions with errors at
with
,
.
![]()
Table 9. The obtained
and
errors on different time steps
.
![]()
Figure 8. The 3D behaviour of approximate solutions at different time levels and
,
.
5. Conclusion
The Quintic B-spline collocation method is used in this study to numerically solve the Sharma-Tasso-Olive equation. For the spatial variables and derivatives, we used quintic B-splines, which results in a set of first-order ordinary differential equations. The finite difference approach and the collocation method are the foundations of the developed plan for solving the problem under consideration. Analysis of stability demonstrated that the proposed scheme is infallibly stable. By calculating
and
and comparing the error norms with past works, the precision and effectiveness of the proposed method have been demonstrated, and approximate solutions are explored. The acquired numerical results demonstrate the present method’s remarkable performance as a numerical strategy for solving the (STO) problem and its applicability to a variety of situations.
Acknowledgements
The authors would like to express their sincere gratitude to the referees for the valuable suggestions to improve the paper.