# New Formulae for the High-Order Derivatives of Some Jacobi Polynomials: An Application to Some High-Order Boundary Value Problems

Authors: W. M. Abd-Elhameed
Journal: The Scientific World Journal
 (2014)

---

## Abstract

This paper is concerned with deriving some new formulae expressing explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one or two of any degree and of any order in terms of their corresponding Jacobi polynomials. The derivatives formulae for Chebyshev polynomials of third and fourth kinds of any degree and of any order in terms of their corresponding Chebyshev polynomials are deduced as special cases. Some new reduction formulae for summing some terminating hypergeometric functions of unit argument are also deduced. As an application, and with the aid of the new introduced derivatives formulae, an algorithm for solving special sixth-order boundary value problems are implemented with the aid of applying Galerkin method. A numerical example is presented hoping to ascertain the validity and the applicability of the proposed algorithms.


---

## Body

## 1. Introduction

Classical orthogonal polynomials are successfully employed for solving ordinary and partial differential equations in spectral and pseudospectral methods (see, for instance, [1–3]). In particular, the class of Jacobi polynomials P
n
(
α
,
β
)
(
x
) plays prominent roles in the applications of mathematical analysis. For example, Doha et al. in [4] used these polynomials for solving some odd-order boundary value problems (BVPs). The suggested algorithms in this paper are based on selecting certain combinations of Jacobi polynomials satisfying the boundary conditions of the given differential equation. There are some other articles in literature that have extensive theoretical and numerical studies about Jacobi polynomials (see, e.g., [5, 6]). It is well known that the classical Jacobi polynomials have two parameters. Of course, special choices of their parameters give special kinds of these polynomials. It is worthy to mention here that the classical Jacobi polynomials have six special well-known kinds of orthogonal polynomials; they are Legendre, ultraspherical, and Chebyshev polynomials of the four kinds. All six special kinds of Jacobi polynomials have their roles and importance from both theoretical and practical points of view (see, e.g., [7–11]).The spectral methods have prominent roles in various applications such as fluid dynamics. These methods are global methods. There are three popular methods of spectral methods; they are tau, collocation, and Galerkin methods (see, e.g., [12, 13]). The choice of the suitable used spectral method suggested for solving the given equation depends certainly on the type of the differential equation and also on the type of the boundary conditions governed by it.The explicit formulae for the high-order derivatives of various orthogonal polynomials in terms of their original polynomials are useful when spectral and pseudospectral methods are used for obtaining numerical solutions of various types of differential equations. Formula for the high-order derivatives for Chebyshev polynomials in terms of their original polynomials is given in Karageorghis [14]. The corresponding formulae for Legendre, ultraspherical, and Jacobi polynomials are given, respectively, in Phillips [15] and Doha [16].Due to their great importance in various applications, high even-order BVPs have been investigated by a large number of authors. For example, sixth-order BVPs are known to arise in astrophysics; the narrow convecting layers bounded by stable layers, which are believed to surround A-type stars, may be modeled by sixth-order BVPs. Sixth-order BVPs were handled by numerous numerical techniques. For example, Doha and Abd-Elhameed in [17] have developed efficient solutions of multidimensional sixth-order BVPs based on employing symmetric generalized Jacobi-Galerkin method. Also, Bhrawy et al. in [18] have developed an extension of the Legendre-Galerkin method for handling sixth-order BVPs with variable polynomial coefficients. There are other contributions concerning sixth-order BVPs; among the techniques used for handling this kind of BVPs are sinc-Galerkin method [19], nonpolynomial spline technique in [20], spline collocation method in [21], Adomian decomposition method with Green’s function in [22], parametric quintic spline solution in [23], homotopy perturbation method in [24], and fourth order finite difference method in [25]. For extensive studies about the existence and uniqueness of solutions of such problems, the interested reader can be refered to the important book of Agarwal [26]. For other studies in high even- and high odd-order BVPs, see, for example, [27–31].The main objective of this paper is twofold:(i)
developing new formulae for the high-order derivatives of some Jacobi polynomials with certain parameters,
(ii)
employing the new introduced formulae in solving some sixth-order BVPs based on applying a spectral Galerkin method.The rest of the paper is as follows. In the next section, some useful properties of Jacobi polynomials are presented. In Section3, we derive two new formulae which give explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one in terms of their original Jacobi polynomials. In Section 4, we give other two new formulae which give explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is two in terms of their original Jacobi polynomials. Some new reduction formulae for summing some terminating hypergeometric functions of the type F
2
3
(
1
) are deduced in Section 5. Section 6 is devoted to implementing and presenting a Galerkin algorithm for numerically solving ceratin sixth-order BVPs including a numerical example aiming to illustrate the accuracy and the efficiency of the proposed algorithm. Finally, conclusions are given in Section 7.


## 2. Some Properties of Jacobi Polynomials

The classical Jacobi polynomials associated with the real parameters(
α
>
-
1, β
>
-
1
) and the weight function w
(
x
)
=
(
1
-
x
)
α
(
1
+
x
)
β (see, e.g., [32, 33]) are a sequence of polynomials P
j
(
α
,
β
)
(
x
)  (
j
=
0,1
,
2
,
…
), each, respectively, of degree j. These polynomials have the following Gauss hypergeometric form:
(1)
P
j
(
α
,
β
)
(
x
)
=
(
α
+
1
)
j
j
!
F
1
2
(
-
j
,
j
+
λ
;
α
+
1
|
1
-
x
2
)
=
(
-
1
)
j
(
β
+
1
)
j
j
!
F
1
2
(
-
j
,
j
+
λ
;
β
+
1
|
1
+
x
2
)
,
where
(2)
λ
=
α
+
β
+
1
,
(
z
)
k
=
Γ
(
z
+
k
)
Γ
(
z
)
.
It is clear that
(3)
P
j
(
β
,
α
)
(
-
x
)
=
(
-
1
)
j
P
j
(
α
,
β
)
(
x
)
,
(4)
P
j
(
α
,
β
)
(
1
)
=
(
α
+
1
)
j
j
!
,
P
j
(
α
,
β
)
(
-
1
)
=
(
-
1
)
j
(
β
+
1
)
j
j
!
.
The Jacobi polynomials may be generated using the recurrence relation
(5)
2
(
j
+
1
)
(
j
+
λ
)
(
2
j
+
λ
-
1
)
P
j
+
1
(
α
,
β
)
(
x
)
=
(
2
j
+
λ
-
1
)
3
x
P
j
(
α
,
β
)
(
x
)
+
(
α
2
-
β
2
)
(
2
j
+
λ
)
P
j
(
α
,
β
)
(
x
)
-
2
(
j
+
α
)
(
j
+
β
)
(
2
j
+
λ
+
1
)
P
j
-
1
(
α
,
β
)
(
x
)
,
starting from P
0
(
α
,
β
)
(
x
)
=
1 and P
1
(
α
,
β
)
(
x
)
=
(
1
/
2
)
[
α
-
β
+
(
λ
+
1
)
x
], or obtained alternatively from Rodrigue’s formula
(6)
P
j
(
α
,
β
)
(
x
)
=
(
-
1
)
j
2
j
j
!
(
1
-
x
)
-
α
(
1
+
x
)
-
β
×
d
j
d
x
j
[
(
1
-
x
)
α
+
j
(
1
+
x
)
β
+
j
]
.
The polynomials P
j
(
α
,
β
)
(
x
) satisfy the orthogonality relation
(7)
∫
-
1
1
(
1
-
x
)
α
(
1
+
x
)
β
P
i
(
α
,
β
)
(
x
)
P
j
(
α
,
β
)
(
x
)
d
x
=
{
0
,
i
≠
j
,
h
i
(
α
,
β
)
,
i
=
j
,
where
(8)
h
i
(
α
,
β
)
=
2
α
+
β
+
1
Γ
(
i
+
α
+
1
)
Γ
(
i
+
β
+
1
)
(
2
i
+
α
+
β
+
1
)
i
!
Γ
(
i
+
α
+
β
+
1
)
.
The following structure formula is useful in the sequel (see Rainville [34]):
(9)
P
j
(
α
,
β
)
(
x
)
=
2
(
j
+
λ
-
1
)
(
2
j
+
λ
-
1
)
3
×
[
(
j
+
λ
-
1
)
2
(
2
j
+
λ
-
1
)
D
P
j
+
1
(
α
,
β
)
(
x
)
i
+
(
α
-
β
)
(
j
+
λ
-
1
)
(
2
j
+
λ
)
D
P
j
(
α
,
β
)
(
x
)
i
-
(
j
+
α
)
(
j
+
β
)
(
2
j
+
λ
+
1
)
D
P
j
-
1
(
α
,
β
)
(
x
)
]
,
j
≥
1
.
Also, the following theorem is of important use hereafter.Theorem 1.
For allq
≥
1, the qth derivative of the Jacobi polynomial P
j
(
α
,
β
)
(
x
) is given explicitly by
(10)
D
q
P
j
(
α
,
β
)
(
x
)
=
∑
i
=
0
j
-
q
‍
θ
i
,
j
,
α
,
β
,
q
P
i
(
α
,
β
)
(
x
)
,
where
(11)
θ
i
,
j
,
α
,
β
,
q
=
(
j
+
λ
)
q
(
j
+
q
+
λ
)
i
(
i
+
q
+
α
+
1
)
j
-
i
-
q
Γ
(
i
+
λ
)
2
q
(
j
-
i
-
q
)
!
Γ
(
2
i
+
λ
)
×
F
2
3
(
-
j
+
q
+
i
,
j
+
i
+
q
+
λ
,
i
+
α
+
1
;
i
+
q
+
α
+
1
,
2
i
+
λ
+
1
∣
1
)
.
(For a proof of Theorem 1, see Doha [16].)Remark 2.
Although theF
2
3
(
1
) in formula (11) is terminating, it cannot be summed in a closed form except for certain special choices of the two parameters α and β. In case of α
=
β, this F
2
3
(
1
) can be summed in a closed form with the aid of Watson’s identity (see Doha [16]).


## 3. High-Order Derivatives ofP
n
(
α
,
α
+
1
)
(
x
) and P
n
(
α
+
1
,
α
)
(
x
)

The main objective of this section is to state and prove two theorems in which the derivatives of the Jacobi polynomialsP
n
(
α
,
α
+
1
)
(
x
) and P
n
(
α
+
1
,
α
)
(
x
) are given in terms of their corresponding Jacobi polynomials. We first state and prove a lemma in which the first derivative of P
n
(
α
,
α
+
1
)
(
x
) is expressed in terms of their original polynomials.Lemma 3.
For alln
≥
1, one has
(12)
D
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
1
)
/
2
⌋
‍
d
n
,
r
P
n
-
2
r
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
n
/
2
⌋
-
1
‍
e
n
,
r
P
n
-
2
r
-
2
(
α
,
α
+
1
)
(
x
)
,
where
(13)
d
n
,
r
=
(
2
n
-
2
r
+
2
α
+
1
)
Γ
(
n
+
α
+
1
)
Γ
(
n
-
2
r
+
2
α
+
1
)
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
2
r
+
α
)
,
e
n
,
r
=
2
(
r
+
1
)
Γ
(
n
+
α
+
1
)
Γ
(
n
-
2
r
+
2
α
)
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
2
r
+
α
-
1
)
,
and ⌊
z
⌋ denotes the largest integer less than or equal to z.Proof.
Let us denote(14)
S
m
(
x
)
=
∑
n
=
0
m
‍
a
n
P
n
(
α
,
α
+
1
)
(
x
)
,
(15)
I
m
+
1
(
x
)
=
∫
S
m
(
x
)
d
x
.
The integration of both sides of the structure formula (9) (for the case β
=
α
+
1) yields
(16)
∫
P
n
(
α
,
α
+
1
)
(
x
)
d
x
=
α
n
P
n
+
1
(
α
,
α
+
1
)
(
x
)
+
β
n
P
n
(
α
,
α
+
1
)
(
x
)
+
γ
n
P
n
-
1
(
α
,
α
+
1
)
(
x
)
,
n
≥
1
,
where
(17)
α
n
=
n
+
2
α
+
2
(
n
+
α
+
1
)
(
2
n
+
2
α
+
3
)
,
β
n
=
-
2
(
2
n
+
2
α
+
1
)
(
2
n
+
2
α
+
3
)
,
γ
n
=
-
(
n
+
α
)
(
n
+
2
α
+
1
)
(
2
n
+
2
α
+
1
)
,
which in turn implies that
(18)
I
m
+
1
(
x
)
=
α
0
∫
P
0
(
α
,
α
+
1
)
(
x
)
d
x
+
∑
n
=
1
m
‍
a
n
[
α
n
P
n
+
1
(
α
,
α
+
1
)
(
x
)
+
β
n
P
n
(
α
,
α
+
1
)
(
x
)
2222222
+
γ
n
P
n
-
1
(
α
,
α
+
1
)
(
x
)
]
.
The last equation may be written alternatively in the form
(19)
I
m
+
1
(
x
)
=
∑
n
=
0
m
+
1
‍
A
n
P
n
(
α
,
α
+
1
)
(
x
)
,
where
(20)
a
n
-
1
α
n
-
1
+
a
n
β
n
+
γ
n
+
1
a
n
+
1
=
A
n
,
n
=
m
+
1
,
m
,
…
,
1
,
a
m
+
1
=
a
m
+
2
=
0
.
The difference equation (20) can be solved to give
(21)
a
n
=
∑
k
=
n
+
1
(
k
+
n
)
odd
m
+
1
‍
g
k
,
n
A
k
+
∑
k
=
n
+
2
(
k
+
n
)
even
m
+
1
‍
f
k
,
n
A
k
,
n
=
0,1
,
…
,
m
,
where
(22)
g
k
,
n
=
(
k
+
n
+
2
α
+
2
)
Γ
(
k
+
α
+
1
)
Γ
(
n
+
2
α
+
2
)
Γ
(
k
+
2
α
+
2
)
Γ
(
n
+
α
+
1
)
,
(23)
f
k
,
n
=
(
k
-
n
)
Γ
(
k
+
α
+
1
)
Γ
(
n
+
2
α
+
2
)
Γ
(
k
+
2
α
+
2
)
Γ
(
n
+
α
+
1
)
.
If we substitute (21) into (14), we get
(24)
S
m
(
x
)
=
∑
n
=
0
m
‍
{
∑
k
=
n
+
1
(
k
+
n
)
odd
m
+
1
‍
g
k
,
n
A
k
+
∑
k
=
n
+
2
(
k
+
n
)
even
m
+
1
‍
f
k
,
n
A
k
,
}
P
n
(
α
,
α
+
1
)
(
x
)
.
On the other hand, if we differentiate (19) with respect to x, we have
(25)
S
m
(
x
)
=
∑
n
=
0
m
+
1
‍
A
n
D
P
n
(
α
,
α
+
1
)
(
x
)
.
Equating the two right-hand sides of the two relations (24) and (25) yields
(26)
∑
n
=
0
m
‍
{
∑
k
=
n
+
1
(
k
+
n
)
odd
m
+
1
‍
g
k
,
n
A
k
+
∑
k
=
n
+
2
(
k
+
n
)
even
m
+
1
‍
f
k
,
n
A
k
,
}
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
n
=
0
m
+
1
‍
A
n
D
P
n
(
α
,
a
+
1
)
(
x
)
.
Expanding the left-hand side of (26) and collecting the similar terms, (26) may be written—after some rather manipulation—in the form
(27)
∑
n
=
0
m
+
1
‍
A
n
B
n
(
x
)
=
∑
n
=
0
m
+
1
‍
A
n
D
P
n
(
α
,
a
+
1
)
(
x
)
,
where
(28)
B
n
(
x
)
=
∑
r
=
0
⌊
(
n
-
1
)
/
2
⌋
‍
g
n
,
n
-
2
r
-
1
P
n
-
2
r
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
n
/
2
⌋
-
1
‍
f
n
,
n
-
2
r
-
2
P
n
-
2
r
-
2
(
α
,
α
+
1
)
(
x
)
,
and g
k
,
n, f
k
,
n are given by (22) and (23), respectively. This immediately yields
(29)
D
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
1
)
/
2
⌋
‍
d
n
,
r
P
n
-
2
r
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
n
/
2
⌋
-
1
‍
e
n
,
r
P
n
-
2
r
-
2
(
α
,
α
+
1
)
(
x
)
,
where
(30)
d
n
,
r
=
(
2
n
-
2
r
+
2
α
+
1
)
Γ
(
n
+
α
+
1
)
Γ
(
n
-
2
r
+
2
α
+
1
)
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
2
r
+
α
)
,
e
n
,
r
=
2
(
r
+
1
)
Γ
(
n
+
α
+
1
)
Γ
(
n
-
2
r
+
2
α
)
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
2
r
+
α
-
1
)
,
and this completes the proof of of Lemma 3.Now, we extend the result of Lemma3 to give the qth-derivative of the Jacobi polynomials P
n
(
α
,
α
+
1
)
(
x
) in terms of their original polynomials. The general formula is stated in the following theorem.Theorem 4.
For allq
≥
1, the qth-derivative of the classical Jacobi polynomials P
n
(
α
,
α
+
1
)
(
x
) of any degree and for any order in terms of their corresponding Jacobi polynomials is given explicitly by
(31)
D
q
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
A
n
,
r
,
q
P
n
-
2
r
-
q
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
B
n
,
r
,
q
P
n
-
2
r
-
q
-
1
(
α
,
α
+
1
)
(
x
)
,
where
(32)
A
n
,
r
,
q
=
(
2
q
(
q
+
r
-
1
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
3
2
)
i
2
q
(
q
+
r
-
1
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
3
2
)
×
Γ
(
n
-
q
-
2
r
+
2
α
+
2
)
)
×
(
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
+
1
)
Γ
(
n
-
q
-
r
+
α
+
3
2
)
×
Γ
(
n
-
q
-
r
+
α
+
3
2
)
)
-
1
,
(33)
B
n
,
r
,
q
=
(
2
q
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
1
2
)
i
(
2
q
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
1
2
)
2
q
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
1
2
)
×
Γ
(
n
-
q
-
2
r
+
2
α
+
1
)
)
×
(
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
)
Γ
(
n
-
q
-
r
+
α
+
3
2
)
×
Γ
(
n
-
q
-
r
+
α
+
3
2
)
)
-
1
.Proof.
We proceed by induction onq. For q
=
1, Theorem 4 reduces identically to Lemma 3. Assume that relation (31) holds, and we have to show that
(34)
D
q
+
1
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
A
n
,
r
,
q
+
1
P
n
-
2
r
-
q
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
-
1
‍
B
n
,
r
,
q
+
1
P
n
-
2
r
-
q
-
2
(
α
,
α
+
1
)
(
x
)
.
If we differentiate relation (31), then we get
(35)
D
q
+
1
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
A
n
,
r
,
q
D
P
n
-
2
r
-
q
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
B
n
,
r
,
q
D
P
n
-
2
r
-
q
-
1
(
α
,
α
+
1
)
(
x
)
,
and in virtue of Lemma 3, one can write
(36)
D
q
+
1
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
1
‍
+
∑
2
‍
,
where
(37)
∑
1
‍
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
A
n
,
r
,
q
∑
s
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
-
r
‍
d
n
-
q
-
2
r
,
s
P
n
-
q
-
2
r
-
2
s
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
B
n
,
r
,
q
∑
s
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
-
r
-
1
‍
e
n
-
q
-
2
r
-
1
,
s
P
n
-
q
-
2
r
-
2
s
-
3
(
α
,
α
+
1
)
(
x
)
,
∑
2
‍
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
A
n
,
r
,
q
∑
s
=
0
⌊
(
n
-
q
)
/
2
⌋
-
r
-
1
‍
e
n
-
q
-
2
r
,
s
P
n
-
q
-
2
r
-
2
s
-
2
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
B
n
,
r
,
q
∑
s
=
0
⌊
(
n
-
q
)
/
2
⌋
-
r
-
1
‍
d
n
-
q
-
2
r
-
1
,
s
P
n
-
q
-
2
r
-
2
s
-
2
(
α
,
α
+
1
)
(
x
)
.
If we expand ∑
1 and ∑
2 and collecting similar terms and after some lengthy manipulations, we get
(38)
D
q
+
1
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
A
¯
n
,
r
,
q
P
n
-
2
r
-
q
-
1
(
α
,
α
+
1
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
-
1
‍
B
¯
n
,
r
,
q
P
n
-
2
r
-
q
-
2
(
α
,
α
+
1
)
(
x
)
,
where
(39)
A
¯
n
,
r
,
q
=
∑
j
=
0
r
‍
{
A
n
,
j
,
q
d
n
-
q
-
2
j
,
r
-
j
+
B
n
,
j
,
q
e
n
-
q
-
2
j
-
1
,
r
-
j
-
1
}
,
B
¯
n
,
r
,
q
=
∑
j
=
0
r
‍
{
A
n
,
j
,
q
e
n
-
q
-
2
j
,
r
-
j
+
B
n
,
j
,
q
d
n
-
q
-
2
j
-
1
,
r
-
j
}
.
It is not difficult to show that
(40)
A
¯
n
,
r
,
q
=
(
2
q
-
1
(
2
n
-
2
r
+
2
α
+
1
)
Γ
(
n
+
α
+
1
)
i
×
Γ
(
n
-
q
-
2
r
+
2
α
+
1
)
2
q
-
1
)
×
(
(
q
-
1
)
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
)


)
-
1
×
∑
j
=
0
r
(

×
(
j
!
Γ
(
n
-
j
-
q
+
α
+
3
2
)
)
-
1

(
×
Γ
(
n
-
j
+
α
+
1
2
)


(
j
+
q
-
1
)
!
(
2
n
-
4
j
-
2
q
+
2
α
+
1
)
×
Γ
(
n
-
j
+
α
+
1
2
)
)
×
(
j
!
Γ
(
n
-
j
-
q
+
α
+
3
2
)
)
-
1
)
,
B
¯
n
,
r
,
q
=
(
2
q
(
q
+
r
+
1
)
Γ
(
n
+
α
+
1
)
i
×
Γ
(
n
-
q
-
2
r
+
2
α
)
2
q
)
×
(
(
q
-
1
)
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
-
1
)
)
-
1
×
∑
j
=
0
r
‍
(


×
(
j
!
Γ
(
n
-
j
-
q
+
α
+
3
2
)
)
-
1
(
×
Γ
(
n
-
j
+
α
+
1
2
)


(
j
+
q
-
1
)
!
(
2
n
-
4
j
-
2
q
+
2
α
+
1
)
×
Γ
(
n
-
j
+
α
+
1
2
)
)
×
(
j
!
Γ
(
n
-
j
-
q
+
α
+
3
2
)
)
-
1
)
.
To complete the proof of Theorem4, the following lemma—which can be easily proved by induction—is required.
Lemma
5.
For every nonnegative integer
r
, one has
(41)
∑
j
=
0
r
(
j
+
q
-
1
)
!
(
2
n
-
4
j
-
2
q
+
2
α
+
1
)
Γ
(
n
-
j
+
α
+
1
/
2
)
j
!
Γ
(
n
-
j
-
q
+
α
+
3
/
2
)
=
2
(
q
+
r
)
!
Γ
(
n
-
r
+
α
+
1
/
2
)
q
r
!
Γ
(
n
-
q
-
r
+
α
+
1
/
2
)
.
Now, the application of Lemma 5 in (40) yields
(42)
A
-
n
,
r
,
q
=
(
2
q
+
1
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
3
2
)
×
2
q
+
1
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
3
2
)
Γ
(
n
-
q
-
2
r
+
2
α
+
1
)
)
×
(
(
n
-
q
-
r
+
α
+
1
2
)
q
!
r
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
)
×
Γ
(
n
-
q
-
r
+
α
+
1
2
)
)
-
1
=
A
n
,
r
,
q
+
1
,
B
-
n
,
r
,
q
=
(
2
q
+
1
(
q
+
r
+
1
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
1
2
)
2
q
+
1
(
q
+
r
+
1
)
!
Γ
(
n
+
α
+
1
)
Γ
(
n
-
r
+
α
+
1
2
)
×
Γ
(
n
-
q
-
2
r
+
2
α
)
)
×
(
(
n
-
q
-
r
+
α
+
1
2
)
q
!
r
!
Γ
(
n
+
2
α
+
2
)
Γ
(
n
-
q
-
2
r
+
α
-
1
)
×
Γ
(
n
-
q
-
r
+
α
+
1
2
)
)
-
1
=
B
r
,
n
,
q
+
1
.
This proves formula (34) and hence completes the proof of Theorem 4.Remark 6.
It is worthy to note here that relation (31) may be written alternatively in the equivalent form
(43)
D
q
P
n
(
α
,
α
+
1
)
(
x
)
=
∑
i
=
0
n
-
q
‍
E
n
,
i
,
q
P
i
(
α
,
α
+
1
)
(
x
)
,
where
(44)
E
n
,
i
,
q
=
2
q
Γ
(
n
+
α
+
1
)
Γ
(
i
+
2
α
+
2
)
(
q
-
1
)
!
Γ
(
i
+
α
+
1
)
Γ
(
n
+
2
α
+
2
)
×
{
(
(
n
-
i
+
q
-
2
)
/
2
)
!
Γ
(
(
n
+
i
+
q
+
2
α
+
3
)
/
2
)
(
(
n
-
i
-
q
)
/
2
)
!
Γ
(
(
n
+
i
-
q
+
2
α
+
3
)
/
2
)
,
(
n
+
i
+
q
)
even
,
(
(
n
-
i
+
q
-
1
)
/
2
)
!
Γ
(
(
n
+
i
+
q
+
2
α
+
2
)
/
2
)
(
(
n
-
i
-
q
-
1
)
/
2
)
!
Γ
(
(
n
+
i
-
q
+
2
α
+
4
)
/
2
)
,
i
(
n
+
i
+
q
)
odd
.Remark 7.
As a direct consequence of relation (3), the qth-derivative of P
n
(
α
+
1
,
α
)
(
x
) is given by
(45)
D
q
P
n
(
α
+
1
,
α
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
A
n
,
r
,
q
P
n
-
2
r
-
q
(
α
+
1
,
α
)
(
x
)
-
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
B
n
,
r
,
q
P
n
-
2
r
-
q
-
1
(
α
+
1
,
α
)
(
x
)
,
where A
n
,
r
,
q and B
n
,
r
,
q are given by (32) and (33), respectively, or alternatively in the form
(46)
D
q
P
n
(
α
+
1
,
α
)
(
x
)
=
∑
i
=
0
n
-
q
‍
(
-
1
)
n
+
i
+
q
E
n
,
i
,
q
P
i
(
α
+
1
,
α
)
(
x
)
,
where E
n
,
i
,
q is given by (44).As a special case of the two formulae (31) and (45) and if we set α
=
-
1
/
2, the derivatives of Chebyshev polynomials of third kind (V
n
(
x
)) and of fourth kind (W
n
(
x
)) can be easily deduced. These two results are given in the following two corollaries.Corollary 8.
For allq
≥
1, the qth-derivative of V
n
(
x
) of any degree and for any order in terms of their corresponding polynomials is given explicitly by
(47)
D
q
V
n
(
x
)
=
2
q
(
q
-
1
)
!
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
(
n
-
r
)
!
(
r
+
q
-
1
)
!
r
!
(
n
-
r
-
q
)
!
V
n
-
2
r
-
q
(
x
)
+
2
q
(
q
-
1
)
!
×
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
(
n
-
r
-
1
)
!
(
r
+
q
)
!
r
!
(
n
-
r
-
q
)
!
V
n
-
2
r
-
q
-
1
(
x
)
.Corollary 9.
For allq
≥
1, the qth-order derivative of W
n
(
x
) of any degree and for any order in terms of their corresponding polynomials is given explicitly by
(48)
D
q
W
n
(
x
)
=
2
q
(
q
-
1
)
!
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
(
n
-
r
)
!
(
r
+
q
-
1
)
!
r
!
(
n
-
r
-
q
)
!
W
n
-
2
r
-
q
(
x
)
-
2
q
(
q
-
1
)
!
×
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
(
n
-
r
-
1
)
!
(
r
+
q
)
!
r
!
(
n
-
r
-
q
)
!
W
n
-
2
r
-
q
-
1
(
x
)
.


## 4. High-Order Derivatives ofP
n
(
α
,
α
+
2
)
(
x
) and P
n
(
α
+
2
,
α
)
(
x
)

In this section, and following similar procedures to those followed in Section3, we can obtain new derivatives formulae for the high-order derivatives of the Jacobi polynomials P
n
(
α
,
α
+
2
)
(
x
) and P
n
(
α
+
2
,
α
)
(
x
) in terms of their corresponding Jacobi polynomials. The details of the required computations are lengthy and will not be given here.Theorem 10.
For allq
≥
1, the qth-derivative of the classical Jacobi polynomials P
n
(
α
,
α
+
2
)
(
x
) of any degree and for any order in terms of their corresponding Jacobi polynomials is given explicitly by
(49)
D
q
P
n
(
α
,
α
+
2
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
G
n
,
r
,
q
P
n
-
2
r
-
q
(
α
,
α
+
2
)
(
x
)
+
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
H
n
,
r
,
q
P
n
-
2
r
-
q
-
1
(
α
,
α
+
2
)
(
x
)
,
where
(50)
G
n
,
r
,
q
=
(
2
-
q
-
2
r
(
q
+
r
-
1
)
!
Γ
(
n
+
α
+
1
)
Γ
(
2
n
-
2
r
+
2
α
+
3
)
)
×
(
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
3
)
(
n
-
q
-
2
r
+
α
+
2
)
i
×
Γ
(
n
-
r
+
α
+
2
)
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
3
)
(
n
-
q
-
2
r
+
α
+
2
)
)
-
1
×
Γ
(
n
-
q
-
2
r
+
2
α
+
3
)
Γ
(
n
-
q
-
2
r
+
α
+
5
/
2
)
Γ
(
2
n
-
2
q
-
4
r
+
2
α
+
3
)
Γ
(
n
-
q
-
r
+
α
+
5
/
2
)
×
(
n
2
-
n
(
q
+
2
r
-
2
α
-
3
)
-
α
(
q
+
2
r
)
i
+
2
r
(
q
+
r
)
-
q
-
3
r
+
α
2
+
3
α
+
2
)
,
(51)
H
n
,
r
,
q
=
(
2
-
q
-
2
r
(
q
+
r
)
!
Γ
(
n
+
α
+
1
)
Γ
(
2
(
n
-
r
+
α
+
1
)
)
)
×
(
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
3
)
(
n
-
q
-
2
r
+
α
+
1
)
i
×
Γ
(
n
-
r
+
α
+
1
)
(
q
-
1
)
!
r
!
Γ
(
n
+
2
α
+
3
)
(
n
-
q
-
2
r
+
α
+
1
)
)
-
1
×
Γ
(
n
-
q
-
2
r
+
α
+
3
/
2
)
Γ
(
n
-
q
-
2
r
+
2
α
+
2
)
Γ
(
n
-
q
-
r
+
α
+
3
/
2
)
Γ
(
2
n
-
2
q
-
4
r
+
2
α
+
1
)
.Remark 11.
As a direct consequence of relation (49), the qth-derivative of P
n
(
α
+
2
,
α
)
(
x
) is given by
(52)
D
q
P
n
(
α
+
2
,
α
)
(
x
)
=
∑
r
=
0
⌊
(
n
-
q
)
/
2
⌋
‍
G
n
,
r
,
q
P
n
-
2
r
-
q
(
α
+
2
,
α
)
(
x
)
-
∑
r
=
0
⌊
(
n
-
q
-
1
)
/
2
⌋
‍
H
n
,
r
,
q
P
n
-
2
r
-
q
-
1
(
α
+
2
,
α
)
(
x
)
,
where G
n
,
r
,
q and H
n
,
r
,
q are given by (50) and (51), respectively.


## 5. Reduction Formulae for Some Terminating Hypergeometric Functions of the TypeF
2
3
(
1
)

In this section, four new reduction formulae for theF
2
3
(
1
) that appears in relation (11) are deduced for certain choices of the two parameters α and β. These formulae are given in the following four corollaries.Corollary 12.
For alli
,
n
,
q
∈
Z
≥
0 and i
≤
n
-
q, one has
(53)
F
2
3
(
-
n
+
i
+
q
,
n
+
i
+
q
+
2
α
+
2
,
i
i
+
α
+
1
;
i
+
q
+
α
+
1
,
2
i
+
2
α
+
3
∣
1
)
=
Γ
(
i
+
α
+
3
/
2
)
Γ
(
i
+
q
+
α
+
1
)
π
(
q
-
1
)
!
×
{

(
(
n
-
i
+
q
-
2
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
1
)
/
2
)
Γ
(
(
n
+
i
+
q
+
2
α
+
2
)

/
2
)

Γ

(
(
n
+
i
-
q
+
2
α
+
3
)

/
2
)
,

(
n
+
i
+
q
)
e
v
e
n
,

(
(
n
-
i
+
q
-
1
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
2
)
/
2
)
Γ
(
(
n
+
i
+
q
+
2
α
+
3
)

/
2
)

Γ

(
(
n
+
i
-
q
+
2
α
+
4
)

/
2
)
,

(
n
+
i
+
q
)
o
d
d
,
F
2
3
(
-
n
+
i
+
q
,
n
+
i
+
q
+
2
α
,
i
i
+
α
+
1
;
i
+
q
+
α
+
1
,
2
i
+
2
α
+
1
∣
1
)
=
Γ
(
i
+
α
+
1
/
2
)
Γ
(
i
+
q
+
α
+
1
)
π
(
q
-
1
)
!
(
n
+
α
)
×
{

(
(
n
-
i
+
q
-
2
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
1
)
/
2
)
Γ
(
(
n
+
i
+
q
+
2
α
)

/
2
)

Γ

(
(
n
+
i
-
q
+
2
α
+
1
)

/
2
)
,

(
n
+
i
+
q
)
e
v
e
n
,

-
(
(
n
-
i
+
q
-
1
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
2
)
/
2
)
Γ
(
(
n
+
i
+
q
+
2
α
+
1
)

/
2
)

Γ

(
(
n
+
i
-
q
+
2
α
+
2
)

/
2
)
,

(
n
+
i
+
q
)
o
d
d
.Corollary 13.
For alli
,
n
,
q
∈
Z
≥
0 and i
≤
n
-
q, one has
(54)
F
2
3
(
-
n
+
i
+
q
,
n
+
i
+
q
+
2
α
+
3
,
i
i
+
α
+
1
;
i
+
q
+
α
+
1
,
2
i
+
2
α
+
4
∣
1
)
=
2
-
2
(
i
+
α
+
2
)
Γ
(
2
i
+
2
α
+
4
)
Γ
(
i
+
q
+
α
+
1
)
(
q
-
1
)
!
Γ
(
i
+
α
+
3
)
×
{
(
(
n
-
i
+
q
-
2
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
1
)
/
2
)
Γ
(
(
n
+
i
-
q
+
2
α
+
5
)

/
2
)

Γ

(
(
n
+
i
+
q
+
2
α
+
4
)

/
2
)
×
ξ
i
,
n
,
α
,
(
n
+
i
+
q
)
e
v
e
n
,
4
(
(
n
-
i
+
q
-
1
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
2
)
/
2
)
Γ
(
(
n
+
i
-
q
+
2
α
+
4
)

/
2
)

Γ

(
(
n
+
i
+
q
+
2
α
+
3
)

/
2
)
,
(
n
+
i
+
q
)
o
d
d
,
F
2
3
(
-
n
+
i
+
q
,
n
+
i
+
q
+
2
α
-
1
,
i
i
+
α
+
1
;
i
+
q
+
α
+
1,2
i
+
2
α
∣
1
)
=
Γ
(
i
+
α
+
1
/
2
)
Γ
(
i
+
q
+
α
+
1
)
2
π
(
q
-
1
)
!
(
i
+
α
)
(
n
+
α
-
1
)
(
n
+
α
)
×
{
(
(
n
-
i
+
q
-
2
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
1
)
/
2
)
Γ
(
(
n
+
i
-
q
+
2
α
+
1
)

/
2
)

Γ

(
(
n
+
i
+
q
+
2
α
)

/
2
)
×
η
i
,
n
,
α
,
(
n
+
i
+
q
)
e
v
e
n
,
-
4
(
(
n
-
i
+
q
-
1
)
/
2
)
!
Γ
(
(
n
-
i
-
q
+
2
)
/
2
)
Γ
(
(
n
+
i
-
q
+
2
α
)

/
2
)

Γ

(
(
n
+
i
+
q
+
2
α
-
1
)

/
2
)
,
(
n
+
i
+
q
)
o
d
d
,
where
(55)
ξ
i
,
n
,
α
=
i
2
+
2
α
(
i
+
n
+
3
)
+
3
i
+
n
2
+
3
n
-
q
2
+
q
+
2
α
2
+
4
,
η
n
,
i
,
α
=
i
2
+
2
α
(
i
+
n
-
1
)
-
i
+
n
2
-
n
-
q
2
+
q
+
2
α
2
.Proof.
The proofs of the four reduction formulae in Corollaries12 and 13 can be deduced immediately, by comparing the four relations (43), (46), (49), and (52) with the corresponding results obtained from the general relation in (10).


## 6. Jacobi Galerkin Algorithms for Sixth-Order Two-Point Boundary Value Problems

In this section, and as an application, we are interested in applying the introduced derivatives formulae which were obtained in Sections3 and 4, for the sake of solving the following sixth-order two-point BVPs:
(56)
-
y
(
6
)
(
x
)
+
γ
y
(
x
)
=
f
(
x
)
,
x
∈
(
-
1,1
)
,
governed by the nonhomogeneous boundary conditions
(57)
y
(
r
)
(
±
1
)
=
±
α
r
,
r
=
0,1
,
2
,
where γ is a real constant.We draw the reader’s attention that (56) governed by the nonhomogeneous boundary conditions (57) can be easily transformed to the equation (see [17])
(58)
-
u
(
6
)
(
x
)
+
γ
u
(
x
)
=
g
(
x
)
,
x
∈
(
-
1,1
)
,
governed by the homogeneous boundary conditions
(59)
u
(
r
)
(
±
1
)
=
0
,
r
=
0,1
,
2
,
where
(60)
g
(
x
)
=
f
(
x
)
+
∑
i
=
0
5
‍
η
i
x
i
,
and η
i, 0
≤
i
≤
2
n
-
1, are some constants.Now, we define the following spaces:(61)
S
N
=
span
⁡
{
P
0
(
α
,
β
)
(
x
)
,
P
1
(
α
,
β
)
(
x
)
,
P
2
(
α
,
β
)
(
x
)
,
…
,
P
N
(
α
,
β
)
(
x
)
}
,
V
N
=
{
v
∈
S
N
:
D
j
v
(
±
1
)
=
0
,
j
=
0,1
,
2
}
.
The Jacobi-Galerkin procedure for solving (56) subject to the boundary conditions (57) is to find u
N
∈
V
N such that
(62)
(
-
D
6
u
N
,
v
)
w
+
γ
(
u
N
,
v
)
w
=
(
g
,
v
)
w
,
∀
v
∈
V
N
,
where w
=
(
1
-
x
)
α
(
1
+
x
)
β, and (
u
,
v
)
w
=
∫
-
1
1
‍
w
u
v
d
x is the scalar inner product in the weighted space L
w
2
(
-
1,1
).


### 6.1. Basis Functions in Terms of Certain Parameters Jacobi Polynomials

In this section, we consider four kinds of basis functions satisfying the boundary conditions (59). Assume that these basis functions can be expressed in the following forms:
(63)
ϕ
1
,
k
=
P
k
(
α
,
α
+
1
)
(
x
)
+
∑
m
=
1
6
‍
d
1
,
m
,
k
P
k
+
m
(
α
,
α
+
1
)
(
x
)
,
ϕ
2
,
k
=
P
k
(
α
+
1
,
α
)
(
x
)
+
∑
m
=
1
6
‍
d
2
,
m
,
k
P
k
+
m
(
α
+
1
,
α
)
(
x
)
,
ϕ
3
,
k
=
P
k
(
α
,
α
+
2
)
(
x
)
+
∑
m
=
1
6
‍
d
3
,
m
,
k
P
k
+
m
(
α
,
α
+
2
)
(
x
)
,
ϕ
4
,
k
=
P
k
(
α
+
2
,
α
)
(
x
)
+
∑
m
=
1
6
‍
d
4
,
m
,
k
P
k
+
m
(
α
+
2
,
α
)
(
x
)
,
and k
=
0,1
,
2
,
…
,
N
-
6.The coefficients{
d
i
,
m
,
k
}, 1
≤
i
≤
4, are uniquely determined such that each member of ϕ
i
,
k
(
x
), 1
≤
i
≤
4, satisfies the boundary conditions (57). For example, the coefficients {
d
1
,
m
,
k
} are given explicitly by
(64)
d
1
,
m
,
k
=
{
(
-
1
)
m
/
2
Γ
(
α
+
1
)
(
3
m
/
2
)
(
k
+
m
)
!
(
k
+
α
+
3
/
2
)
m
/
2
Γ
(
k
+
m
+
α
+
1
)
(
k
+
α
+
9
/
2
)
m
/
2
,
i
m
=
2,4
,
6
,
(
(
-
1
)
(
m
-
1
)
/
2
(
m
-
7
)
Γ
(
α
+
1
)
(
3
(
m
-
1
)
/
2
)
×
Γ
(
k
+
m
+
1
)
(
k
+
α
+
3
/
2
)
(
m
-
1
)
/
2
(
3
(
m
-
1
)
/
2
)
)
×
(
2
Γ
(
k
+
m
+
α
+
1
)
(
k
+
α
+
9
/
2
)
(
m
+
1
)
/
2
)
-
1
,
i
m
=
1,3
,
5
.
Now, the four variational formulations corresponding to the four choices of the basis functions can be written as
(65)
(
-
D
6
u
i
,
N
,
ϕ
i
,
k
)
w
i
+
γ
(
u
i
,
N
,
ϕ
i
,
k
)
w
i
=
(
g
,
ϕ
i
,
k
)
w
i
,
1
≤
i
≤
4
,
where
(66)
w
1
=
(
1
-
x
)
α
(
1
+
x
)
α
+
1
,
w
2
=
(
1
-
x
)
α
(
1
+
x
)
α
-
1
,
w
3
=
(
1
-
x
)
α
(
1
+
x
)
α
+
2
,
w
4
=
(
1
-
x
)
α
(
1
+
x
)
α
-
2
,
u
i
,
N
=
∑
r
=
0
N
-
6
‍
c
i
,
r
ϕ
i
,
r
.
For 1
≤
i
≤
4, let us denote
(67)
g
i
,
k
=
(
g
,
ϕ
i
,
k
)
w
i
,
g
i
=
(
g
i
,
0
,
g
i
,
1
,
…
,
g
i
,
N
-
6
)
T
,
A
i
=
(
a
k
j
i
)
0
≤
k
,
j
≤
N
-
6
,
B
i
=
(
b
k
j
i
)
0
≤
k
,
j
≤
N
-
6
,
c
i
=
(
c
i
,
0
,
c
i
,
1
,
…
,
c
i
,
N
-
6
)
T
,
and then (65) is equivalent to the following four matrix systems:
(68)
(
A
i
+
γ
B
i
)
c
i
=
g
i
,
where the nonzero elements of the matrices A
i and B
i, 1
≤
i
≤
4, can be given explicitly.Now, we give a numerical example to show the applicability and the efficiency of the proposed algorithm.Example 14.
Consider the following sixth-order linear boundary value problem (see El-Gamel et al. [19], Akram and Siddiqi [20], and Lamnii et al. [21]):
(69)
y
(
6
)
(
t
)
-
y
(
t
)
=
-
6
e
t
,
t
∈
[
0,1
]
,
y
(
0
)
=
1
,
y
′
(
0
)
=
0
,
y
′
′
(
0
)
=
-
1
,
y
(
1
)
=
0
,
y
′
(
1
)
=
-
e
,
y
′
′
(
1
)
=
-
2
e
.
The analytic solution to (69) is (
1
-
t
)
e
t.
The transformationt
=
(
1
+
x
)
/
2 turns (69) into
(70)
u
(
6
)
(
x
)
-
u
(
x
)
=
-
6
e
(
x
+
1
)
/
2
,
x
∈
[
-
1,1
]
,
u
(
-
1
)
=
1
,
u
′
(
-
1
)
=
0
,
u
′
′
(
-
1
)
=
-
1
,
u
(
1
)
=
0
,
u
′
(
1
)
=
-
e
,
u
′
′
(
1
)
=
-
2
e
,
with the analytic solution u
(
x
)
=
(
1
/
2
)
(
1
-
x
)
e
(
1
+
x
)
/
2.
In Table1, we denote E
=
|
u
-
u
N
| by the absolute errors resulting from the application of the Jacobi Galekin method (JGM) for problem (70) for various values of the parameters α, β, and N. Moreover, Table 2 displays a comparison between the best errors resulting from the application of JGM with the results obtained by applying the following three methods:(i)
sinc-Galerkin method developed in [19],
(ii)
nonpolynomial spline technique developed in [20],
(iii)
spline collocation method developed in [21].The results in Table 2 indicate that our method is more accurate if compared with all of the above-mentioned methods.Table 1
Maximum absolute errorE for N
=
8, 12, 16.
N
α
β
E
8
-
1
2
1
2
1.5451 · 1
0
-
8
1
2
-
1
2
1.497 · 1
0
-
8
0
1
2.72189 · 1
0
-
8
1
0
2.71475 · 1
0
-
8
-
1
2
3
2
8.1876 · 1
0
-
8
3
2
-
1
2
7.6352 · 1
0
-
8
0
2
9.35247 · 1
0
-
8
2
0
8.87656 · 1
0
-
8
12
-
1
2
1
2
1.03683 · 1
0
-
14
1
2
-
1
2
1.03251 · 1
0
-
14
0
1
2.56597 · 1
0
-
14
1
0
2.56661 · 1
0
-
14
-
1
2
3
2
9.67494 · 1
0
-
14
3
2
-
1
2
9.25758 · 1
0
-
14
0
2
1.43156 · 1
0
-
13
2
0
1.37795 · 1
0
-
13
16
-
1
2
1
2
3.15286 · 1
0
-
16
1
2
-
1
2
3.1637 · 1
0
-
16
0
1
2.57166 · 1
0
-
16
1
0
2.83627 · 1
0
-
16
-
1
2
3
2
2.4723 · 1
0
-
16
3
2
-
1
2
3.38054 · 1
0
-
16
0
2
5.22802 · 1
0
-
16
2
0
3.47378 · 1
0
-
16Table 2
Comparison between the best errors of different methods.
Error
JGM
Method in [19]
Method in [20]
Method in [21]
E
2.4723 · 1
0
-
16
1.00 · 1
0
-
4
1.70 · 1
0
-
7
2.370 · 1
0
-
9


## 6.1. Basis Functions in Terms of Certain Parameters Jacobi Polynomials

In this section, we consider four kinds of basis functions satisfying the boundary conditions (59). Assume that these basis functions can be expressed in the following forms:
(63)
ϕ
1
,
k
=
P
k
(
α
,
α
+
1
)
(
x
)
+
∑
m
=
1
6
‍
d
1
,
m
,
k
P
k
+
m
(
α
,
α
+
1
)
(
x
)
,
ϕ
2
,
k
=
P
k
(
α
+
1
,
α
)
(
x
)
+
∑
m
=
1
6
‍
d
2
,
m
,
k
P
k
+
m
(
α
+
1
,
α
)
(
x
)
,
ϕ
3
,
k
=
P
k
(
α
,
α
+
2
)
(
x
)
+
∑
m
=
1
6
‍
d
3
,
m
,
k
P
k
+
m
(
α
,
α
+
2
)
(
x
)
,
ϕ
4
,
k
=
P
k
(
α
+
2
,
α
)
(
x
)
+
∑
m
=
1
6
‍
d
4
,
m
,
k
P
k
+
m
(
α
+
2
,
α
)
(
x
)
,
and k
=
0,1
,
2
,
…
,
N
-
6.The coefficients{
d
i
,
m
,
k
}, 1
≤
i
≤
4, are uniquely determined such that each member of ϕ
i
,
k
(
x
), 1
≤
i
≤
4, satisfies the boundary conditions (57). For example, the coefficients {
d
1
,
m
,
k
} are given explicitly by
(64)
d
1
,
m
,
k
=
{
(
-
1
)
m
/
2
Γ
(
α
+
1
)
(
3
m
/
2
)
(
k
+
m
)
!
(
k
+
α
+
3
/
2
)
m
/
2
Γ
(
k
+
m
+
α
+
1
)
(
k
+
α
+
9
/
2
)
m
/
2
,
i
m
=
2,4
,
6
,
(
(
-
1
)
(
m
-
1
)
/
2
(
m
-
7
)
Γ
(
α
+
1
)
(
3
(
m
-
1
)
/
2
)
×
Γ
(
k
+
m
+
1
)
(
k
+
α
+
3
/
2
)
(
m
-
1
)
/
2
(
3
(
m
-
1
)
/
2
)
)
×
(
2
Γ
(
k
+
m
+
α
+
1
)
(
k
+
α
+
9
/
2
)
(
m
+
1
)
/
2
)
-
1
,
i
m
=
1,3
,
5
.
Now, the four variational formulations corresponding to the four choices of the basis functions can be written as
(65)
(
-
D
6
u
i
,
N
,
ϕ
i
,
k
)
w
i
+
γ
(
u
i
,
N
,
ϕ
i
,
k
)
w
i
=
(
g
,
ϕ
i
,
k
)
w
i
,
1
≤
i
≤
4
,
where
(66)
w
1
=
(
1
-
x
)
α
(
1
+
x
)
α
+
1
,
w
2
=
(
1
-
x
)
α
(
1
+
x
)
α
-
1
,
w
3
=
(
1
-
x
)
α
(
1
+
x
)
α
+
2
,
w
4
=
(
1
-
x
)
α
(
1
+
x
)
α
-
2
,
u
i
,
N
=
∑
r
=
0
N
-
6
‍
c
i
,
r
ϕ
i
,
r
.
For 1
≤
i
≤
4, let us denote
(67)
g
i
,
k
=
(
g
,
ϕ
i
,
k
)
w
i
,
g
i
=
(
g
i
,
0
,
g
i
,
1
,
…
,
g
i
,
N
-
6
)
T
,
A
i
=
(
a
k
j
i
)
0
≤
k
,
j
≤
N
-
6
,
B
i
=
(
b
k
j
i
)
0
≤
k
,
j
≤
N
-
6
,
c
i
=
(
c
i
,
0
,
c
i
,
1
,
…
,
c
i
,
N
-
6
)
T
,
and then (65) is equivalent to the following four matrix systems:
(68)
(
A
i
+
γ
B
i
)
c
i
=
g
i
,
where the nonzero elements of the matrices A
i and B
i, 1
≤
i
≤
4, can be given explicitly.Now, we give a numerical example to show the applicability and the efficiency of the proposed algorithm.Example 14.
Consider the following sixth-order linear boundary value problem (see El-Gamel et al. [19], Akram and Siddiqi [20], and Lamnii et al. [21]):
(69)
y
(
6
)
(
t
)
-
y
(
t
)
=
-
6
e
t
,
t
∈
[
0,1
]
,
y
(
0
)
=
1
,
y
′
(
0
)
=
0
,
y
′
′
(
0
)
=
-
1
,
y
(
1
)
=
0
,
y
′
(
1
)
=
-
e
,
y
′
′
(
1
)
=
-
2
e
.
The analytic solution to (69) is (
1
-
t
)
e
t.
The transformationt
=
(
1
+
x
)
/
2 turns (69) into
(70)
u
(
6
)
(
x
)
-
u
(
x
)
=
-
6
e
(
x
+
1
)
/
2
,
x
∈
[
-
1,1
]
,
u
(
-
1
)
=
1
,
u
′
(
-
1
)
=
0
,
u
′
′
(
-
1
)
=
-
1
,
u
(
1
)
=
0
,
u
′
(
1
)
=
-
e
,
u
′
′
(
1
)
=
-
2
e
,
with the analytic solution u
(
x
)
=
(
1
/
2
)
(
1
-
x
)
e
(
1
+
x
)
/
2.
In Table1, we denote E
=
|
u
-
u
N
| by the absolute errors resulting from the application of the Jacobi Galekin method (JGM) for problem (70) for various values of the parameters α, β, and N. Moreover, Table 2 displays a comparison between the best errors resulting from the application of JGM with the results obtained by applying the following three methods:(i)
sinc-Galerkin method developed in [19],
(ii)
nonpolynomial spline technique developed in [20],
(iii)
spline collocation method developed in [21].The results in Table 2 indicate that our method is more accurate if compared with all of the above-mentioned methods.Table 1
Maximum absolute errorE for N
=
8, 12, 16.
N
α
β
E
8
-
1
2
1
2
1.5451 · 1
0
-
8
1
2
-
1
2
1.497 · 1
0
-
8
0
1
2.72189 · 1
0
-
8
1
0
2.71475 · 1
0
-
8
-
1
2
3
2
8.1876 · 1
0
-
8
3
2
-
1
2
7.6352 · 1
0
-
8
0
2
9.35247 · 1
0
-
8
2
0
8.87656 · 1
0
-
8
12
-
1
2
1
2
1.03683 · 1
0
-
14
1
2
-
1
2
1.03251 · 1
0
-
14
0
1
2.56597 · 1
0
-
14
1
0
2.56661 · 1
0
-
14
-
1
2
3
2
9.67494 · 1
0
-
14
3
2
-
1
2
9.25758 · 1
0
-
14
0
2
1.43156 · 1
0
-
13
2
0
1.37795 · 1
0
-
13
16
-
1
2
1
2
3.15286 · 1
0
-
16
1
2
-
1
2
3.1637 · 1
0
-
16
0
1
2.57166 · 1
0
-
16
1
0
2.83627 · 1
0
-
16
-
1
2
3
2
2.4723 · 1
0
-
16
3
2
-
1
2
3.38054 · 1
0
-
16
0
2
5.22802 · 1
0
-
16
2
0
3.47378 · 1
0
-
16Table 2
Comparison between the best errors of different methods.
Error
JGM
Method in [19]
Method in [20]
Method in [21]
E
2.4723 · 1
0
-
16
1.00 · 1
0
-
4
1.70 · 1
0
-
7
2.370 · 1
0
-
9


## 7. Conclusions

This paper is concerned with introducing four new analytical formulae for theqth-derivative of certain parameters Jacobi polynomials in terms of their corresponding Jacobi polynomials. Moreover, some new reduction formulae for summing some terminating hypergeometric functions of unit argument are deduced. As an application, and with the aid of the new introduced derivatives formulae, some spectral solutions of a special sixth-order boundary value problem are presented. To the best of our knowledge, all the presented theoretical formulae in this paper are completely new. Moreover, we do believe that these new introduced formulae can be applied for solving other kinds of high-order boundary value problems.



---

*Source: 456501-2014-10-14.xml*