Adomian Decomposition Method for Solving Boussinesq Equations Using Maple ()
1. Introduction
Since the beginning of the 1980s, Adomian [1] - [8] has introduced and developed a technique known as the Adomian Decomposition Method (ADM) which is a well-known systematic method for the practical solution of Ordinary Differential Equations (ODEs), Partial Differential Equations (PDEs), integral equations, integro-differential equations, and other operator equations with linear or nonlinear, deterministic, or stochastic operators. The ADM is an effective method that offers quick algorithms for approximating analytical solutions and numerical simulations for practical applications in engineering and the applied sciences. The solution is found as an infinite series that converges rapidly to accurate solutions.
Adomian and co-workers have solved nonlinear differential equations for a wide class of nonlinearities, including product [9] , polynomial [10] , exponential [11] , trigonometric [12] , hyperbolic [13] , composite [14] , negative-power [15] , radical [16] and even decimal-power nonlinearities [17] . We find that the ADM solves nonlinear operator equations for any analytic nonlinearity, providing us with an easily computable, readily verifiable, and rapidly convergent sequence of analytic approximate functions.
More recently, Adomian and Rach [18] introduced the phenomena of the so-called “noise terms”. The “noise terms” were defined in [3] as identical terms with opposite signs that appear in the first two components of the series solution of u(x).
Recent research by Wazwaz [19] developed a condition that is fundamentally required to guarantee the presence of “noise terms” in inhomogeneous equations. Then, Luo commented on it with a scientific paper [20] and modified this method with a two-step Adomian Decomposition Method. Chen and Lu [21] established a promising algorithm that can be easily programmed in Maple.
The classical Boussinesq equation
(1)
which has been derived in 1872 to describe shallow water waves has the flaw that the Cauchy problem is improperly posed. Therefore, it can’t be used for the analysis of numerical wave propagation issues.
It also occurs in various physical applications such as vibrations in a nonlinear string, iron sound waves in plasma, and nonlinear lattice waves. Additionally, it was used to address issues with water percolation in porous subsurface strata. Recently, certain novel approaches to solving nonlinear equations have garnered considerable interest, such as the variational iteration method.
Boussinesq put forth a well-known model of nonlinear dispersive waves in the generalized form.
(2)
with u and h are sufficiently differentiable functions, and
. The initial conditions associated with Boussinesq Equation (1) have the form
(3)
with
and
given
.
This paper aims to solve the Boussinesq equation and compare the exact solution, and the numerical solution obtained using the method of Adomian Decomposition Method by Maple 18 program.
To present a clear overview of the method, we have chosen two examples, to illustrate the Adomian Decomposition Method and the obtained solutions are compared with the exact solutions.
2. Adomian Decomposition Method
To illustrate the methodology of the proposed method, using the Adomian Decomposition Method, we consider
(4)
where L is the highest order derivative in the equation, R is the remainder of the differential operator,
expresses the nonlinear terms, and
is an inhomogeneous term. If the operator L is a first-order operator, characterized by
(5)
The inverse operator L−1 L is given by assuming that L is invertible.
(6)
So that
(7)
If, on the other hand, L is a second-order differential operator defined by
(8)
so that the inverse operator L−1 is regarded a two-fold integration operator defined by
(9)
So that
(10)
In a parallel manner, if L is a third-order differential operator, we can easily show that
(11)
For higher-order operators we can easily similarly define the related inverse operators. Applying L−1 to both sides of (4) gives
(12)
and so on. The Adomian Decomposition Method admits the decomposition of u into an infinite series of components.
(13)
(14)
where An are the Adomian polynomials. Substituting (13) and (14) into (12) gives
(15)
The various components un of the solution u can be easily determined by using the recursive relation.
(16)
(17)
Consequently, the first few components can be written as
Having determined the components
, the solution u in a series form follows immediately. As stated before, the series may be summed to provide the solution in a closed form. However, for concrete problems, the n-term partial sum
(18)
may be used to give the approximate solution. In this section, we solve some examples, and we can compare the numerical results with the exact solution.
3. Application
Two examples are given in this section to illustrate the effects of the proposed method.
3.1. Example 1
Consider the Boussinesq equation
(19)
with the exact solution
.
3.2. Example 2
Consider the Boussinesq equation
(20)
with the exact solution
.
Figure 1 and Figure 2 show the exact and approximate solutions. This problem was solved by ADM and their results are shown in Table 1 and Table 2 using maple.
![]()
Figure 1. Graph showing the correspondence between exact and approximate solutions result of Boussinesq equations in Example 1.
![]()
Figure 2. Graph showing the correspondence between exact and approximate solutions result of Boussinesq equations in Example 2.
![]()
Table 1. Numerical results and exact solution of Boussinesq equation for Example 1.
![]()
Table 2. Numerical results and exact solution of Boussinesq equation for Example 2.
4. Conclusion
The Adomian decomposition strategy is used to solve the Boussinesq equations using Maple18 software. The results were created using tables and figures. Table 1 and Table 2 show the numerical solution as well as the right solution. We can see that the numerical solution is generally relevant to the precise answer by comparing the numerical results, proving the method’s efficacy and the ability to obtain the numerical solution relating swiftly and efficiently to the exact solution using Maple 18 software. Furthermore, the results obtained are pretty precise. The primary goal of the present paper is to mechanize the computing process of the decomposition method by the Maple program, so that we can obtain approximate solutions, which makes it easy in the future to expand the use of the Mabel program to solve more complex equations as quickly as possible.
Acknowledgements
This project was funded by the Deanship of Scientific Research (DSR), at King Abdulaziz University. The author, therefore, acknowledges with thanks DSR’s technical and financial support.