CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND

COMPUTER SCIENCES
https://cajmtcs.centralasianstudies.org

Volume: 04 Issue: 8 | Aug 2023 ISSN: 2660-5309

A NEW TECHNIQUE TO SOLVE PREDATOR–PREY MODELS BY

USING SHEHU TRANSFORMATION-AKBARI-GANJI’S METHOD
WITH PADÉ APPROXIMANT
Rania O. Al–Sadi, Abdul-Sattar J. Al-Saif
Department of mathematics, The Education College of Pure science, Basrah University, Basrah, Iraq

Abstract ARTICLEINFO
In this paper, a new technique has been proposed and applied
Article history:
to find analytical approximate solutions for predator-prey Received 3 Jun 2023
systems. The new technique depends on combining the Revised form 5 Jul 2023
Accepted 31 Aug 2023
algorithms of Shehu transform and Akbari-Ganji’s method
(AGM) with Padé approximant. Three examples are given to
Keywords: predator-prey systems,
test the effectiveness, accuracy, and performance of the Shehu transform, Akbari -Ganji’s
suggested method. In comparison to the existing methods used method, Padé approximant,
to identify the analytical approximate solutions of the current convergence, stability.
problems, the results of using the new technique demonstrate
that it has excellent efficiency and accuracy. Also, the tables
and errors graphs show the applicability and necessity of this
technique.

© 2023 Hosting by Central Asian Studies. All rights reserved.

---------------------------------------------------------------------***---------------------------------------------------------------------
1. Introduction
The primary model for analyzing the dynamics of many species' populations is the predator-prey model,
which was developed by Lotka and Volterra [1, 2]. It has a broad range of applications in many different
scientific fields, including chemical processes [3, 4], bioparticle granulation [5], and the interaction of
microorganisms and ecosystems [6, 7]. The Lotka-Volterra type predator-prey system has been the focus of
a lot of research in recent years. Zhu and Yin focused on the competitive Lotka-Volterra model in random
situations [8]. Badri et al. focus on installing Lotka-Volterra systems, a particular family of nonlinear
quadratic systems, and possible balance points [9]. This paper's objective is to numerically study the
predator-prey models controlled by the following system of nonlinear ordinary differential equations

} (1)

where the positive functions , (t) typically give relative measurements of the effect of dimensional
parameters [10] and respectively, reflect the population densities of prey and predator at time t.
The numerical solution of system (1) is not straightforward due to the structure of the functions and ,
hence it is essential to create trustworthy numerical algorithms. Numerous articles have addressed the

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 102

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

numerical solution of predator-prey models to compare the effectiveness and reliability of various
approaches numerically. For instance, the Adomian technique has been quantitatively tested using a
predator-prey model [11-14]. Additionally, He's variational approach was researched and used to simulate a
predator-prey relationship [15]. The predator-prey model has also been used using nonstandard finite
difference techniques [16]. The differential transformation method (DTM) was used to analyze a predator-
prey model with constant coefficients over a brief time horizon [17]. The ratio-dependent predator-prey
system with continuous effort harvesting was approximated using the homotopy perturbation approach [18].
The nonlinear imprecise prey-predator model with stability analysis was implemented using the homotopy
perturbation and variational iteration methods [19]. Many researchers have presented studies on the
characteristics of prey and predator systems such as coexistence, stability and extinction [20-22]. A
numerical study is presented in a ratio-dependent predatory system disturbed by time noise. The base model
was calculated using two charts. Euler forward diagram and finite difference diagram [23]. Using a Holling
type-II predator functional response, a reaction-diffusion-advection predator-prey model was shown to be
stable [24]. A multispecies ecological and epidemiological mathematical model was designed for scenarios
where interacting species compete for the same food sources and the prey are infected. The stability of the
aforementioned method is examined by the Von Neumann stability analysis [25]. What was presented above
reflects the importance of studying the system and the importance of treating it with different simulation
methods. In general, in many cases, it is difficult to find a solution to nonlinear differential equations using
the methods of integrative transformations due to the nonlinear terms in them. Moreover, according to our
information, the process of merging analytical methods and integrative transformations leads to a reduction
in the number of computational operations and reduces the difficulty of analytical methods are used alone.
Many studies have focused on this area [26-29]. Many analytical methods used to solve differential
equations, and one of these methods is Akbari-Ganji’s method developed by Ganji and Akbari and could be
used to solve a variety of nonlinear ordinary and partial differential equations. It is characterized by its ease
of application to find solutions [30]. In addition, Pade´s approximation is the best approximation of a
function near a certain point by a logical function of a specific order. It improves accuracy and the
convergence of solutions by improving the field, which was developed by Henri Pade' in 1890 [31]. A recent
integrative transformation is the Shehu transform, which was developed by Maitama and Zhao in 2019 [32].
And the fact that these aforementioned methods have not been used before to solve the prey and predator
systems. Consequently, this has prompted us to propose a new method. This new method combines the
algorithms of the Shehu transform method, Akbari- Ganji’s method, and Pade´s approximation method
(SAGPM). This paper involves seven sections, of which this introduction is the first. In Section 2, We
present the proposed technical algorithm, and we applied it to different systems of predator- prey models
(Section 3). Next, we introduce the numerical results and compare these results with other works (Section 4).
In Sections 5 and 6, we study the convergence and stability analysis of predator-prey systems. The last
Section summarizes the major findings of this study. When applying the proposed approach and comparing
it with the previous works that dealt with the same problem, the results have shown the effectiveness and
efficiency of the proposed approach in terms of high accuracy and good convergence.
2. The new SAGPM Algorithm
The basic idea of the SAGPM is based on the Shehu transform method and Akbari-Ganji’s method with
Padé approximate algorithms, which will be mentioned in this section.
2.1. Shehu transformation method [32]:
Shehu transform, a new integral transformation that Shehu and Zhao introduced in 2019, is a generalization
of the Laplace and Sumudu integral transforms. The authors have used it to resolve both the ordinary and
partial differential equations.
The Shehu transform is found across set A:
| |
A= { f ( t): , | | ( ) ( [ }

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 103

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

by the following integral

S[f(t)] = F(v,u) = ∫ ) f(t) dt

= ∫
The inverse Shehu transform is given by
[F(v,u)] = f(t), for t
Equivalently
f(t)= [F(v,u)]= ∫ ) F(v,u) dv, (3)
where v and u are the variables of the Shehu transform, and α is the real constant and the integral in Eq. (3) is
taken along v = α in the complex plane .
2.1.1. Shehu transformation of derivatives and some functions
If { } then
1) { }

2) { } ∑ ( )

3) { }

4) { }

5) { }

6) { }

7) { } ( )
2.2. Akbari-Ganji’s method (AGM)
This method, which was developed by Akbari and Ganji, is an excellent computation methodology that may
be utilized to solve various nonlinear differential equations. In this method, the solution is taken to be a finite
series, hence the answer is obtained by resolving a sequence of algebraic problems.
The differential equation for a function and its derivatives can be written as follows in order to use
AGM:
In equation = f( , ', ",..., ) = 0, = (4)
is the nonlinear differential equation of order derivatives with boundary conditions:
At t=0, = , '(t)= ,..., (t) = (5a)
At t=L, = , '(t)= ,..., (t)= (5b)
The differential equation's solution is taken into consideration to solve Eq. (4) in relation to the conditions
(5a and 5b);
=∑

Eq. (6) can be solved with high accuracy by selecting more terms. If the series (6) has ( ) degrees, then there

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 104

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

are ( ) unknown coefficients that must be determined to find the solution to the differential Eq. (4). For
Eq. (6), the boundary conditions (5a) and (5b) are applied as follows:
We have the following at t=0.
 x(0)  a0  x0
 x ' (0)  a  x
 1 1
 (7)
 x ' ' (0)  a2  x2


when t = L

 x( L)  a0  a1 L  ...  an Ln  xL0
 n 1
 x ' ( L)  a1  2a2 L  ...  n an L  xL1
 n 2
(8)
 x ' ' ( L)  2a2  6a3 L...  n (n  1) an L  xL2


After substituting Eq. (6) into Eq. (4), and after applying the boundary conditions to it, we obtain:
p0  f ( x (0), x ' (0), x ' ' (0),..., x ( m ) (0))
p1  f ( x ( L), x ' ( L), x ' ' ( L),..., x ( m ) ( L)) (9)

Application of the boundary conditions on the derivatives of the differential Eq. (9) is:

 f ( x ' (0), x ' ' (0), x ' ' ' (0),..., x
( m 1)
(0))
p 'k :  (10)

 f ( x ' ( L), x ' ' ( L), x ' ' ' ( L),..., x
( m 1)
( L))


 f ( x ' ' (0), x ' ' ' (0), x ' ' ' ' (0),..., x
( m  2)
(0))
p ' 'k :  (11)

 f ( x ' ' ( L), x ' ' ' ( L), x ' ' ' ' ( L),..., x
( m  2)
( L))
Equations from (7) to (11), ( ) equations may be worked out, and so ( ) unknown coefficients of
Eq. (6), such as , , ,..., and can be computed. By locating the coefficients of Eq. (6), the solution
to Eq. (3) will be achieved.
2.3. Padé approximant
George Frobenius, who introduced the concept and researched the characteristics of the rational power
approximation, is credited with creating the Padé approximant, a specific and classical sort of rational
approximation. By expressing it as the quotient of two polynomials with various degrees, Henri Padé made
substantial contributions about 1890. In comparison to truncating the Taylor series, it provides a better
approximation of the function, especially in cases where the Taylor series does not converge and contains
poles. This makes it superior to the Taylor series expansion. The approximation has been widely used in
computer science to determine time delays[33-36].
Padé approximation is a ratio of two polynomials that come from the Tayler series expansion of a function
and define as [31]
∑
∑
(12)

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 105

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

where .
The function written by
∑ (13)
Also , )
thus,
∑
∑ (14)
∑

or

from Eq. (14), obtain the following system equations

solve the above system of equations for and let the numerator degree to and the denominator
degree to

Therefore; the fundamental notion of the new technique SAGPM for system (1) with initial conditions x(0)
=α ,y(0) = β is summarized according to the following steps:
Step 1: Taking Shehu transformation on both sides of (1), to get:
S( S(f(x(t),y(t), (t),…, (t))),
S( )=S(g(x(t),y(t), (t),…

using the differentiation property of Shehu transformation and the above initial conditions, we have:
X(u , v) = + S(f(x(t),y(t), (t),…, (t))),

Y(u , v) = + S(g(x(t),y(t), (t),… (15)

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 106

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

Step 2: Applying the inverse Shehu transformation on both sides of (15), to find out:
x(t) = α + ( S(f(x(t),y(t), (t),…, (t)))),

y(t) = β + ( S(g(x(t),y(t), (t),… (16)

Step 3: Considering by the AGM as polynomials series with constant coefficients as follows:
x(t) = ∑ y(t) = ∑ (17)
After substituting (17) into (3), Eq.(16) becomes as follows:
∑ =α+ ( S(f(∑ ,∑ , (t),…, (t)))),

∑ =β+ ( S( ∑ ,∑ , (t),… (18)

We apply the boundary conditions to obtain some values of the coefficients, and by continuing the
derivation of the Eq. (18) and substituting the boundary conditions, we get the rest of the values
Step 4: Applying the Padé approximation of an order [ / ] on a power series solution obtained by using
(SAGPM). The values and are arbitrarily selected. In this stage, we get the final solution.
3. Numerical experiments
In this part, three different systems corresponding to predator-prey models are solved using the new
technique.
3.1. Example 1:
The first model depicts the problem of some rabbits and foxes coexisting, with foxes preying on the bunnies
and rabbits preying on clover, and with an increase and reduction in the number of foxes and rabbits,
respectively [37]. The ordinary differential equation system shown below serves as the model's analytical
representation:
̇
} (19)
̇

with

The exact solutions are given:

,

By taking Shehu transformation on both sides of (19), we get

} (20)

Taking the inverse Shehu transformation on both side of (20), so, we get,

} (21)

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 107

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

By AGM , we must substitute (17) into (21), so, we get

∑ ( ∑ ∑ ∑ )
} (22)
∑ ( ∑ ∑ ∑ )
When =4, after simplification and offset values of , Eq. (22) becomes:
( )

( )
(23)
( )

( )
(24)
The constant coefficients of Eqs. (23) and (24) which are { } can be computed by
applying boundary conditions in the form of:
(25)

On both Eqs. (23) and (24) and its derivatives, the initial conditions are applied as follows:
( ) ( )
( )
( )
( )
( )
( )
( )

With the help of Maple software, unknown constant coefficients and can now be found by solving the
above equations, these coefficients are illustrated below:
=3/4

Then, = 2+ (26)

Now, take the Padé approximant of Eq. (26) ,with = 2, = 2, we get the solutions of the system (

[ ] [ ] = .

3.2. Example 2:
The second model takes into account the problem that the predator in the model is not significant from a
commercial standpoint. The prey is continuously subjected to effort harvesting, which has no direct impact
on the predator population. The availability of prey to the predator indirectly lowers the predator population.
Furthermore, it is expected that the population of prey would rise simply logistically [38]. The following
system represents this model:

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 108

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

̇ ( )
} (27)
̇ –
where
z(t) = .

For the numerical simulations of the model (27), we take

By taking Shehu transformation on both sides of (27), we get

( )
} (28)
–

Taking the inverse Shehu transformation on both sides of (28), so, we get,
( )
} (29)
–

By AGM, we must substitute (17) into (29), so, we get

∑ ∑ ( ∑ ) ∑
} (30)
∑ ∑
where
∑ ∑
∑ ∑
.

When =3, after simplification and offset values of , the Eq. (30) becomes:
( )
(31)

( ) , (32)
Where
( )( )
µ=
The constant coefficients of (31,32) which are { } can be computed by applying
boundary conditions in the form of:
(33)

On both Eqs. (31) and (32), and its derivatives, the initial conditions are applied as follows:

( )

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 109

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

( )

( )

( )

( )

( )

( )

( )

With the help of Maple software, unknown constant coefficients and can now be found by solving
equations, these coefficients are given below:

Then
} (34)

Now, take the Padé approximant of Eq. (34) ,with = 2, = 1, we get the solutions of the system (27

[ ]

[ ]

3.3. Example 3:
The final model under consideration is the non-autonomous system of ordinary differential equations called
a Lotka-Volterra model. In this model, time-varying values for the prey's growth rate, the predator's
effectiveness in catching prey, the predator's mortality rate, and the predator's rate of growth are taken into
account. It is significant to note that careful consideration must be given because this problem's coefficients
are time-varying to acquire the proper recurrence equation system for the model. In other works [37, 39], the
ordinary differential equation system shown below describes the aforementioned model:
̇
} (35)
̇
For the numerical simulations of the model (35), we take

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 110

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

The exact solution for these coefficients is

By taking Shehu transformation on both sides of (35), we get

} (36)

Taking the inverse Shehu transformation on both sides of (36), we get,

} (37)

By AGM , we must substitute (17) in (37), so, we get

∑ ( ∑ ∑ ∑ )
} (38)
∑ ( ∑ ∑ ∑ )
When =2, after simplification and offset values of , Eq. (38) becomes:
( )
(39)

( ) (40)

The constant coefficients of (39,40) which are { } can be computed by applying

boundary conditions in the form:

On both Eqs. (39,40) and its derivatives, the initial conditions are applied as follows:
( )
( )
( )
( )

With the help of Maple software, unknown constant coefficients and can now be found by solving
equations, these coefficients are as below:

Then,
} (41)

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 111

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

Now, taking the Padé approximant of Eq. (41) ,with = 0, = 2, we get the solutions of the system (

[ ]
=

[ ]
=
4. Results and discussion
This section, discusses the numerical computations for predator- prey models, which have been obtained by
the application of SAGPM. All calculations are employed by Maple 2016 software. In Tables1, 2 and 3, a
comparison was made between the errors, the central processing unit, and the rate of convergence obtained
using AGM, modified decomposition method (ADM) [38], He’s variational iteration method (VIM) [15],
Homotopy perturbation method (HPM) [37], Adomian decomposition method(ADM) [39] and SAGPM. It
was noted through the results that the proposed method is characterized by high accuracy, fewer errors, and a
lower central processing unit when compared to other methods. Fig.1 shows the comparison between the
solution offered by the new method SAGPM, AGM, ADM[38], VIM [15] and exact solutions
for for Example1.
Fig.2 shows the comparison between the solution offered by the new method SAGPM, AGM, HPM [37] and
ADM [39] for respectively for Example2.
Fig.3 shows the comparison between the solution offered by the new method SAGPM, AGM, ADM [39]
and exact solutions for by using second terms for Example 3. According to the calculations
demonstrated in the tables and figures, the SAGPM processes are particularly effective at solving prey-
predator systems, and the SAGPM is the most efficient one. It also gives high-precision solutions since it
yields good results with solution iterations and errors.
Table 1. Comparison of error, CPU time and rate of convergence between SAGPM, AGM,VIM, and ADM,
when [ ] for Example 1
Functions Errors SAGPM AGM VIM [15] ADM [38]
0.06391072710 0.4716321433 0.3006935003 0.4716321433
= 0.306515496 1.94348450 1.343979181 1.943484504
CPU(s) 0.015 0.031 0.031 0.015
Rate 8.24 0.95 0.95 0.95

Table 2. Comparison of error, CPU time and rate of convergence between SAGPM, AGM,HPM and ADM,
when [ ] for Example 2.
Functions Errors SAGPM AGM HPM [37] ADM [39]
0.01099356035 12.33180023 12.33178100 12.33086147
0.00962745319 13.41102090 13.41100000 13.41000000
CPU(s) 0.016 0.032 0.031 0.031
Rate 2.78 1.01 1.01 1.01
0.01797838041 0.1297084105 0.1296993297 0.1297223179
0.01226168904 0.1410598755 0.1410500000 0.1410750000
CPU(s) 0.015 0.031 0.016 0.016
Rate 1.22 0.55 0.55 0.55

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 112

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

Table 3. Comparison of error, CPU time and rate of convergence between SAGPM,AGM and ADM ,when
[ ] for Example 3.

Functions Errors SAGPM AGM ADM [39]

0.02399586585 0.06355437342 0.06355437342
0.596737128 1.403262872 1.403262872
CPU(s) 6.000 6.796 6.796
Rate 4.175 1.00 ------
0.02226227582 0.2027234285 0.2027234285
0.2586588672 3.458658867 3.458658867
CPU(s) 6.421 7.234 7.234
Rate 2.321 0.68 ------

Where; the measurement errors are defined as the following:

‖ ‖ √ ∑ | | ,

‖ ‖ | | ,

and the convergence rate is defined as the following:

( )
Rate =
( )

Where have represented the error in steps , and , respectively.

Fig 1. Comparison of approximate solutions obtained by SAGPM, VIM,ADM,

and AGM with exact solution for Example 1, ( ).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 113

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

A B

Fig. 2. Comparison of approximate solutions obtained by AGM,HPM,ADM and SAGPM for in A and
in B for Example 2.

A B

Fig. 3. Comparison of approximate solutions obtained by AGM,ADM and SAGPM with the exact solution
for in A and in B for Example 3.

5. Convergence analysis of SAGPM

This part, illustrates how the approximate analytical solutions from SAGPM for systems (19), (27) and (35)
converge.
Consider the system of equations in the following form:
), (42)

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 114

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

where F and G are non-linear operators. The solution by using the present approach is equivalent to the
following sequence:

∑ ∑

∑ ∑

Theorem (5.1): ( Convergence of Systems )[40]

Let H be a Hilbert space, and let F, G be an operator from H into H, and , be the exact solution of
Eq.(42). The approximate solutions

∑ ∑
and

∑ ∑
are convergence to exact solutions , respectively when
‖ ‖ ‖ ‖, { } ‖ ‖ ‖ ‖ { }

Definition (5.2): For every n { },we define

‖ ‖ ‖ ‖
‖ ‖ ‖ ‖
{ ‖ ‖ and { ‖ ‖

Corollary(5.3): From the theorem above ∑ ∑ and ∑ ∑ convergence

to exact solutions when
Now, to demonstrate how the three cases' analytical approximations converge, we have applied the corollary
as follows;
In the first example, at [ ] for , we get
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
In the second example, at [ ] for we get
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
and for

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 115

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖

In the third example, at [ ] for we get

‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖

and for
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖
‖ ‖

6. Stability analysis
The future state of a dynamical system can be described by its evolution, which is a fixed phenomenon.
Stability is often the first and most crucial problem to be addressed when trying to determine how a system
behaves. This section's goal is to look into the stability analysis of the SAGPM, which is used to solve the
prey -predator systems. The analysis of the model is largely influenced by the equilibrium point of a system
of nonlinear differential equations for the majority of dynamical systems. The eigenvalues of the Jacobian
matrix of the associated dynamical system are calculated to categorize the equilibrium locations.
In Fig.4 (A) when both > 0 and > 0 then some trajectories are almost elliptical around the point (1,1).
we begin with both the prey and predator population as very small. We have noticed from the figure that the
prey first increases because there is little predation. After a while, the predator population increase because
of a bigger food supply. This decreases the prey population as we have seen in the figure. With less
abundance of prey, the system goes back to its initial form as the predator population starts to decline once
more. Then the trajectory begins to repeat itself. In Fig.4 (B) We noted that the critical point is unstable. The
solutions are unstable near point (0,0). If the critical point is stable, this leads to the attraction of non-zero
groups to it, which leads to the extinction of both species. Therefore, the instability of this point is very
important. However, the extinction of both species is challenging to represent because the fixed point at the
origin is a saddle point, which is unstable. This is only possible if the whole population of prey is purposely
wiped off, starving the predators to death. In this straightforward model, if the predators disappeared, the
number of prey would increase unchecked. Fig.4 (C) shows some solutions approach the critical point (0,0)
as t . The critical point is stable and we naturally also see that the trajectory which corresponds to our
initial condition also approaches the critical point. That is, the solutions are stable near this point. While the
solutions are unstable near point (-2,3.5) because it is unstable.
7. Conclusion
In order to solve the predator-prey systems, a new analytical approximation method was created and used in
this study. In comparison to the existing approaches like ADM, VIM, HPM, and AGM, the numerical results

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 116

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

from the three cases show that the new technique offers good accuracy, especially for large values of time t.
We have observed from the results that the new method is a mathematical tool for solving predator-prey
models with constant or variable coefficients. Also, it is a crucial technique for solving beginning and
boundary value problems that come up in a variety of applied sciences disciplines, such as mechanics,
physics, applied mathematics, and others. It has been noted through tables and graphs that the proposed
method noticeable convergence and high accuracy compared to other methods. In addition, the new
technique is an improvement of Akbari- Ganji’s method. We will focus our future work on researching a few
fractional- order predator-prey systems.

Fig.4: Direction fields and trajectory to systems (19), (27), and (35) at and using the parameter
values and in (A), in (B),
in (C).
References
1. Lotka A.J., Elements of Physical Biology.Williams and Wilkins, Baltimore (1925).
2. Volterra V., Fluctuations in the abundance of a species considered mathematically, Nature 118, 558–560
(1926).
3. Craciun G., Nazarov F. and Pantea C., Persistence and permanence of mass-action and power- law
dynamical systems. SIAM J. Appl. Math. 73, 305–329 (2013).
4. Xie L. and Wang Y. , On a fully parabolic chemotaxis system with Lotka–Volterra competitive
kinetics.J. Math.Anal. Appl. 471, 584–598 (2019).
5. Su K., Wang C., Zhang S. and Liu S., Lotka Volterra equation based modeling of aerobic granulation
process in sequencing batch reactors. Int. Biodeterior. Biodegrad. 115, 49–54 (2016).
6. Cropp R.A. and Norbury J., Population interactions in ecology:arule-based approach to modeling
ecosystems in a mass-conserving framework. SIAM Rev. 57, 437–446 (2015).
7. Li C. and Zhu H., Canard cycles for predator–prey systems with Holling types of functional response. J.
Differ. Equ. 254, 879–910 (2013).
8. Zhu C. and Yin G., On competitive Lotka–Volterra model in random environments. J.Math.
Anal.Appl.357,154–170 (2009).
9. Badri V.,Yazdanpanah M.J. and Tavazoei M.S., Global stabilization of Lotka–Volterra systems with
interval uncertainty. IEEE Trans. Autom. Control 64, 1209–1213 (2018).
10. Murray J. D., Mathematical Biology. I: An Introduction, Springer. (2002).
11. Biazar J. and Montazeri R., A computational method for solution of the prey and predator problem,
Applied Mathematics and Computation, 163, (2), 841–847, (2005).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 117

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

12. Bougoffa L., Solvability of the predator and prey system with variable coefficients and comparison of
the results with modified decomposition, Applied Mathematics and Computation, 182, (1), 383–387,(
2006)
13. Chowdhury M. S. H., Hashim I., and Mawa S., Solution of prey predator problem by numeric analytic
technique, Communications in Nonlinear Science and Numerical Simulation, 14, (4),1008–1012, (2009).
14. Makinde O. D., Solving ratio-dependent predator-prey system with constant effort harvesting using
Adomian decomposition method, Applied Mathematics and Computation, 186, (1), 17–22, ( 2007).
15. Yusufoğlu, Elçin, and Barış E., He's variational iteration method applied to the solution of the prey and
predator problem with variable coefficients. Physics Letters A 372.21 ,3829-3835, (2008).
16. Dobromir T. D. and Hristo V. K., Nonstandard finite-difference methods for predator-prey models with
general functional response. Mathematics and Computers in Simulation, 78, (1),–11, ( 2008).
17. Erturk V. S. and Momani S., Solutions to the problem of prey and predator and the epidemic model via
differential transform method, Kybernetes, 37, (8), 1180– 1188, (2008).
18. Ghotbi, A. R., Barari A., and Ganji D. D., Solving ratio-dependent predator-prey system with constant
effort harvesting using homotopy perturbation method. Mathematical Problems in Engineering 2008, 2-
5, (2008).
19. Vijayalakshmi, T., and Rathinam S., Application of homotopy perturbation and variational iteration
methods for nonlinear imprecise prey–predator model with stability analysis. The Journal of
Supercomputing 78. (2) ,2477-2502, (2022).
20. Jawad S., Modelling, dynamics and analysis of multi-species systems with prey refuge. Msc.thesis,
Brunel University, London, (2018).
21. Ali N., Haque M., Venturino E., and Chakravarty S., Dynamics of a three species ratio-dependent food
chain model with intra-specific competition within the top predator, Comput. Biol. Med., 85, 63–74,
(2017).
22. Jawad S., Sultan D., and Winter M., The dynamics of a modified Holling-Tanner prey-predator model
with wind effect, Int. J.Nonlinear Anal. Appl., 12, 2203–2210, (2021).
23. Yasin, M. W., Ahmed, N., Iqbal, M. S., Raza, A., Rafiq, M., Eldin, E. M. T., and Khan, I.,Spatio-
temporal numerical modeling of stochastic predator-prey model. Scientific Reports,13.(1): 1990, (2023).
24. Sun, Yihuan, and Shanshan C., Stability and bifurcation in a reaction–diffusion–advection predator–prey
model. Calculus of Variations and Partial Differential Equations 62. (2), 61,1, (2023).
25. Arif, Abodayeh K., Shoaib M. and Ejaz A., On the stability of the diffusive and non-diffusive predator-
prey system with consuming resources and disease in prey species. Mathematical Biosciences and
Engineering 20.(3), 5066-5093, (2023).
26. Abdulameer, Y. A., and Al-Saif A. S. J. A., A well-founded analytical technique to solve 2D viscous
flow between slowly expanding or contracting walls with weak permeability. Journal of Advanced
Research in Fluid Mechanics and Thermal Sciences 97. (2), 39-56 (2022).
27. Abdoon M.A., and Hasan F.L. Advantages of the differential equations for solving problems in
mathematical physics with symbolic computation. Mathematical modelling of engineering problems 9,
(1), 268-276, (2022).
28. Hasan Z. A. and Al-Saif A.S. J. A hybrid method with RDTM for solving the biological population
model. Mathematical Theory and Modeling. 12.(2), 1, (2022).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 118

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 08 | Aug 2023

29. Al‐Griffi, T. A. J., and Al‐Saif A. S. J. Yang transform–homotopy perturbation method for solving a
non‐Newtonian viscoelastic fluid flow on the turbine disk. ZAMM‐Journal of Applied Mathematics and
Mechanics/Zeitschrift für Angewandte Mathematik und Mechanik 102. e202100116, (2022).
30. Mirgolbabaee H., Ledari S. T. and Ganji D. D., Semi-analytical investigation on micropolar fluid flow
and heat transfer in a permeable channel using AGM, Journal of the Association of Arab Universities for
Basic and Applied Sciences, 24:213-222, (2017).
31. Wu B. and Qian Y., Padé approximation based on orthogonal polynomial, Advances in Computer
Science Research. 58, 249- 252, (2016).
32. Maitama S. and Zhao W., New integral transform: Shehu transform a generalization of Sumudu and
Laplace transform for solving differential equations. arXiv preprint arXiv1904.11370, (2019).
33. Boyd J., Padé Approximant algorithm for solving nonlinear ordinary differential equation boundary
value problems on an unbounded domain. Computers in Physics, 11, (3), 299- 303, (1997).
34. Wazwaz A.M., Analytical approximations and Padé approximants for Volterra’s population model.
Applied Mathematics and Mathematical Computation, 100, 31-35, (1999).
35. Wazwaz A.M., The Modified decomposition method and Pade’s approximants for solving Thomas-
Fermi equation. Applied Mathematics and Mathematical Computations, 105, 11- 19, (1999).
36. Momani S., Rami Q., Numerical approximation and Padé approximation for a fractional population
growth model, 31, 1907-1914, (2007).
37. Ghotbi, A. R., Barari, A., and Ganji, D., Solving ratio-dependent predator-prey system with constant
effort harvesting using homotopy perturbation method. Mathematical Problems in Engineering, (2008).
38. Bougoffa L., Solvability of the predator and prey system with variable coefficients and com- parison of
the results with modified decomposition, Applied Mathematics and Computation,182, (1),383–387,
(2006).
39. Makinde O. D., Solving ratio-dependent predator-prey system with constant effort harvesting using
Adomian decomposition method, Applied Mathematics and Computation, 186, (1), 17–22, (2007).
40. Al-Jaberi, A. K., Abdul-Wahab, M. S., and Buti R. H., A new approximate method for solving linear and
non-linear differential equation systems. In AIP Conference Proceedings, 2398, (1), 060082,14, (2022).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 119