A Reliable Algorithm for Solving System of Multi-Pantograph Equations
RANIA SAADEH
Department of Mathematics,
Zarqa University,
Zarqa 13110,
JORDAN
Abstract. In this article, a new series solution of a system of pantograph equations is established using the residual
power series method (RPSM). The proposed method produces the solution in terms of a convergent infinite series,
requiring no linearization, perturbation or discretization, in some cases it reproduces the exact solutions. We apply
the RPSM to solve the multi-pantograph equations, and we show that the outcomes are very accurate. Some
examples are given to demonstrate the simplicity and efficiency of the proposed method. Comparisons to the
Laplace decomposition approach are made to verify the efficiency and applicability of the presented method in
solving similar problems.
Key-words: Residual power series method; Pantograph equations; System of initial value problems.
Received: September 24, 2022. Revised: October 28, 2022. Accepted: November 9, 2022. Published: December 1, 2022.
1 Introduction
The pantograph equation, which is one of the most
important kinds of delay differential equations, [1],
[2], [3], [4], [5] and [6], has been studied extensively
owing to the numerous applications in which these
equations arise. The name pantograph originated
from the work of the researchers, [1], on the
collection of current by the pantograph head of an
electric locomotive, this equation appeared in
modeling various problems in engineering and
sciences such as biology, economy, control,
population studies and electrodynamics, [7], [8], [9],
[10].
In the last years, extensive work dealt with the
pantograph equation. Several methods have been
used to solve different types of the pantograph
equation, such as Adomian's decomposition method,
[5], [6], the homotopy perturbation method [7],
Variational iteration method, [8], [9], Runge–Kutta
methods, [10], the reproducing kernel space method,
[11], Taylor polynomials approach, [12], [13], one-
leg -methods [14], Spectral methods, [15],
differential transformation method, [16],
Discontinuous Galerkin methods, [17], Bessel matrix
and collocation methods, [18], [19], Chebyshev
polynomials method, [20], Laplace decomposition
algorithm (LDA) [21], [22], and so on [23], [24],
[25], [26], [27], [28], [29], [30].
The purpose of this paper is to extend the
application of the residual power series (PSR)
method [31], [32] to provide a symbolic approximate
solution for a system of multi-pantograph equations:
󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜
󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜

󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜
(1.1)
Subject to the initial conditions
󰇛󰇜, (1.2)
(1.2)
Where are constants, are analytical
functions, and  .
The RPS was developed in [31] as an efficient
method for determining the coefficients of the power
series solution of the first and second-order fuzzy
differential equation. It has been successfully applied
in the numerical solution of the generalized Lane-
Emden equation, which is a highly nonlinear
problem, [32]. The RPS method is effective and easy
to construct a power-series solution for strongly
linear and nonlinear equations without linearization,
perturbation, or discretization. In contrast to the
classical power series (CPS) methods, the RPS
method does not need to compare the coefficients of
the corresponding terms, and a recursion relation is
not required. This method computes the coefficients
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
792
Volume 21, 2022
of the power series by a chain of linear equations of
one variable. The RPS method is an alternative
procedure for obtaining an analytic Taylor series
solution of the system of multi-pantograph equations.
By using residual error concept, we get a series
solution, in practice a truncated series solution. For
linear problems, the exact solution can be obtained
by a few terms of the RPS method solution. As we
shall see later, the exact solution is available when
the solution is polynomial. Moreover, the solutions
and all their derivatives are applicable for each
arbitrary point in the given interval. It does not
require any converting while switching from the first
order to the higher order; as a result, the method can
be applied directly to the given problem by choosing
an appropriate value for the initial guess
approximation.
This paper is organized as follows: in the next
section, we state some definitions and theorems that
help us to construct the proposed method. In section
3, we present the basic idea of the power series
method. In section 4 we extend the PSR method to
provide a symbolic approximate series solution for a
system of multi-pantograph equations. In section 5,
numerical examples are given to illustrate the
capability of the proposed method. Section 6 is the
brief conclusion of this paper. Finally, some
references are listed at the end.
2 Preliminaries
In this section, we introduce some definitions and
theorems related to Taylor's series and analytic
functions.
Definition 2.1. A function is called analytic at
, where I is an open interval, if it can be represented
in a form of a power series as
󰇛󰇜
󰇛󰇜
 . (2.1)
Taking we get the Maclaurin series
󰇛󰇜
 
Theorem 2.1 [22] There are only three possibilities
for the convergence conditions of the power series
(2.1):
(i) The series converges only when and the
radius of convergence is zero..
(ii) The series converges for all, and the radius
of convergence is .
(iii) There is a positive number such that the
series converges if and diverges
if.
Here is called the radius of convergence.
Theorem 2.2. [22] If has a power series
representation as follows:
󰇛󰇜󰇛󰇜

Then its coefficients  are given by the formula:
󰇛󰇜󰇛󰇜

Theorem 2.3 (Convergence Analysis) [22]
If we have  and 󰇛󰇜
󰇛󰇜for all and  then the
series of the numerical solutions converges to the
exact solution.
3 Adapting RPSM to Solve Multi-
Pantograph Equations
In this section, we introduce the procedure of using
RPSM in solving multi pantograph systems (1.1) and
(1.2).
We present a simple algorithm that explains the
method and illustrates the steps of the RPSM in
handling the proposed problem.
To apply the RPSM, we firstly assume that the
solutions of system (1.1) and (1.2) have the forms:
(3.1)
Where  
Since 󰇛󰇜 satisfies the initial conditions (1.2),
󰇛󰇜are the zeroth RPS solutions of the
IVP (1.1) and (1.2).Thus, the solutions have the
form:
(3.2)
And the th-approximate solutions will be:
(3.3)
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
793
Volume 21, 2022
Following that, we define the th-residual functions
of system (1.1) as:
󰇛󰇜
󰆒󰇛󰇜󰇛󰇜
󰇧󰇛󰇜󰇛󰇜
󰇛󰇜󰇨 (3.4)

(3.4)
And the following residual functions:
󰇛󰇜
󰇛󰇜
󰆒󰇛󰇜󰇛󰇜
󰇛󰇜󰇛󰇜󰇛󰇜
(3.5)
It is obvious that: Res󰇛󰇜 for each 󰇛󰇜
where is the radius of convergence of the power
series (3.1). This shows that these residual functions
are infinitely many times differentiable at . On
the other hand,

󰇛󰇜
󰇛󰇜 (3.6)
In fact, these relations are fundamental rules in
RPSM, for the proof and more details, see [31], [32].
Moreover, a special case of (3.6) is:

󰇛󰇜
 (3.7)
In order to obtain the th-approximate solutions of
system (1.1) and (1.2), we substitute the th-
truncated series (3.3) into Eq. (3.4) to get:
󰇛󰇜

 


 



 (3.8)
To obtain the first approximate solution, we
substitute and into Eq. (3.8), and using
(3.7):
󰇛󰇜, , we get:
󰇛󰇜
󰇛󰇜
.
Thus, the first approximation for the system of multi-
pantograph equations (1.1) and (1.2) can be
expressed as:
󰇛󰇜󰇡󰇛󰇜󰇢
.
Similarly, to find the second approximation, we
differentiate both sides of (3.8) with respect to and
substitute and to get:

󰇛󰇜



 





According to (3.7), we have the values of  as
follows:






 



Thus, the second approximation for the system of multi-
pantograph equations (1.1) and (1.2) will be:
󰇛󰇜󰇡󰇢



 




Completing in the same manner, we can obtain the
rest of the coefficients recursively. Thus the series
solution of
of the multi-pantograph equations (1.2) and (1.2) are
obtained. Moreover, higher accuracy can be achieved
by evaluating more components of the solution.
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
794
Volume 21, 2022
4 Numerical Example and Discussion
In this section, we consider four interesting examples
of the multi pantograph equations, we apply the
RPSM to solve them and analyze the results. The
results demonstrate the efficiency and accuracy of the
presented technique. We mention that all numerical
computations are performed using Mathematica 
software package.
Example 4.1. Consider the two-dimensional
pantograph equations:
󰆒󰇛󰇜󰇛󰇜󰇛󰇜

󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇡
󰇢
 (4.1)
Subject to the initial conditions:
󰇛󰇜󰇛󰇜. (4.2)
The exact solution of system (4.1) and (4.2) is
󰇛󰇜, 󰇛󰇜.
According to the residual functions (3.5), we obtain:
Res󰇛󰇜󰆒󰇛󰇜󰇛󰇜󰇛󰇜

Re󰇛󰇜󰆒󰇛󰇜󰇛󰇜󰇛󰇜

(4.3)
According to the initial conditions (4.2), we can
determine the first coefficients of the power series as:
󰇛󰇜
and
󰇛󰇜.
Hence, the power series solution of system (4.1) can
be expressed as:
󰇛󰇜
󰇛󰇜
It is clear that the first approximations of the series
solution for system (4.1) and (4.2) is of the form:
󰇛󰇜
󰇛󰇜 (4.4)
To find the values of the coefficients  and , we
substitute the equations in system (4.4) into (4.3) to
get the following st-residual functions of Eqs. (4.1):

󰇛󰇜



󰇛󰇜


(4.5)
Setting in (4.5) and use the fact (3.6), then we
obtain  and 
Thus, the first approximations of the series solution
of (4.1) and (4.2) are:
󰇛󰇜
󰇛󰇜
The second approximations of the series solution of
(4.1) and (4.2) have the forms: 󰇛󰇜 (4.6)
󰇛󰇜
In order to find the values of the coefficients, and
, we substitute (4.6) into (4.3) to get the form of
the nd-residual functions of (4.1) which is:

󰇛󰇜󰇡
󰇢󰇡
󰇢


󰇛󰇜󰇡
󰇢󰇡
󰇢
. (4.7)
Differentiate the both sides of Eqs. (4.7) with respect
to as follows:
Res
󰆒󰇛󰇜


Re󰆒󰇛󰇜

󰇛󰇜
Substituting in (4.8) and using the fact in (3.6)
leads to 
, and 
.
Thus, the second approximations of the series
solution of (4.1) and (4.2) can be written as:
󰇛󰇜

󰇛󰇜
 (4.9)
Continuing with similar fashion, the series solutions
of 󰇛󰇜and 󰇛󰇜 will be:
󰇛󰇜

󰇛󰇜
(4.10)
The closed form of above solutions, when are
󰇛󰇜 , 󰇛󰇜 which are the exact
solutions.
Example 4.2. Consider the system of multi-
pantograph equations [21]:
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
795
Volume 21, 2022
󰆒󰇛󰇜󰇛󰇜


󰆒󰇛󰇜󰇡
󰇢󰇡
󰇢(4.11)
Subject to the initial conditions: 󰇛󰇜󰇛󰇜 (4.12)
According to residual functions in (3.5), we obtain:
Res󰇛󰇜󰆒󰇛󰇜󰇛󰇜


Re󰇛󰇜󰆒󰇛󰇜
(4.13)
The first approximations of the series solution of
(4.11) and (4.12) have the form:
󰇛󰇜
󰇛󰇜 (4.14)
To find the values of the coefficients and ,
substitute Eqs. (5.14) into Eqs. (5.13) to obtain the
st-residual function which of the form:

󰇛󰇜



󰇛󰇜󰇡
󰇢󰇡
󰇢
(4.15)
If we set in Eq. (5.15) and use the fact
󰇛󰇜, then we obtain , and
. Thus, the first approximations of the series
solution for Eqs. (5.11) and (5.12) are:
󰇛󰇜
󰇛󰇜 (4.16)
By continuing with the similar arguments of Example
(4.1), we get the series solutions of 󰇛󰇜and 󰇛󰇜
as follows:
󰇛󰇜





󰇛󰇜



(4.17)
Which are the expansions of the exact solutions:
󰇛󰇜 , 󰇛󰇜.
Example 4.3. Consider the following system of
multi-pantograph equations:
󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜

󰆒󰇛󰇜󰇛󰇜󰇡
󰇢󰇛󰇜

 (4.18)
Subject to the initial conditions: 󰇛󰇜󰇛󰇜 (4.19)
Which have the exact solution:
󰇛󰇜, 󰇛󰇜.
As in the previous examples, the initial guesses
approximation as:
󰇛󰇜
And
󰇛󰇜,
Then the power series expansions of the solution take
the form:
󰇛󰇜
󰇛󰇜 (4.20)
Consequently, the first approximations of the series
solution of (4.18) and (4.19) are: 󰇛󰇜
󰇛󰇜 (4.21)
and thest-residual functions of Eqs. (4.19) are:

󰇛󰇜󰇛󰇜


󰇛󰇜

󰇛󰇜 (4.22)
Setting in (4.21) and using the fact in (3.7), one
can get  and 
Thus, the second approximations of the series
solutions of (4.18) and (4.19) are:
󰇛󰇜
󰇛󰇜 (4.23)
and the nd –residual functions of (4.18) are:

󰇛󰇜󰇛󰇜


󰇛󰇜

󰇛󰇜
(4.24)
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
796
Volume 21, 2022
Using the fact in (3.7) for reduces a system of
two linear equations with two variables  and .
The solution of this system gives  and 
.
It is easy to discover that each of the coefficients
 and  for in the expansions (4.20)
vanished. In other words, we have:

 
  (4.25)
Thus, the analytic approximate solution of system
(4.18) and (4.19) coincide with the exact solution,
which is a powerful merit in RPSM, that is it gives
the exact solution if it is a polynomial.
Example 4.4. Consider the three-dimensional
pantograph equations :
󰆒󰇛󰇜󰇛󰇜
󰆒󰇛󰇜󰇛󰇜
󰆒󰇛󰇜󰇛󰇜󰇛󰇜󰇛󰇜 (4.26)
Subject to the initial conditions:
󰇛󰇜󰇛󰇜󰇛󰇜 (4.27)
Which has the exact solution󰇛󰇜,
󰇛󰇜 and 󰇛󰇜.
Repeating the same steps in the previous examples,
we can find the numerical solution of system (4.26)
and (4.27) as:
󰇛󰇜





󰇛󰇜



󰇛󰇜



(4.28)
For the third example which are the exact solutions
󰇛󰇜 , 󰇛󰇜 and , 󰇛󰇜.
To show the accuracy of the presented method, we
report two types of errors. The first one is the
residual error, and defined as:
󰇛󰇜󰈏

󰇛󰇜
󰇛󰇜
󰇭󰇧
󰇛󰇜
󰇛󰇜

󰇛󰇜󰇨󰇮󰈏 (4.29)
While the exact error, is defined, by:
󰇛󰇜󰇛󰇜
󰇛󰇜 (4.30)
Where, 
is the th-order approximation of 󰇛󰇜
obtained by the RPS method, and 󰇛󰇜 is the exact
value of 󰇛󰇜, . We introduce Table 1,
Table 2 and Table 3, below to show the related errors of
󰇛󰇜󰇛󰇜󰇛󰇜
Without loss of generality, we will test the accuracy of
the presented method for the fourth example.
In Table 1,2 and 3, the residual errors, exact errors and
the exact errors obtained by the Laplace decomposition
algorithm (LDA), [21], have been calculated for various
values of in 󰇟󰇠 to compare the th-order
approximate RPS method solution with LDA. From the
tables, it can be seen that the RPS method provides us
with the accurate approximate solution of system (4.26)
and (4.27). Moreover, we can control the error also by
evaluating more components of the solution.
Table 1. Exact and residual error of󰇛󰇜 of Example (4.4)
Exact Error(LDA)
Exact Error(RPS)
Residual Error(RPS)




















WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
797
Volume 21, 2022
Table 2. Exact and residual error of󰇛󰇜 of Example (4.4)
Exact Error(LDA)
Exact Error(RPS)
Residual Error(RPS)




















Table 3. Exact and residual error of󰇛󰇜 of Example (4.4)
Exact Error(LDA)
Exact Error(RPS)
Residual Error(RPS)




















5 Conclusion
The aim of this work is to propose an efficient
algorithm of the solution of the system of pantograph
equations. We extended the RPS method to solve this
class of systems of IVPs. We conclude that the RPS
method is a powerful and efficient technique in
constructing approximate series solutions of linear
and nonlinear IVPs of different types. The proposed
algorithm produced a rapidly convergent series
without requiring perturbations, discretization, or
other restrictive assumptions which may change the
structure of the problem being solved. We believe
that the efficiency of the RPS method gives it a much
wider applicability. In the future, we will expand the
applications of the presented method to solve more
physical and engineering problems.
References:
[1] J.R. Ockendon, A.B. Tayler, The dynamics of a
current collection system for an electric
locomotive, Proc. R. Soc. Lond. Ser. A. 322
(1971) 447-468.
[2] Saadeh R, Burqan A, El-Ajou A. Reliable
solutions to fractional Lane-Emden equations
via Laplace transform and residual error
function. Alexandria Engineering Journal.
2022 Dec 1;61(12):10551-62.
[3] Abu-Ghuwaleh M, Saadeh R, Qazza A. A
Novel Approach in Solving Improper Integrals.
Axioms. 2022 Oct 20;11(10):572.
[4] Abu-Ghuwaleh M, Saadeh R, Qazza A.
General Master Theorems of Integrals with
Applications. Mathematics. 2022 Sep
28;10(19):3547.
[5] D.J. Evans, K.R. Raslan, The Adomian
decomposition method for solving delay
differential equation, Int. J. Comput. Math. 82
(1) (2005) 49–54.
[6] Dehghan M, Shakeri F. The use of the
decomposition procedure of Adomian for
solving a delay differential equation arising in
electrodynamics. Phys Scr 2008;78. Article
No. 065004, 11 pages.
[7] Shakeri F, Dehghan M. Solution of delay
differential equations via a homotopy
perturbation method. Math Comput Model
2008;48:486–98.
[8] Zhan-Hua Yu, Variational iteration method for
solving the multi-pantograph delay equation,
Phys. Lett. A, 372 (2008) 6475–6479.
[9] A. Saadatmandi, M. Dehghan, Variational
iteration method for solving a generalized
pantograph equation, Comput. Math. Appl. 58
(11–12) (2009) 2190–2196.
[10] Zhao JJ, Xu Y, Wang HX, Liu MZ. Stability of
a class of Runge–Kutta methods for a family
pantograph equations of neutral type. Appl
Math Comput 2006;181:1170–81.
[11] Saadeh R. Numerical algorithm to solve a
coupled system of fractional order using a
novel reproducing kernel method. Alexandria
Engineering Journal. 2021 Oct 1;60(5):4583-
91.
[12] M. Sezer, A. Akyuz-Dascioglu, A Taylor
method for numerical solution of generalized
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
798
Volume 21, 2022
pantograph equations with linear functional
argument, J. Comput. Appl. Math. 200 (2007)
217-225.
[13] Sezer M, Yalcinbas S, Gulsu M. A Taylor
polynomial approach for solving generalized
pantograph equations with nonhomogenous
term. Int J Comput Math 2008;85:1055–1063.
[14] Wang WS, Qin T, Li SF. Stability of one-leg
-methods for nonlinear neutral differential
equations with proportional delay. Appl Math
Comput,2009;213:177–83.
[15] Ishtiaq A, Brunner H, Tang T. Spectral
methods for pantograph-type differential and
integral equations with multiple delays. Front
Math China 2009;4:49–61.
[16] Nemat Abazari, Reza Abazari, Solution of
nonlinear second-order pantograph equations
via differential transformation method, World
Academy of Science, Engineering and
Technology 58 2009.
[17] Brunner H, Huang Q, Xies H. Discontinuius
Galerkin methods for delay differential
equations of pantograph type. SIAM J Numer
Anal,48 (2010) 67-1944.
[18] Ş. Yüzbaşı, N. Şahin, M. Sezer, A Bessel
collocation method for numerical solution of
generalized pantograph equations, Numer.
Methods Partial Differential Equations (2011),
(doi:10.1002/num.20660) (in press).
[19] Şuayip Yüzbaşi, An efficient algorithm for
solving multi-pantograph equation systems,
Computers and Mathematics with
Applications, in press.
[20] S. Sedaghat, Y. Ordokhani, Mehdi Dehghan,
Numerical solution of the delay differential
equations of pantograph type via Chebyshev
polynomials, Commun Nonlinear Sci Numer
Simulat, 17 (2012) 4815–4830.
[21] Sabir Widatalla, and Mohammed Abdulai
Koroma, Approximation Algorithm for a
System of Pantograph Equations, Journal of
Applied Mathematics, Volume 2012, Article
ID 714681, 9 pages, doi:10.1155/2012/714681.
[22] Moa’ath NO, El-Ajou A, Al-Zhour Z, Eriqat T,
Al-Smadi M. A New Approach to Solving
Fuzzy Quadratic Riccati Differential
Equations. International Journal of Fuzzy
Logic and Intelligent Systems. 2022 Mar
25;22(1):23-47.
[23] Abu-Arqub, Omar, et al. "Analytical solutions
of fuzzy initial value problems by
HAM." Applied Mathematics & Information
Sciences 7.5 (2013): 1903M. Arnold, B.
Simeon, Pantograph and catenary dynamics: A
benchmark problem and its numerical solution,
Appl. Numer. Math, 34 (2000) 345-362.
[24] Hasan S, El-Ajou A, Hadid S, Al-Smadi M,
Momani S. Atangana-Baleanu fractional
framework of reproducing kernel technique in
solving fractional population dynamics system.
Chaos, Solitons & Fractals. 2020 Apr
1;133:109624.
[25] Burqan, A.a, et al. "A new efficient
technique using Laplace transforms and
smooth expansions to construct a series
solution to the time-fractional Navier-Stokes
equations." Alexandria Engineering
Journal 61.2 (2022): 1069-1077.
[26] Burqan, A., Saadeh, R., Qazza, A., &
Momani, S. (2023). ARA-residual power series
method for solving partial fractional
differential equations. Alexandria Engineering
Journal, 62, 47-62.
[27] Saadeh, R., Qazza, A., & Amawi, K. (2022).
A New Approach Using Integral Transform to
Solve Cancer Models. Fractal and
Fractional, 6(9), 490.
[28] El-Ajou, A., Moa'ath, N. O., Al-Zhour, Z., &
Momani, S. (2019). Analytical numerical
solutions of the fractional multi-pantograph
system: Two attractive methods and
comparisons. Results in Physics, 14,
102500Liu MZ, Li DS. Properties of analytic
solution and numerical solution of multi-
pantograph equation. Appl Math Comput
2004;155:853–871.
[29] Sarhan A, Burqan A, Saadeh R, Al-Zhour Z.
Analytical Solutions of the Nonlinear Time-
Fractional Coupled Boussinesq-Burger
Equations Using Laplace Residual Power
Series Technique. Fractal and Fractional. 2022
Oct 29;6(11):631.
[30] H. Brunner and Q.-Y. Hu, Optimal super
convergence results for delay integro-
differential equations of pantograph type,
SIAM J. Numer. Anal., 45 (2007), 986-1004.
[31] Salah E, Qazza A, Saadeh R, El-Ajou A. A
hybrid analytical technique for solving multi-
dimensional time-fractional Navier-Stokes
system. AIMS Mathematics. 2023;8(1):1713-
36.
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
799
Volume 21, 2022
[32] O. Abu Arqub, A El-Ajou, A. Bataineh, I.
Hashim, A representation of the exact solution
of generalized Lane-Emden equations using a
new analytical method, Abstract and Applied
Analysis, In press.
Creative Commons Attribution License 4.0
(Attribution 4.0 International, CC BY 4.0)
This article is published under the terms of the
Creative Commons Attribution License 4.0
https://creativecommons.org/licenses/by/4.0/dee
d.en_US
WSEAS TRANSACTIONS on MATHEMATICS
DOI: 10.37394/23206.2022.21.91
Rania Saadeh
E-ISSN: 2224-2880
800
Volume 21, 2022