# A Pseudospectral Algorithm for Solving Multipantograph Delay Systems on a Semi-Infinite Interval Using Legendre Rational Functions

Authors: E. H. Doha; D. Baleanu; A. H. Bhrawy; R. M. Hafez
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

A new Legendre rational pseudospectral scheme is proposed and developed for solving numerically systems of linear and nonlinear multipantograph equations on a semi-infinite interval. A Legendre rational collocation method based on Legendre rational-Gauss quadrature points is utilized to reduce the solution of such systems to systems of linear and nonlinear algebraic equations. In addition, accurate approximations are achieved by selecting few Legendre rational-Gauss collocation points. The numerical results obtained by this method have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively limited nodes used, the absolute error in our numerical solutions is sufficiently small.


---

## Body

## 1. Introduction

Over the last three decades, the scientists have paid much attention to spectral methods due to their high accuracy (see, for instance, [1–6] and the references therein). On the other hand, spectral methods, in the context of numerical schemes for differential equations, generically belong to the family of weighted residual methods (WRMs) (cf. Finlayson [7]). WRMs represent a particular group of approximation techniques, in which the residuals (or errors) are minimized in a certain way and thereby leading to specific methods including Galerkin, Petrov-Galerkin, collocation, and tau formulations. WRMs are traditionally regarded as the foundation and cornerstone of the finite element, spectral, finite volume, boundary element, and some other methods. Many problems in science and engineering arise in unbounded domains (see, e.g., [8–12]). In general, the use of Jacobi rational functions has the advantage of obtaining the solutions in terms of the Jacobi rational parameters (see, e.g., [13–16]). Moreover, the authors of [17, 18] proposed an efficient collocation schemes based on the operational matrices of rational Legendre and Chebyshev functions for solving problems in the half line.Systems of multipantograph equations model many real-life phenomena in physics and biology. Numerous numerical and analytical schemes have been presented and developed for solving such multipantograph equations, like variational iteration [19], Bernstein collocation [20], spline [21], homotopy perturbation [22], and Taylor collocation [23, 24] methods. This problem has been the focus of many studies; see, for instance, [21, 25–29].The main aim of this paper is to develop the spectral-Gauss collocation integration process based on Legendre rational functions for solving systems of linear and nonlinear multipantograph equations on the half line. The implementation of this method reduces the problem to systems of linear and nonlinear algebraic equations. The numerical simulation of multipantograph systems on a semi-infinite domain is investigated. Finally, the accuracy and applicability of the proposed method are demonstrated by test problems. Numerical results are given in which the exponential convergence behaviour is exhibited.This paper is organized as follows. We present few revelent properties of Legendre rational functions and function approximation in the coming section. In Sections3 and 4, the pseudospectral algorithms are implemented for solving systems of linear and nonlinear multipantograph equations. Two test examples are introduced in Section 5. Finally, some concluding remarks are given in the last section.


## 2. Legendre Rational Interpolation

In this section, we present Legendre rational functions and Legendre rational approximation that will be used to construct the Legendre rational-Gauss collocation (LR-GC) method.


### 2.1. Legendre Rational Functions

The well-known Legendre polynomialsL
k
(
y
) are defined on the interval [
-
1,1
] with respect to the weight function ρ
(
y
)
=
1. In order to use these polynomials on the interval t
∈
(
0
,
∞
), we recall the Legendre rational functions by introducing the change of variable y
=
(
t
-
1
)
/
(
t
+
1
). Let the Legendre rational functions L
k
(
(
t
-
1
)
/
(
t
+
1
)
) be denoted by R
k
(
t
). Then R
k
(
t
) can be obtained with the aid of the following recurrence formula:
(1)
R
0
=
1
,
R
1
(
t
)
=
t
-
1
t
+
1
,
R
k
+
1
(
t
)
=
(
2
k
+
1
k
+
1
)
(
t
-
1
t
+
1
)
R
k
(
t
)
-
(
k
k
+
1
)
R
k
-
1
(
t
)
,
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
i
k
≥
1
.
According to the properties of the standard Legendre polynomials, we have
(2)
R
k
(
0
)
=
(
-
1
)
k
,
(3)
∂
t
R
k
(
t
)
=
(
k
+
1
)
2
t
(
t
+
1
)
[
(
t
-
1
)
R
k
(
t
)
-
(
t
+
1
)
R
k
+
1
(
t
)
]
.


### 2.2. Function Approximation

Letw
(
t
)
=
2
/
(
t
+
1
)
2 denote a nonnegative, integrable, real-valued function over the interval Λ
=
[
0
,
∞
). We define
(4)
L
w
2
(
Λ
)
=
{
v
:
Λ
⟶
R
∣
v
is
measurable
and
∥
v
∥
w
<
∞
}
,
where
(5)
∥
v
∥
w
=
(
∫
0
∞
‍
|
v
(
t
)
|
2
w
(
t
)
d
t
)
1
/
2
is the norm induced by the inner product of the space L
w
2
(
Λ
):
(6)
〈
u
,
v
〉
w
=
∫
0
∞
‍
u
(
t
)
v
(
t
)
w
(
t
)
d
t
.
Thus, {
R
k
(
t
)
}
k
≥
0 denotes a system which is mutually orthogonal under (6); that is,
(7)
〈
R
k
,
R
l
〉
w
=
2
2
k
+
1
δ
k
l
,
where δ
k
l is the Kronecker delta function. This system is complete in L
w
2
(
Λ
). For any function u
∈
L
w
2
(
Λ
) the following expansion holds:
(8)
u
(
t
)
=
∑
k
=
0
∞
a
k
R
k
(
t
)
,
with
(9)
a
k
=
〈
u
,
R
k
〉
w
∥
R
k
∥
w
2
.


### 2.3. Legendre Rational Interpolation Approximation

We denote byt
N
,
j, 0
⩽
j
⩽
N, the nodes of the standard Legendre-Gauss interpolation on the interval [
-
1,1
], and ϖ
N
,
j, 0
⩽
j
⩽
N are Christoffel numbers. The nodes of the Legendre rational-Gauss interpolation on the interval [
0
,
∞
) are the zeros of R
N
+
1
(
t
), which is denoted by t
R
,
N
,
j, 0
⩽
j
⩽
N. It is clear that t
R
,
N
,
j
=
(
1
+
t
N
,
j
)
/
(
1
-
t
N
,
j
), and ϖ
R
,
N
,
j
=
ϖ
N
,
j, 0
⩽
j
⩽
N. We now set S
N
(
0
,
∞
)
=
span
⁡
{
R
0
(
t
)
,
R
1
(
t
)
,
…
,
R
N
(
t
)
}. Therefore, making use of the property of the Legendre-Gauss quadrature, we have for any ϕ
∈
S
2
N
+
1
[
0
,
∞
),
(10)
∫
0
∞
w
(
t
)
ϕ
(
t
)
d
t
=
∫
-
1
1
ρ
(
y
)
ϕ
(
1
+
y
1
-
y
)
d
y
=
∑
j
=
0
N
‍
ϖ
R
,
N
,
j
ϕ
(
t
R
,
N
,
j
)
.The interpolating function of a smooth functionu on a semi-infinite interval is denoted by P
N
u. It is an element of R
N and is defined as
(11)
P
N
u
(
t
)
=
∑
0
N
‍
a
k
R
k
(
t
)
.P
N
u is the orthogonal projection of u upon R
N with respect to the inner product (6) and the norm (5). Thus by the orthogonality of Legendre rational functions we have [11]
(12)
〈
P
N
u
-
u
,
R
i
〉
w
=
0
,
∀
R
i
∈
R
N
.To obtain the order of convergence of Legendre rational approximation, at first we define the space(13)
H
w
,
A
r
(
Λ
)
=
{
v
:
v
is
measurable
and
∥
v
∥
r
,
w
,
A
<
∞
}
,
where the norm is induced by
(14)
∥
v
∥
r
,
w
,
A
=
(
∑
k
=
0
r
‍
∥
(
t
+
1
)
r
/
2
+
k
d
k
d
t
k
v
∥
w
2
)
,
and A is the Sturm-Liouville operator as follows:
(15)
A
v
(
t
)
=
-
w
-
1
(
t
)
d
d
t
(
t
d
d
t
v
(
t
)
)
.
We have the following theorem for the convergence.Theorem 1.
For anyv
∈
H
w
,
A
r
(
Λ
) and r
≥
0,
(16)
∥
P
N
v
-
v
∥
≤
c
N
-
r
∥
v
∥
r
,
w
,
A
.A complete proof of the theorem and discussion on convergence are given in [11].


## 2.1. Legendre Rational Functions

The well-known Legendre polynomialsL
k
(
y
) are defined on the interval [
-
1,1
] with respect to the weight function ρ
(
y
)
=
1. In order to use these polynomials on the interval t
∈
(
0
,
∞
), we recall the Legendre rational functions by introducing the change of variable y
=
(
t
-
1
)
/
(
t
+
1
). Let the Legendre rational functions L
k
(
(
t
-
1
)
/
(
t
+
1
)
) be denoted by R
k
(
t
). Then R
k
(
t
) can be obtained with the aid of the following recurrence formula:
(1)
R
0
=
1
,
R
1
(
t
)
=
t
-
1
t
+
1
,
R
k
+
1
(
t
)
=
(
2
k
+
1
k
+
1
)
(
t
-
1
t
+
1
)
R
k
(
t
)
-
(
k
k
+
1
)
R
k
-
1
(
t
)
,
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
a
i
k
≥
1
.
According to the properties of the standard Legendre polynomials, we have
(2)
R
k
(
0
)
=
(
-
1
)
k
,
(3)
∂
t
R
k
(
t
)
=
(
k
+
1
)
2
t
(
t
+
1
)
[
(
t
-
1
)
R
k
(
t
)
-
(
t
+
1
)
R
k
+
1
(
t
)
]
.


## 2.2. Function Approximation

Letw
(
t
)
=
2
/
(
t
+
1
)
2 denote a nonnegative, integrable, real-valued function over the interval Λ
=
[
0
,
∞
). We define
(4)
L
w
2
(
Λ
)
=
{
v
:
Λ
⟶
R
∣
v
is
measurable
and
∥
v
∥
w
<
∞
}
,
where
(5)
∥
v
∥
w
=
(
∫
0
∞
‍
|
v
(
t
)
|
2
w
(
t
)
d
t
)
1
/
2
is the norm induced by the inner product of the space L
w
2
(
Λ
):
(6)
〈
u
,
v
〉
w
=
∫
0
∞
‍
u
(
t
)
v
(
t
)
w
(
t
)
d
t
.
Thus, {
R
k
(
t
)
}
k
≥
0 denotes a system which is mutually orthogonal under (6); that is,
(7)
〈
R
k
,
R
l
〉
w
=
2
2
k
+
1
δ
k
l
,
where δ
k
l is the Kronecker delta function. This system is complete in L
w
2
(
Λ
). For any function u
∈
L
w
2
(
Λ
) the following expansion holds:
(8)
u
(
t
)
=
∑
k
=
0
∞
a
k
R
k
(
t
)
,
with
(9)
a
k
=
〈
u
,
R
k
〉
w
∥
R
k
∥
w
2
.


## 2.3. Legendre Rational Interpolation Approximation

We denote byt
N
,
j, 0
⩽
j
⩽
N, the nodes of the standard Legendre-Gauss interpolation on the interval [
-
1,1
], and ϖ
N
,
j, 0
⩽
j
⩽
N are Christoffel numbers. The nodes of the Legendre rational-Gauss interpolation on the interval [
0
,
∞
) are the zeros of R
N
+
1
(
t
), which is denoted by t
R
,
N
,
j, 0
⩽
j
⩽
N. It is clear that t
R
,
N
,
j
=
(
1
+
t
N
,
j
)
/
(
1
-
t
N
,
j
), and ϖ
R
,
N
,
j
=
ϖ
N
,
j, 0
⩽
j
⩽
N. We now set S
N
(
0
,
∞
)
=
span
⁡
{
R
0
(
t
)
,
R
1
(
t
)
,
…
,
R
N
(
t
)
}. Therefore, making use of the property of the Legendre-Gauss quadrature, we have for any ϕ
∈
S
2
N
+
1
[
0
,
∞
),
(10)
∫
0
∞
w
(
t
)
ϕ
(
t
)
d
t
=
∫
-
1
1
ρ
(
y
)
ϕ
(
1
+
y
1
-
y
)
d
y
=
∑
j
=
0
N
‍
ϖ
R
,
N
,
j
ϕ
(
t
R
,
N
,
j
)
.The interpolating function of a smooth functionu on a semi-infinite interval is denoted by P
N
u. It is an element of R
N and is defined as
(11)
P
N
u
(
t
)
=
∑
0
N
‍
a
k
R
k
(
t
)
.P
N
u is the orthogonal projection of u upon R
N with respect to the inner product (6) and the norm (5). Thus by the orthogonality of Legendre rational functions we have [11]
(12)
〈
P
N
u
-
u
,
R
i
〉
w
=
0
,
∀
R
i
∈
R
N
.To obtain the order of convergence of Legendre rational approximation, at first we define the space(13)
H
w
,
A
r
(
Λ
)
=
{
v
:
v
is
measurable
and
∥
v
∥
r
,
w
,
A
<
∞
}
,
where the norm is induced by
(14)
∥
v
∥
r
,
w
,
A
=
(
∑
k
=
0
r
‍
∥
(
t
+
1
)
r
/
2
+
k
d
k
d
t
k
v
∥
w
2
)
,
and A is the Sturm-Liouville operator as follows:
(15)
A
v
(
t
)
=
-
w
-
1
(
t
)
d
d
t
(
t
d
d
t
v
(
t
)
)
.
We have the following theorem for the convergence.Theorem 1.
For anyv
∈
H
w
,
A
r
(
Λ
) and r
≥
0,
(16)
∥
P
N
v
-
v
∥
≤
c
N
-
r
∥
v
∥
r
,
w
,
A
.A complete proof of the theorem and discussion on convergence are given in [11].


## 3. Linear Multipantograph System

In this section, we propose the Legendre rational-Gauss collocation method to solve the following system of linear multipantograph equations:(17)
∑
s
=
1
m
‍
β
1
,
s
u
s
′
(
t
)
=
∑
s
=
1
m
‍
a
1
,
s
(
t
)
u
s
(
t
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
1
,
s
j
(
t
)
u
j
(
λ
j
t
)
+
g
1
(
t
)
,
∑
s
=
1
m
‍
β
2
,
s
u
s
′
(
t
)
=
∑
s
=
1
m
‍
a
2
,
s
(
t
)
u
s
(
t
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
2
,
s
j
(
t
)
u
j
(
λ
j
t
)
+
g
2
(
t
)
aaaaaaaaaaaaaaaaaaaa
0
<
t
≤
∞
,
⋮
∑
s
=
1
m
‍
β
m
,
s
u
s
′
(
t
)
=
∑
s
=
1
m
‍
a
m
,
s
(
t
)
u
s
(
t
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
m
,
s
j
(
t
)
u
j
(
λ
j
t
)
+
g
m
(
t
)
,
subject to
(18)
∑
r
=
1
m
‍
u
r
,
1
(
0
)
=
u
1
,
∑
r
=
1
m
‍
u
r
,
2
(
0
)
=
u
2
,
⋮
∑
r
=
1
m
‍
u
r
,
m
(
0
)
=
u
m
.
Let us first introduce some basic notation that will be used in the sequel. We define the discrete inner product and norm as follows:
(19)
(
u
,
v
)
w
,
N
=
∑
j
=
0
N
‍
u
(
t
R
,
N
,
j
)
v
(
t
R
,
N
,
j
)
ϖ
R
,
N
,
j
,
∥
u
∥
w
,
N
=
(
u
,
u
)
w
,
N
.
Obviously,
(20)
(
u
,
v
)
w
,
N
=
(
u
,
v
)
w
,
∀
u
,
v
∈
S
2
N
+
1
.
The Legendre rational-Gauss collocation method for solving (17) and (18) is to seek u
j
,
N
(
t
)
∈
S
N
(
0
,
∞
), j
=
1,2
,
…
,
k, such that
(21)
∑
s
=
1
m
‍
β
1
,
s
u
s
′
(
t
q
,
R
,
N
,
γ
)
=
∑
s
=
1
m
‍
a
1
,
s
(
t
)
u
s
(
t
q
,
R
,
N
,
γ
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
1
,
s
j
(
t
)
u
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
1
(
t
q
,
R
,
N
,
γ
)
,
∑
s
=
1
m
‍
β
2
,
s
u
s
′
(
t
q
,
R
,
N
,
γ
)
=
∑
s
=
1
m
‍
a
2
,
s
(
t
)
u
s
(
t
q
,
R
,
N
,
γ
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
2
,
s
j
(
t
)
u
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
2
(
t
q
,
R
,
N
,
γ
)
,
⋮
∑
s
=
1
m
‍
β
m
,
s
u
s
′
(
t
q
,
R
,
N
,
γ
)
=
∑
s
=
1
m
‍
a
m
,
s
(
t
)
u
s
(
t
q
,
R
,
N
,
γ
)
+
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
m
,
s
j
(
t
)
u
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
m
(
t
q
,
R
,
N
,
γ
)
,
q
=
1,2
,
…
,
m
,
γ
=
0,1
,
…
,
N
-
1
,
∑
r
=
1
m
‍
u
r
,
1
(
0
)
=
u
1
,
∑
r
=
1
m
‍
u
r
,
2
(
0
)
=
u
2
,
⋮
∑
r
=
1
m
‍
u
r
,
m
(
0
)
=
u
m
.
We derive the algorithm for solving (17)-(18). To do this, let
(22)
u
i
,
N
(
t
)
=
∑
h
=
0
N
‍
c
i
,
h
R
i
,
h
(
t
)
.Now, substitution of (22) into (17) enables us to write
(23)
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
1
,
s
c
1
,
h
D
R
s
,
h
(
t
)
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
1
,
s
(
t
)
c
1
,
h
R
s
,
h
(
t
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
1
,
s
j
(
t
)
c
1
,
j
R
s
,
j
(
λ
j
t
)
+
g
1
(
t
)
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
2
,
s
c
2
,
h
D
R
s
,
h
(
t
)
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
2
,
s
(
t
)
c
2
,
h
R
s
,
h
(
t
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
2
,
s
j
(
t
)
c
2
,
j
R
s
,
j
(
λ
j
t
)
+
g
2
(
t
)
,
⋮
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
m
,
s
c
m
,
h
D
R
s
,
h
(
t
)
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
m
,
s
(
t
)
c
m
,
h
R
s
,
h
(
t
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
m
,
s
j
(
t
)
c
m
,
j
R
s
,
j
(
λ
j
t
)
+
g
m
(
t
)
.Then, by virtue of (3), we deduce that
(24)
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
1
,
s
c
1
,
h
(
h
+
1
)
2
t
(
t
+
1
)
[
(
t
-
1
)
R
s
,
h
(
t
)
-
(
t
+
1
)
R
s
,
h
+
1
(
t
)
]
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
1
,
s
(
t
)
c
1
,
h
R
s
,
h
(
t
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
1
,
s
j
(
t
)
c
1
,
j
R
s
,
j
(
λ
j
t
)
+
g
1
(
t
)
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
2
,
s
c
2
,
h
(
h
+
1
)
2
t
(
t
+
1
)
[
(
t
-
1
)
R
s
,
h
(
t
)
-
(
t
+
1
)
R
s
,
h
+
1
(
t
)
]
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
2
,
s
(
t
)
c
2
,
h
R
s
,
h
(
t
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
2
,
s
j
(
t
)
c
2
,
j
R
s
,
j
(
λ
j
t
)
+
g
2
(
t
)
,
⋮
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
m
,
s
c
m
,
h
(
h
+
1
)
2
t
(
t
+
1
)
[
(
t
-
1
)
R
s
,
h
(
t
)
-
(
t
+
1
)
R
s
,
h
+
1
(
t
)
]
=

∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
m
,
s
(
t
)
c
m
,
h
R
s
,
h
(
t
)
+

∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
m
,
s
j
(
t
)
c
m
,
j
R
s
,
j
(
λ
j
t
)
+
g
m
(
t
)
.Moreover, the initial condition (18)-with the aid of (2)-yields
(25)
∑
h
=
0
N
‍
∑
r
=
1
m
‍
(
-
1
)
h
a
1
,
h
=
u
1
,
∑
h
=
0
N
‍
∑
r
=
1
m
‍
(
-
1
)
h
a
2
,
h
=
u
2
,
⋮
∑
h
=
0
N
‍
∑
r
=
1
m
‍
(
-
1
)
h
a
m
,
h
=
u
m
.If we collocate (24) at the (
N
) Legendre rational roots of R
N
+
1
(
t
), then we get
(26)
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
1
,
s
c
1
,
h
(
h
+
1
)
2
t
q
,
R
,
N
,
γ
(
t
q
,
R
,
N
,
γ
+
1
)
×
[
(
t
q
,
R
,
N
,
γ
-
1
)
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
a
a
a
a
i
a
a
-
(
t
q
,
R
,
N
,
γ
+
1
)
R
s
,
h
+
1
(
t
q
,
R
,
N
,
γ
)
]
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
1
,
s
(
t
q
,
R
,
N
,
γ
)
c
1
,
h
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
1
,
s
j
(
t
q
,
R
,
N
,
γ
)
c
1
,
j
R
s
,
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
1
(
t
q
,
R
,
N
,
γ
)
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
2
,
s
c
2
,
h
(
h
+
1
)
2
t
q
,
R
,
N
,
γ
(
t
q
,
R
,
N
,
γ
+
1
)
×
[
(
t
q
,
R
,
N
,
γ
-
1
)
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
a
a
a
a
a
a
i
-
(
t
q
,
R
,
N
,
γ
+
1
)
R
s
,
h
+
1
(
t
q
,
R
,
N
,
γ
)
]
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
2
,
s
(
t
q
,
R
,
N
,
γ
)
c
2
,
h
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
2
,
s
j
(
t
q
,
R
,
N
,
γ
)
c
2
,
j
R
s
,
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
2
(
t
q
,
R
,
N
,
γ
)
,
⋮
∑
h
=
0
N
‍
∑
s
=
1
m
‍
β
m
,
s
c
m
,
h
(
h
+
1
)
2
t
q
,
R
,
N
,
γ
(
t
q
,
R
,
N
,
γ
+
1
)
×
[
(
t
q
,
R
,
N
,
γ
-
1
)
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
a
a
a
a
a
a
i
-
(
t
q
,
R
,
N
,
γ
+
1
)
R
s
,
h
+
1
(
t
q
,
R
,
N
,
γ
)
]
=
∑
h
=
0
N
‍
∑
s
=
1
m
‍
a
m
,
s
(
t
q
,
R
,
N
,
γ
)
c
m
,
h
R
s
,
h
(
t
q
,
R
,
N
,
γ
)
+
∑
h
=
0
N
‍
∑
j
=
1
l
‍
∑
s
=
1
m
‍
b
m
,
s
j
(
t
q
,
R
,
N
,
γ
)
c
m
,
j
R
s
,
j
(
λ
j
t
q
,
R
,
N
,
γ
)
+
g
m
(
t
q
,
R
,
N
,
γ
)
.Thus (26) with relation (25) generate (
N
+
1
) of a set of algebraic equations which can be solved for the unknown coefficients c
i
,
j
,
(
i
=
1
,
…
,
m
;
j
=
0,1
,
2
,
…
,
N
), by using any standard solver technique.


## 4. Nonlinear Multipantograph System

In this section, we consider the nonlinear multipantograph system of the form(27)
∑
s
=
1
m
‍
ξ
1
,
s
u
s
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
1
,
s
u
s
(
t
)
,
∑
s
=
1
m
‍
η
1
,
s
u
s
(
λ
t
)
)
,
∑
s
=
1
m
‍
ξ
2
,
s
u
s
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
2
,
s
u
s
(
t
)
,
∑
s
=
1
m
‍
η
2
,
s
u
s
(
λ
t
)
)
,
a
a
a
a
a
a
t
∈
(
0
,
∞
)
where
λ
∈
(
0,1
)
,
⋮
∑
s
=
1
m
‍
ξ
m
,
s
u
s
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
m
,
s
u
s
(
t
)
,
∑
s
=
1
m
‍
η
m
,
s
u
s
(
λ
t
)
)
,
with initial conditions
(28)
∑
r
=
1
m
‍
u
r
,
1
(
0
)
=
u
1
,
∑
r
=
1
m
‍
u
r
,
2
(
0
)
=
u
2
,
⋮
∑
r
=
1
m
‍
u
r
,
m
(
0
)
=
u
m
.
The Legendre rational-Gauss collocation method for solving (27) and (28) is to seek u
i
,
N
(
x
)
∈
S
N
(
0
,
∞
), such that
(29)
∑
s
=
1
m
‍
ξ
1
,
s
u
s
,
N
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
1
,
s
u
s
,
N
(
t
)
,
∑
s
=
1
m
‍
η
1
,
s
u
s
,
N
(
λ
t
)
)
,
∑
s
=
1
m
‍
ξ
2
,
s
u
s
,
N
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
2
,
s
u
s
,
N
(
t
)
,
∑
s
=
1
m
‍
η
2
,
s
u
s
,
N
(
λ
t
)
)
,
a
a
a
a
a
a
a
a
i
t
∈
(
0
,
∞
)
where
λ
∈
(
0,1
)
,
⋮
∑
s
=
1
m
‍
ξ
m
,
s
u
s
,
N
′
(
t
)
=
F
(
t
,
∑
s
=
1
m
‍
ζ
m
,
s
u
s
,
N
(
t
)
,
∑
s
=
1
m
‍
η
m
,
s
u
s
,
N
(
λ
t
)
)
is satisfied exactly at the collocation points t
R
,
N
,
k, k
=
0,1
,
…
,
N
-
1. In other words, we have to collocate (29) at the (
N
) Legendre rational roots t
R
,
N
,
k, which immediately yields
(30)
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ξ
m
,
s
c
1
,
j
D
R
s
,
h
(
t
q
,
R
,
N
,
k
)
=
F
(
t
q
,
R
,
N
,
k
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ζ
1
,
s
c
1
,
h
R
s
,
h
(
t
q
,
R
,
N
,
k
)
,
a
a
a
a
a
a
i
∑
h
=
0
N
‍
∑
s
=
1
m
‍
η
1
,
s
c
1
,
h
R
s
,
h
(
λ
t
q
,
R
,
N
,
k
)
)
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ξ
m
,
s
c
2
,
j
D
R
s
,
h
(
t
q
,
R
,
N
,
k
)
=
F
(
t
q
,
R
,
N
,
k
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ζ
2
,
s
c
2
,
h
R
s
,
h
(
t
q
,
R
,
N
,
k
)
,
a
a
a
a
a
a
i
∑
h
=
0
N
‍
∑
s
=
1
m
‍
η
2
,
s
c
2
,
h
R
s
,
h
(
λ
t
q
,
R
,
N
,
k
)
)
,
⋮
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ξ
m
,
s
c
m
,
j
D
R
s
,
h
(
t
q
,
R
,
N
,
k
)
=
F
(
t
q
,
R
,
N
,
k
,
∑
h
=
0
N
‍
∑
s
=
1
m
‍
ζ
m
,
s
c
m
,
h
R
s
,
h
(
t
q
,
R
,
N
,
k
)
,
a
a
a
a
a
a
i
∑
h
=
0
N
‍
∑
s
=
1
m
‍
η
m
,
s
c
m
,
h
R
s
,
h
(
λ
t
q
,
R
,
N
,
k
(
θ
,
ϑ
)
)
)
,
with (28) written in the form
(31)
∑
h
=
0
N
‍
∑
r
=
1
m
‍
c
1
,
j
R
r
,
h
(
0
)
=
u
1,0
,
∑
h
=
0
N
‍
∑
r
=
1
m
‍
c
2
,
j
R
r
,
h
(
0
)
=
u
2,0
,
⋮
∑
h
=
0
N
‍
∑
r
=
1
m
‍
c
m
,
j
R
r
,
h
(
0
)
=
u
n
,
0
.
This constitute a system of (
N
+
1
) nonlinear algebraic equations in the unknown expansion coefficients c
i
,
j
,
(
i
=
1
,
…
,
m
;
j
=
0,1
,
2
,
…
,
N
), which can be solved by using any standard iteration technique, like Newton's iteration method.


## 5. Numerical Results

In this section, we present two numerical examples in order to show the accuracy of Legendre rational collocation method for solving multipantograph delay system. The following tables and figures contain the values of the exact solutionsu
i
(
x
)
,
i
=
1,2
,
…
,
k, the approximate solutions u
i
,
N
(
x
)
,
i
=
1,2
,
…
,
k, and the absolute error functions e
i
,
N
(
x
)
=
|
u
i
(
x
)
-
u
i
,
N
(
x
)
|
,
i
=
1,2
,
…
,
k, at the selected points of the given interval.Example 1.
Consider the following linear multipantograph delay system:(32)
u
1
′
(
t
)
+
5
u
2
′
(
t
)
+
t
u
1
(
t
)
-
2
t
2
u
2
(
t
)
+
u
1
(
0.5
t
)
+
t
u
2
(
0.8
t
)
=
g
1
(
t
)
,
aaaaaaaaaaaaaaaaaaaaaa
0
≤
t
≤
100
,
-
4
u
1
′
(
t
)
+
u
2
′
(
t
)
-
u
1
(
t
)
+
t
u
2
(
t
)
+
t
u
1
(
0.2
t
)
+
u
2
(
0.4
t
)
=
g
2
(
t
)
,
with the initial conditions
(33)
u
1
(
0
)
=
0
,
u
2
′
(
0
)
=
1
,
where
(34)
g
1
(
t
)
=
2
t
-
4
t
2
+
(
3
t
2
-
t
+
6
)
e
-
t
+
0.5
t
e
-
0.5
t
-
t
e
-
0.8
t
,
g
2
(
t
)
=
2
+
2
t
+
(
2
t
-
3
)
e
-
t
-
e
-
0.4
t
+
0.2
t
2
e
-
0.2
t
.
The exact solution of the system is u
1
(
t
)
=
t
e
-
t and u
2
(
t
)
=
2
-
e
-
t.Tables1 and 2 list the results obtained by the Legendre rational-Gauss collocation method in terms of maximum absolute errors with different values of N. The logarithmic graphs of absolute coefficients for Legendre rational functions are shown in Figures 1 and 2. This confirms that the proposed method has reasonable convergence rate.Table 1
Comparison of the absolute errorse
1
,
N for u
1
(
t
) of (32).
t
i
LR-GC method
N
=
20
N
=
40
N
=
60
0.0
0.000 × 10+00
0.000 × 10+00
2.775 × 10−17
10.0
1.105 × 10−4
5.638 × 10−8
3.779 × 10−10
20.0
2.175 × 10−5
4.347 × 10−7
2.609 × 10−9
30.0
3.087 × 10−3
6.613 × 10−7
8.111 × 10−9
40.0
1.080 × 10−2
6.894 × 10−7
1.604 × 10−8
50.0
2.036 × 10−2
1.644 × 10−6
4.074 × 10−8
60.0
3.008 × 10−2
6.281 × 10−6
9.717 × 10−8
70.0
3.922 × 10−2
1.594 × 10−5
1.190 × 10−7
80.0
4.756 × 10−2
3.053 × 10−5
8.903 × 10−8
90.0
5.506 × 10−2
4.921 × 10−5
4.396 × 10−8
100.0
6.178 × 10−2
7.100 × 10−5
3.624 × 10−8Table 2
Comparison of the absolute errorse
2
,
N for u
2
(
t
) of (32).
t
i
LR-GC method
N
=
20
N
=
40
N
=
60
0.0
8.273 × 10−7
9.056 × 10−12
4.393 × 10−11
10.0
1.395 × 10−5
6.763 × 10−9
4.703 × 10−12
20.0
9.412 × 10−6
8.911 × 10−9
5.661 × 10−11
30.0
6.376 × 10−5
1.177 × 10−8
1.242 × 10−10
40.0
1.499 × 10−4
7.887 × 10−9
2.575 × 10−10
50.0
2.121 × 10−4
1.621 × 10−8
3.371 × 10−10
60.0
2.529 × 10−4
4.544 × 10−8
6.993 × 10−10
70.0
2.791 × 10−4
1.027 × 10−7
9.146 × 10−10
80.0
2.957 × 10−4
1.820 × 10−7
7.991 × 10−10
90.0
3.061 × 10−4
2.729 × 10−7
5.234 × 10−10
100.0
3.125 × 10−4
3.658 × 10−7
3.478 × 10−10Figure 1
Logarithmic graph of absolute coefficients|
c
j
| of Legendre rational functions at N
=
60 of Example 1.Figure 2
Logarithmic graph of absolute coefficients|
d
j
| of Legendre rational functions at N
=
60 of Example 1.Example 2.
Consider the following nonlinear multipantograph delay system:(35)
u
1
′
(
t
)
+
2
u
2
′
(
t
)
+
u
1
(
t
)
+
t
u
2
(
t
)
+
t
u
2
2
(
0.5
t
)
=
g
1
(
t
)
,
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaiiii
0
≤
t
≤
1
,
3
u
1
′
(
t
)
-
u
2
′
(
t
)
+
t
u
1
2
(
0.2
t
)
-
(
t
+
1
)
u
2
(
t
)
=
g
2
(
t
)
,
with the initial conditions
(36)
u
1
(
0
)
=
0
,
u
2
′
(
0
)
=
1
,
where
(37)
g
1
(
t
)
=
-
2
e
-
t
sin
(
t
)
-
e
-
t
cos
⁡
(
t
)
+
e
-
t
t
cos
⁡
(
t
)
+
e
-
t
t
cos
⁡
2
(
0.5
t
)
,
g
2
(
t
)
=
3
e
-
t
cos
⁡
(
t
)
-
2
e
-
t
sin
(
t
)
-
t
e
-
t
sin
(
t
)
+
e
-
0.4
t
t
sin
2
(
0.2
t
)
.
The exact solution of the system is u
1
(
x
)
=
e
-
t
sin
(
t
) and u
2
(
t
)
=
e
-
t
cos
⁡
(
t
).In Tables3 and 4, we list the absolute errors obtained by the Legedre rational-Gauss collocation method, with different values of N. Figures 3 and 4 are plotted to compare the analytic solution with the approximate solution at N
=
28.Table 3
Comparison of the absolute errorse
1
,
N for u
1
(
t
) of (35).
t
i
LR-GC method
N
=
10
N
=
30
N
=
50
0.0
5.551 × 10−17
0.000 × 10+00
0.000 × 10+00
1.0
1.554 × 10−3
4.799 × 10−6
8.262 × 10−8
2.0
2.085 × 10−3
2.349 × 10−6
4.957 × 10−8
3.0
6.583 × 10−3
1.392 × 10−6
1.069 × 10−7
4.0
1.408 × 10−3
9.788 × 10−9
1.247 × 10−7
5.0
5.932 × 10−3
2.183 × 10−5
8.508 × 10−7
6.0
6.690 × 10−3
6.643 × 10−5
1.169 × 10−6
7.0
3.789 × 10−3
6.919 × 10−6
1.485 × 10−6
8.0
1.092 × 10−3
6.729 × 10−5
6.698 × 10−7
9.0
1.546 × 10−3
2.765 × 10−5
1.382 × 10−6
10.0
2.137 × 10−4
2.345 × 10−5
1.450 × 10−6Table 4
Comparison of the absolute errorse
2
,
N for u
2
(
t
) of (35).
t
i
LR-GC method
N
=
10
N
=
30
N
=
50
0.0
0.000 × 10+00
1.110 × 10−16
1.665 × 10−16
1.0
6.260 × 10−4
2.819 × 10−6
5.391 × 10−8
2.0
6.997 × 10−5
2.048 × 10−5
4.171 × 10−8
3.0
5.800 × 10−5
1.042 × 10−6
9.088 × 10−8
4.0
6.901 × 10−4
7.814 × 10−6
1.541 × 10−7
5.0
2.427 × 10−3
9.524 × 10−6
2.014 × 10−7
6.0
3.012 × 10−3
1.126 × 10−6
1.116 × 10−7
7.0
1.483 × 10−3
1.283 × 10−5
2.553 × 10−7
8.0
8.598 × 10−3
4.171 × 10−6
5.499 × 10−7
9.0
1.529 × 10−2
6.713 × 10−6
2.949 × 10−7
10.0
1.995 × 10−2
3.503 × 10−5
3.311 × 10−7Figure 3
Graph of exact solution and approximate solutionu
1
(
t
) at N
=
28 for Example 2.Figure 4
Graph of exact solution and approximate solutionu
2
(
t
) at N
=
28 for Example 2.


## 6. Conclusion

In this paper, a collocation Legendre rational method has been proposed to obtain the approximate solutions of systems of multipantograph delay equations. The derivation of this method is essentially based on Legendre rational functions and Gauss quadrature formula. The main advantage of the developed method is that high accurate solutions were achieved using few numbers of the Legendre rational functions. Additionally, ifN is increased, it can be seen that approximate solutions obtained by the method are close to the exact solutions.



---

*Source: 816473-2014-05-19.xml*