• Tidak ada hasil yang ditemukan

Directory UMM :Journals:Journal_of_mathematics:DM:

N/A
N/A
Protected

Academic year: 2017

Membagikan "Directory UMM :Journals:Journal_of_mathematics:DM:"

Copied!
15
0
0

Teks penuh

(1)

Gegenbauer Matrix Polynomials

and Second Order Matrix

Differential Equations

Polinomios Matriciales de Gegenbauer y Ecuaciones

Diferenciales Matriciales de Segundo Orden

K. A. M. Sayyed , M. S. Metwally, R. S. Batahan

Department of Mathematics, Faculty of Science

Assiut University, 71516, Assiut, Egypt.

Abstract

In this paper, we study the Gegenbauer matrix polynomials. An explicit representation, a three-term matrix recurrence relation and or-thogonality property for the Gegenbauer matrix polynomials are given. These polynomials appear as finite series solutions of second-order ma-trix differential equations.

Key words and phrases: hypergeometric matrix function, orthogo-nal matrix polynomials, Gegenbauer matrix polynomials, three-terms matrix recurrence.

Resumen

En este art´ıculo se estudian los polinomios matriciales de Gegen-bauer. Se da una representaci´on expl´ıcita, una relaci´on de recurrencia matricial de tres t´erminos y una propiedad de ortogonalidad para los polinomios matriciales de Gegenbauer. Estos polinomios aparecen como soluciones en series finitas de ecuaciones diferenciales matriciales de se-gundo orden.

Palabras y frases clave:funci´on hipergeom´etrica matricial, polino-mios matriciales ortogonales, polinopolino-mios matriciales de Gegenbauer, re-currencia matricial de tres t´erminos.

(2)

1

Introduction

It is well known that special matrix functions appear in the study in sta-tistics, theoretical physics, groups representation theory and number theory [1, 2, 8, 15, 21]. Orthogonal matrix polynomials have been considered in the book on matrix polynomials by Gohberg, Lancaster and Rodman [7] and in the survey on orthogonal matrix polynomials by Rodman [17] and see more papers [4, 5, 6, 19, 20] and the references therein. During the last two decades the classical orthogonal polynomials have been extended to the orthogonal matrix polynomials see for instance [12, 13] . Hermite and Laguerre matrix polynomials was introduced and studied in [9, 10] and an accurate approxi-mation of certain differential systems in terms of Hermite matrix polynomi-als was computed in [3]. Furthermore, a connection between Laguerre and Hermite matrix polynomials was established in [12]. Recently, the general-ized Hermite matrix polynomials have been introduced and studied in [18]. J´odar and Cort´es introduced and studied the hypergeometric matrix function F(A,B;C;z) and the hypergeometric matrix differential equation in [11] and the the explicit closed form general solution of it has been given in [14].

The primary goal of this paper is to consider a new system of matrix poly-nomials, namely the Gegenbauer matrix polynomials. The structure of this paper is the following. In section 2 a definition of Gegenbauer matrix poly-nomials is given. Some differential recurrence relations, in particular Gegen-bauer’s matrix differential equation are established in section 3. Moreover, hypergeometric matrix representations of these polynomials will be given in section 4. Finally in section 5 we obtain the orthogonality property of Gegen-bauer matrix polynomials.

Throughout this study, consider the complex space CN×N of all square

complex matrices of common order N. We say that a matrix A in CN×N is

a positive stable if Re(λ)>0 for all λ ∈ σ (A) where σ (A) is the set of all eigenvalues of A. IfA0, A1,· · ·, An are elements ofCN×N and An 6= 0, then

we call

P(x) =Anxn+An−1xn−1+. . .+A1x+A0,

a matrix polynomial of degreenin x.

IfP+nIis invertible for every integern≥0, then from [11] it follows that

(P)n =P(P+I)(P+ 2I)...(P+ (n−1)I); n≥1; (P)0=I. (1)

From (1), it is easy to find that

(3)

From the relation (3) of [16, pp. 58], one obtains The hypergeometric matrix function F(A,B;C;z) has been given in the form [11, p. 210]

For any matrix P in CN×N we will exploit the following relation due to

[11, p. 213]

It has been seen by Defez and J´odar [3] that, for matrices A(k,n) and

B(k,n)inCN×N where n

≥0,k0, the following relations are satisfied:

Similarly, we can write

(4)

If A is a positive stable matrix in CN×N, then the nth Hermite matrix

polynomials was defined by [10, pp.14]

Hn(x, A) =n!

[Xn/2]

k=0

(−1)k k!(n−2k)!(x

2A)n−2k;

n≥0. (11)

The expansion of xnI in a series of Hermite matrix polynomials has been given in [3, pp. 14] in the form

xn n!I= (

2A)−n

[Xn/2]

k=0

n!

k!(n−2k)!Hn−2k(x, A); −∞< x <∞. (12)

2

Gegenbauer matrix polynomials

LetAbe a positive stable matrix inCN×N. We define the Gegenbauer matrix polynomials by means of the relation:

F = (1−2xtt2)−A=

X

n=0

CnA(x)tn. (13)

By using (5) and (9), we have

(1−2xtt2)−A=

X

n=0 [Xn/2]

k=0

(−1)k(A) n−k k!(n−2k)! (2x)

n−2ktn. (14)

By equating the coefficients of tn in (13) and (14), we obtain an explicit

representation of the Gegenbauer matrix polynomials in the form:

CnA(x) =

[Xn/2]

k=0

(−1)k(A) n−k k!(n2k)! (2x)

n−2k. (15)

Clearly,CA

n(x) is a matrix polynomial of degreeninx. Replacingxby-xand

tby-tin (13), the left side does not exchange. Therefore

CnA(−x) = (−1)nCnA(x). (16) Forx= 1 we have

(1−t)−2A=

X

n=0

(5)

So that by (5) it follows

CnA(1) =

(2A)n

n! . (17)

Forx= 0 it follows

(1 +t2)−A=

X

n=0

CnA(0)tn.

Also, by (5) one gets

(1 +t2)−A=

X

n=0

(−1)n(A) n n! t

2n.

Therefore, we have

C2An(0) = (−1)

n(A) n n! , C

A

2n+1(0) = 0. (18)

The explicit representation (15) gives

CA n(x) =

2n

(A)n

n! xn+

Q

n−2,

where Qn−2 is a matrix polynomial of degree (n - 2) inx. Consequently, if

D= d

dx, then it follows that

DnCnA(x) = 2n(A)n.

3

Differential recurrence relations

By differentiating (13) with respect toxandtyields respectively

∂F ∂x =

t

1−2xtt22AF. (19)

and

∂F ∂t =

(xt)

1−2xt−t22AF. (20)

So that the matrix function F satisfies the partial matrix differential equation:

(x−t)∂F

∂x −t ∂F

(6)

Therefore by (13) we get

X

n=0

xDCnA(x)tn−

X

n=0

nCnA(x)tn=

X

n=1

DCnA−1(x)tn,

where D=dxd. SinceDCA

0(x) = 0 and forn≥1, then we obtain the differential recurrence

relation:

xDCnA(x)−nCnA(x) =DCnA−1(x). (21)

From (19) and (20) with the aid of (13) we get respectively the following

1

1−2xt−t22A(1−2xt−t 2)−A=

X

n=1

DCnA(x)tn−1, (22)

and

x−t

1−2xt−t22A(1−2xt−t 2)−A=

X

n=1

nCnA(x)tn−1. (23)

Note that 1−t22t(xt) = 12xtt2. Thus by multiplying (22) by (1t2)

and (23) by 2t and subtracting (23) from (22) we obtain

2(A+nI)CnA(x) =DCnA+1(x)−DCnA−1(x). (24)

From (21) and (24), one gets

xDCnA(x) =DCnA+1(x)−(2A+nI)CnA(x). (25) Substituting (n1) for n in (25) and putting the resulting expression for

DCA

n−1(x) into (21), gives

(x21)DCnA(x) =nxCnA(x)−(2A+ (n1)I)CnA1(x). (26) Now, by multiplying (21) by (x2−1) and substituting for (x2−1)DCnA(x)

and (x2−1)DCnA−1(x) from (26) to obtain the three terms recurrence relation

in the form

nCnA(x) = (2A+ 2(n−1)I)xCnA−1(x)−(2A+ (n−2)I)CnA−2(x). (27)

Write (22) in the form:

2A(1−2xtt2)−(A+I)=

X

n=0

(7)

By applying (13) it follows

2A(1−2xtt2)−(A+I)=

X

n=0

2ACnA+I(x)tn. (29)

Identification of the coefficients oftn in (28) and (29) yields

DCnA+1(x) = 2ACnA+I(x),

which gives

DCnA(x) = 2ACnA−+1I(x). (30)

Iteration (30) yields, for 0≤r≤n,

DrCnA(x) = 2r(A)rCnA−+rrI(x). (31)

The first few Gegenbauer matrix polynomials are listed here,

C0A(x) =I, C1A(x) = 2Ax,

C2A(x) = 2(A)2x2−A,

C3A(x) =4 3(A)3x

3

−2(A)2x,

and

C4A(x) =

2 3(A)4x

4

−2(A)3x2+

1 2(A)2.

We conclude this section introducing the Gegenbauer’s matrix differential equation as follows:

In (25), replacenby (n1) and differentiate with respect toxto find

xD2CnA−1(x) =D2CnA(x)−(2A+nI)DCnA−1(x). (32)

Also, by differentiating (21) with respect toxwe have

xD2CnA−1(x)−(n−1)DCnA(x) =D2CnA−1(x). (33)

From (21) and (33) by putting DCA

n−1(x) and D2CnA−1(x) into (32) and

re-arrangement terms we obtain the Gegenbauer’s matrix differential equation in the form:

(8)

4

Hypergeometric matrix representations of

C

A

Therefore, by using and (5) and (36) we have

which by inserting (35) and applying (7) with the help of (3) yields

Thus, the hypergeometric matrix representation follows by equating the coef-ficients of tn in the form

CnA(x) =

On applying (16), one gets

(9)

It is evident that

1

(n2k)!I=

(−nI)2k

n! ; 0≤2k≤n. By using (2) and taking into account that

(−nI)2k = 2−2k(− n

2 I)k(

−(n−1) 2 I)k,

the explicit representation (15) becomes

CnA(x) = (2x)

which gives another hypergeometric matrix representation in the form:

CnA(x) = (2x)

Now, we can write

(1−2xt−t2)−A= [1

Therefore, by using (5) and (6) we find that

By identification of the coefficients of tn, another form for the Gegenbauer

(10)

Moreover, by exploiting (40) and using (8) in the sum

X

n=0

[(A)n]−1CnA(x)tn =

X

n=0

xntn n!

X

k=0

1

k![(A+ 1 2I)k]

−1(1

4t

2(x2

−1))k.

By identification of the coefficients oftn, we obtain a generating relation for the Gegenbauer matrix polynomials in the form:

exp(xt)0F1(−;A+

1 2I;

1 4t

2(x2

−1)) =

X

n=0

[(A)n]−1CnA(x)tn. (41)

5

Orthogonality of Gegenbauer matrix polynomials

Here, we will obtain the most interesting property of the Gegenbauer matrix polynomials, namely the orthogonality of this system of polynomials. LetA

be a positive stable matrix in CN×N such that

A+kIis invertible for every integerk≥0. (42)

By multiplying (34) by (1−x2)A−1

2I we get

D[(1−x2)A+12IDCnA(x)] +n(1−x2)A−12I(2A+nI)CnA(x) = 0. (43) Similarly, whenCmA(x) satisfies (34) it follows

D[(1−x2)A+12IDCmA(x)] +m(1−x2)A−12I(2A+mI)CmA(x) = 0. (44) By multiplying the equation (43) byCmA(x) and the equation (44) byCnA(x)

and subtracting gives

D[(1−x2)A+1

2IDCnA(x)]CmA(x)−D[(1−x2)A+12IDCmA(x)]CnA(x) +

n(1−x2)A−1

2I(2A+nI)CnA(x)CmA(x)−

m(1−x2)A−1

2I(2A+mI)CmA(x)CnA(x) = 0. (45)

Since the multiplication of the matrix in (A)nis commutative for every integer n0, thenCA

n(x)CmA(x) =CmA(x)CnA(x). We can write

D[(1−x2)A+12I{CmA(x)DCnA(x)−DCmA(x)CnA(x)}]

(11)

(1−x2)A+12IDCmA(x)DCnA(x) +D[(1−x2)A+12IDCmA(x)]CnA(x). Thus, the equation (45) becomes

(n−m){A+ (n+m)I}(1−x2)A−1

2ICnA(x)CmA(x) =

D[(1−x2)A+21I{CmA(x)DCnA(x)−DCmA(x)CnA(x)}].

Actually,mandnare non-negative integer andAis a positive stable matrix, henceA+ (m+n)I6= 0. Therefore, it follows

Z 1

−1

(1−x2)A−1 2ICA

n(x)CmA(x)dx= 0; m6=n. (46)

That is, for A is a positive stable matrix in CN×N , the Gegenbauer matrix

polynomials form an orthogonal set over the interval (-1,1) with respect to the weight function (1−x2)A−1

2I. One immediate consequence of (46) is

Z 1

−1

(1−x2)A−1

2ICmA(x)dx= 0; m6= 0.

Now, by multiplying (27) by (1−x2)A−1

2ICnA(x)dxand integrating between -1 and 1 and taking into account (46) we get

Z 1

−1

(1−x2)A−1

2I[CnA(x)]2dx= (47)

2

n(A+ (n−1)I)

Z 1

−1

x(1−x2)A−1 2ICA

n(x)CnA−1(x)dx.

Again, by replacingnbyn1 in (27) and multiply by (1−x2)A−1

2ICnA1(x)dx and integrating between -1 and 1 and taking into account (46) to obtain

2(A+nI) Z 1

−1

x(1−x2)A−1

2ICnA1(x)CnA(x)dx= (48)

(2A+ (n−1)I) Z 1

−1

(1−x2)A−1

2I[CnA1(x)]2dx.

Thus, from (47) and (48) we get Z 1

−1

(1−x2)A−1 2I[CA

n(x)]2dx=

1

n(A+nI)

−1(A+ (n

(12)

(2A+ (n−1)I)

Note that, forAis a positive stable matrix inCN×N satisfies (42) it follows Z 1

which can be be written with 46 in the form Z 1

where δmn is Kronecker’s delta symbol.

Finally, we will expand the Gegenbauer matrix polynomials in series of Hermite matrix polynomials. By employing (15), (8) and (12) and taking into account that each matrix commutes with itself, one gets

which on applying (8) becomes

(13)

By using (7) one gets

X

n=0

2−n(2

A)nCnA(x)tn=

X

n=0

X

k=0

k

X

s=0

(−1)k−s(A) n+k+s

s!(k−s)!n! Hn(x, A)t

n+2k .

Since (A)n+k+s= (A+ (n+k)I)s(A)n+k, then by using (3) it follows

X

n=0

2−n(2A)nCA n(x)tn=

X

n=0

X

k=0

(−1)k k!n!

2F0(−kI, A+ (n+k)I;−; 1)(A)n+kHn(x, A)tn+2k.

By (6) and then equating the coefficients oftn we obtain an expansion of the

Gegenbauer matrix polynomials as series of Hermite matrix polynomials in the form:

CnA(x) = 2n(

2A)−n

[Xn/2]

k=0

(−1)k

k!(n−2k)!2F0(−kI, A+ (n−k)I;−; 1)

(A)n−kHn−2k(x, A). (51)

References

[1] A. G. Constantine,Some non-central distribution problem in multivariate analysis, Ann. Math. Statis.,34(1963), 1270–1285.

[2] A. G. Constantine, R. J. Muirhead,Parial differential equations for hy-pergeometric functions of two argument matrix, J. Multivariate Anal.3

(1972), 332–338.

[3] E. Defez, L. J´odar,Some applications of the Hermite matrix polynomials series expansions, J. Comp. Appl. Math.99(1998), 105–117.

[4] A. J. Dur´an, W. Van Assche,Orthogonal matrix polynomials and higher order recurrence relations, Linear Algebra and its Applications219, 261–

280.

[5] A. J. Dur´an,Markov’s Theorem for orthogonal matrix polynomials, Can. J. Math.48 (1996), 1180–1195.

(14)

[7] I. Gohberg, P. Lancaster, L. Rodman, Matrix Polynomials, Academic Press, New York, 1982.

[8] A. T. James, Special functions of matrix and single argument in statis-tics, in Theory and applications of Special Functions, Ed. R. A. Askey, Academic Press, 1975, 497–520.

[9] L. J´odar, R. Company, E. Navarro,Laguerre matrix polynomials and sys-tem of second-order differential equations, Appl. Num. Math.15(1994),

53–63.

[10] L. J´odar, R. Company, Hermite matrix polynomials and second order matrix differential equations, J. Approx. Theory Appl.12(2) (1996), 20–

30.

[11] L. J´odar, J. C. Cort´es,On the hypergeometric matrix function, J. Comp. Appl. Math.99(1998), 205–217.

[12] L. J´odar, E. Defez,A connection between Laguerre’s and Hermite’s ma-trix polynomials, Appl. Math. Lett. 11(1) (1998), 13–17.

[13] L. J´odar, J. Sastre, The growth of Laguerre matrix polynomials on bounded intervals, Appl. Math. Lett.13(2000), 21–26.

[14] L. J´odar and J. C. Cort´es, Closed form general solution of the hyperge-ometric matrix differential equation, Mathematical and Computer Mod-elling.32(2000), 1017–1028.

[15] R. J. Muirhead,Systems of partial differential equations for hypergeomet-ric functions of matrix argument, Ann. Math. Statist. 41 (1970), 991–

1001.

[16] E. D. Rainville,Special Functions, The Macmillan Company, New York, 1960.

[17] L. Rodman,Orthogonal matrix polynomials, in Orthogonal Polynomials: Theory and Practice, P. Nevai, ed., vol. 294 of NATO ASI Series C, Kluwer, Dordrecht, 1990, 345–362.

[18] K. A. M. Sayyed, R. S. Batahan,On generalized Hermite matrix polyno-mials, accepted in Electronic Journal of Linear Algebra.

(15)

[20] A. Sinap, W. Van Assche, Orthogonal matrix polynomials and applica-tions, J. Comp. Appl. Math.66 (1996), 27–52.

Referensi

Dokumen terkait

Key words and phrases: Quillen model category, Brown representability, triangulated category, ac- cessible category.. Jiˇr´ı Rosick´

Key words and phrases: separable morphism, strongly separable morphism, separated morphism, compact morphism, covering morphism, factorization system, effective descent morphism,

Key words and phrases : Centro-affine geometry, method of moving frames, rep` ere mobile, curves,

Key words and phrases: Rademacher sums, tail estimation, exchangeable system of random variables, maximal inequality1. The

Key words and phrases: Linear system, transfer function, frequency re- sponse, operational calculus, behavior, AR-model, state model, controllabil- ity,

Key words and phrases: Circular truncation error, derivative sampling, entire function spaces [ ρ, ψ ] , [ ρ, ψ ), sampling truncation error upper bound, Weierstraß σ

Key words and phrases: Degenerate multidimensional distributions, bounds for characteristic functions, multidimensional analogue of Vinogradov’s in- equality, convergence of the

Keywords: Gegenbauer polynomials; Nondiagonal Sobolev inner product; Sobolev orthogonal polynomials1. All