• 검색 결과가 없습니다.

GENERALIZATION OF LAGUERRE MATRIX POLYNOMIALS FOR TWO VARIABLES

N/A
N/A
Protected

Academic year: 2021

Share "GENERALIZATION OF LAGUERRE MATRIX POLYNOMIALS FOR TWO VARIABLES"

Copied!
11
0
0

로드 중.... (전체 텍스트 보기)

전체 글

(1)

https://doi.org/10.5831/HMJ.2021.43.1.141

GENERALIZATION OF LAGUERRE MATRIX POLYNOMIALS FOR TWO VARIABLES

Asad Ali and Muhammad Zafar Iqbal

Abstract. The main object of the present paper is to introduce the gen-eralized Laguerre matrix polynomials for two variables. We prove that these matrix polynomials are characterized by the generalized hypergeo-metric matrix function. An explicit representation, generating functions and some recurrence relations are obtained here. Moreover, these matrix polynomials appear as solution of a differential equation.

1. Introduction and preliminaries

Orthogonal matrix polynomials comprise an emerging fields of study, with important results in both Lie group theory and number theory its applications being still is contained to appear in the literature. Theory of classical orthogo-nal polynomials are extended to the orthogoorthogo-nal matrix polynomials ([9]). The study of functions of matrices is a very popular topic in the Matrix Analysis literature. Matrix generalization of special functions has become important in the last two decades. The reason of importance have many motivations. For instance, using special matrix functions provides solutions for some phys-ical problems. Also, special matrix functions are in connection with different matrix functions ([4], [8], [14]). Jodar et al introduced Laguerre matrix poly-nomials in ([11]). Some important properties of Laguerre matrix polypoly-nomials such as asymptotic expressions relations between different matrix functions and generating matrix functions are studied ( [8], [9], [11]). Indeed, in recent pa-pers, matrix polynomials have significant emergent. Some results in the theory of classical orthogonal polynomials have been extended to orthogonal matrix polynomials ( [1], [2], [4], [5], [7], [11], [13]) Throughout this paper, for a ma-trix A in Cr×r, its spectrum σ(A) denotes the set of all eigenvalues of A. The

Received November 4, 2020. Accepted February 9, 2021. 2020 Mathematics Subject Classification. 33C45, 42C05.

Key words and phrases. Laguerre matrix polynomials, generating functions, recurrence relations.

(2)

two-norm will be denoted by||A||2 and it is defined by ([10])

||A||2= sup x̸=0

||Ax||2

||x||2

where for a vector x in Cr×r,||x||2= (xTx)12 is the Euclidean norm of x. Let us denote the real numbers M (A) and m(A) as in the following

(1) M (A) = max{Re(z) : z ∈ σ(A)} ; m(A) = min {Re(z) : z ∈ σ(A)} .

If f (z) and g(z) are holomorphic functions of the complex variable z, which are defined in an open set of the complex plane, and A, B are matrices in Cr×r, with σ(A)⊂ Ω and σ(B) ⊂ Ω, such that AB = BA, then from the properties of the matrix functional calculus in ([6]) , it follows that

(2) f (A)g(B) = g(B)f (A).

Throughout this study, a matrix polynomial of degree n in x means an expres-sion of the form n

(3) Pn(x) = Anxn+ An−1xn−1+ ... + A1x1+ A0.

where x is a real variable or complex variable, Aj, for 0≤ j ≤ n and An ̸= 0, where 0 is the null matrix or zero matrix in Cr×r. We recall reciprocal gamma function denoted by Γ−1(z) = Γ(z)1 is an entire function of the complex variable

z. Then, for any matrix A in Cr×r, the image of Γ−1(A) acting on A, denoted by Γ−1(A) is a well defined matrix. Furthermore, if A is a matrix such that (4) A + nI is invertible f or every integer n≥ 0,

where I is the identity matrix in Cr×r, then from ([11]) it follows that (5) (A)n= A(A + I)...(A + (n− 1)I) = Γ(A + nI)Γ−1(A); n≥ 1; (A)0= 1. If A is a positive stable matrix in Cr×r, then the gamma matrix function, Γ(A), is defined ([12]) by

(6) Γ(A) =

0

e−ttA−1dt, Re(A) > 0.

And if A, B is a positive stable matrices in Cr×r, then the beta matrix function,

β(A, B), are defined ([12]) by

(7) β(A, B) =

∫ 1 o

tA−1(1− t)B−1dt, Re(A) >, Re(B) > 0.

The generalized hypergeometric matrix function pFq (p, q∈ N) given in ([13])

(8) pFq [A 1, . . . , Ap; B1, . . . , Bq; x ] = n=0 (A1)n· · · (Ap)n (B1)n· · · (Bq)n xn n! =pFq(A1, . . . , Ap; B1, . . . , Bq; x).

(3)

Where Ai and Bj are matrices in Cr×r such that Bj; 1 ≤ j ≤ q satisfy condition. With p = 1 and q = 0, one gets the following relation by ([13]) (9) 1F0(A;−; x) = (1 − x)−A = n=0 (A)nxn n! ,

In ([12], [14], [15]) if λ is a complex number with Re(λ) > 0 and A is a positive stable matrix inCr×r, with A + nI invertible for every integer n≥ 1, then the

nth Laguerre matrix polynomials L(λ,A)n (x, y) for two variables are defined by the following generating matrix relation:

(10)

n=0

L(λ,A)n (x, y)tn= (1− yt)−I−Ae(−λxt1−yt).

From the above equation we have (11) L(λ,A)n (x, y) = nk=o (I + A)n(−xλ)k(y)n−k (n− k)!(I + A)kk! , λ≥ 0.

The second-order matrix differential equations of the form (12) ( xI d 2 dx2 + ( (1 + A)− λx y ) I d dx + nI y ) L(λ,A)1,n (x, y) = 0.

where n∈ N, and A ∈ Cr×r. AndCr×rdenotes the vector space containing all square matrices with r rows and r columns with entries in the complex number C.

2. Generalized Laguerre Matrix polynomials for two variables We begin by defining generalized Laguerre matrix polynomials L(λ,A)p,n (x, y) for two variables by the following generating function:

(13) 1

(1− yt)I+Aexp ( −λxptp (1− yt)p ) = n=0 L(λ,A)n,p (x, y) tn ( p∈ N; x, y ∈ C, A ∈ Cr×r).

Here and elsewhere, let N, R and C be the sets of positive integers, real num-ber and complex numnum-bers, respectively, and let N0 := N ∪ {0}. Obviously

L(λ,A)n,1 (x, y) = L(λ,A)n (x, y).

Hereafter we explore certain formulas and properties involving the general-ized Laguerre Matrix polynomials in (13). Throughout, let F (p; λ, x, y, t) be the left-handed generating function in (13).

(4)

Explicit representation.

We give an explicit expression of the generalized Laguerre matrix polyno-mials L(λ,A)n,p (x, y) for two variables in the following theorem.

Theorem 2.1. Let x,∈ C, p ∈ N, n ∈ N0 and A is positive stable matrix

in Cr×r. Then (14) L(λ,A)n,p (x, y) = (I + A)n [n/p] k=0 (−λ)k(y)n−pk k! (I + A)pk(n− pk)! xpk (15) = (I + A)n n! [n/p] k=0 (λ)k(−1)(p+1)k(−nI) pk(y)n−pk k! (I + A)pk xpk.

Here and throughout, [m] denotes the greatest integer less than or equal to m∈ R. Or, equivalently, (16) L(λ,A)n,p (x, y) = (I + A)ny n n! pFp     −n p I, −n + 1 p I, . . . , −n − 1 + p p I ; A + I p , A + 2I p , . . . , A + pI p ; (−1)p+1λ ( x y )p     .

Proof. Expanding the exponential in the left-hand side of (13), we find

F (p; λ, x, y, t) = 1 (1− yt)I+A+pk k=0 λk(−1)kxpktpk k! .

Employing the binomial theorem (17) (1− x)−A=1F0(A;−; x) = n=0 (A)nxn n! , (A∈ C r×r; |x| < 1), we obtain the following double series

(18) F (p; λ, x, y, t) = n=0 k=0 (−1)kλk(I + A + pk)nxpkyn k! n! t n+pk.

Recall ([11]) if A(n, k) and B(n, k) are matrices in Cr×r and satisfying the spectral condition (4) for n≥ 0, k ≥ 0, then it follows that

(19) n=0 k=0 A(n, k) = n=0 nk=0 A(n, n− k), (20) n=0 k=0 A(n, k) = n=0 [n p] ∑ k=0 A(n, n− pk), (p ∈ N),

(5)

(21) n=0 [n p] ∑ k=0 A(n, k) = n=0 k=0 A(n, n + pk), (p∈ N),

where Ax,y denotes a function of two variables x and y and the involved double series is assumed to be absolutely convergent.

Applying (20) in (18), we get (22) F (p; λ, x, y, t) = n=0 [n/p] k=0 (−1)kλk(I + A + pk) n−pkxpkyn−pk k! (n− pk)! t n.

Equating the coefficients of tn in the right members of (13) and (22) yields (23) L(λ,A)n,p (x, y) = [n/p] k=0 (−1)kλk(I + A + pk) n−pk k! (n− pk)! x pkyn−pk.

Using ([12]) a known identity

(24) 1 (n− k)!I = (−1)k(−nI) k n! (k, n∈ N0; 0≤ k ≤ n) , we derive (25) (I+A+pk)n−pk= (I + A)n (I + A)pk and 1 (n− pk)!I = (−1)pk(−nI) pk n! ; 0≤ pk ≤ n.

Hence, using (25) in (23) leads to the desired identity (15). Finally, applying the multiplication formula

(−1)pk(−nI)pk n! = (−1)pk(p)pk n! pj=1 ( j− n − 1 p I ) n ; 0≤ pk ≤ n. (26) ( p∈ N; n ∈ N0) to (15) gives the equivalent expression (16).

Generating function.

We establish two generating functions for the generalized Laguerre matrix polynomials L(λ,A)n,p (x, y) for two variables in the following theorem.

Theorem 2.2. Let λ, t, x, y c∈ C, p ∈ N and A is positive stable matrix

in Cr×r and satisfying the spectral condition (4). Then

(27) eyt0Fp ( ; A + I p , A + 2I p , . . . , A + pI p ;−λ ( xzt p )p) = n=0 L(λ,A)n,p (x, y) tn (I + A)n

(6)

and (28) 1 (1− yt)c pFp ( c p, c+1 p , . . . , c+p−1 p ; A+I p , A+2I p , . . . , A+pI p ; − λ ( xt 1− yt )p) = n=0 (c)nL (λ,A) n,p (x, y) tn (I + A)n (|t| < 1).

Proof. Using (14), (21), and (26), we have

(29) n=0 L(λ,A)n,p (xz, y) tn (I + A)n = n=0 (yt)n n! k=0 (−λxpzptp)k k! (I + A)pk = eyt k=0 (−λ)k k! pj=1 ( A+jI p ) k ( xzt p )pk .

In view of (8), the rightmost term of (29) can be expressed as the left-hand side of (27). Employing (14), (17), and (21), we find n=0 (c)nL (λ,A) n,p (x, y) tn (I + A)n = k=0 n=0 (c + pk)n(yt)n n! · (c)pk{−λ(xt)p} k k! (I + A)pk = 1 (1− yt)c k=0 (c)pk k! (I + A)pk { −λ ( xt 1− yt )p}k ,

which, upon using (26) and (8), leads to the left-hand member of (28).

It is noted that the case c = I + A of (28) yields the generating function (13).

Recurrence relation.

We give some recurrence relations involving the generalized Laguerre matrix polynomials L(λ,A)n,p (x, y) for two variables and their derivative in the following theorem.

Theorem 2.3. Let λ, t, x, c∈ C, p ∈ N and A is positive stable matrix in Cr×r and satisfying the spectral condition (4). Also let D = d

dx. Then (30) x λDL(λ,A)n,p (x, y)− n L (λ,A) n,p (x, y) + y(A + (n + 1)I) L (λ,A) n−1,p(x, y) = 0; (31) DL(λ,A)n,p (x, y) = { 0 (0≤ n ≤ p − 1) −p λxp−1L(λ,A+p) n−p,p (x, y) (n≥ p);

(7)

(32)

y(A + (n + 1)I) L(λ,A)n−1,p(x, y)− n L(λ,A)n,p (x, y) = p λ2xpL (λ,A+p)

n−p,p (x, y) (n≥ p).

Proof. From (29), we can set

(33) G(p; λ, x, y, t) := n=0 L(λ,A)n,p (x) tn (I + A)n = eytΦ ( −λxptp pp ) ,

where the function Φ ( −λ xptp pp ) = k=0 (−λ)k k! pj=1 ( A+jI p ) k ( xt p )pk .

Differentiating G(p; λ, x, y, t) with respect to x and t, respectively, gives

Gx(p; λ, x, y, t) = eytΦ ( −λ xptp pp ) · −λ pp−1x p−1tp and Gt(p; λ, x, y, t) = yeytΦ ( −λ xptp pp ) + eytΦ ( −λ xptp pp ) · −λ pp−1x ptp−1.

Combining Gx(p; λ, x, y, t) and Gt(p; λ, x, y, t) yields

(34) λx Gx(p; λ, x, y, t)− t Gt(p; λ, x, y, t) + yt G(p; λ, x, y, t) = 0. Applying the series in (33) to (34), we obtain

(35) n=1 λx DL(λ,A)n,p (x, y) tn (I + A)n n=1 n L(λ,A)n,p (x, y) tn (I + A)n + y n=1 L(λ,A)n−1,p(x, y) tn (I + A)n−1 = 0. We find from (35) that each coefficient of tn should be zero, which gives (30).

Differentiating both sides of (13) provides

n=1

DL(λ,A)n,p (x, y) tn=

1

(1− yt)I+A+pexp ( −λxptp (1− yt)p ) ·(−λp xp−1tp) =−pλ xp−1 n=0 L(λ,A+p)n,p (x, y) tn+p =−pλ xp−1 n=p L(λ,A+p)n−p,p (x) tn,

which, upon equating the coefficients of tn(n≥ p) in the leftmost and rightmost members, produces (31).

(8)

Differential equation.

We provide a differential equation which is satisfied by the generalized La-guerre polynomials L(λ,A)n,p (x, y) for two variables in the following theorem (for differential equation whose solution is pFq, see, e.g., [15, Section 47]).

Theorem 2.4. Let λ, t, x, c∈ C, p ∈ N and A is positive stable matrix in

Cr×r and satisfying the spectral condition (4). Also let θ = xd

dx. Then  1 pj=0 ( 1 p(θI− I + A + jI) ) +λ(−1)p−1 ( x y )pp j=0 1 p(θ + j− n − 1)I L(λ,A) p,n (x, y) = 0. (36)

Proof. We find from (15) that

ϕ = (I + A)n(y) n n! pFp ( −n p I, −n + 1 p I... −n + p − 1 p I; I + A p , 2I + A p ... pI + A p ; λ(−1) p−1 ( x y )p) . =(I + A)n n! [n p] ∑ k=o pj=1 ( j−n−1 p I ) k(−1) (p−1)kλkxpk(y)n−pk pj=1 ( jI+A p ) k k! ,

Since 1pθxpk= kxpk, it follows that  1 pj=0 I p(θ− 1 + A + j) = (I + A)n n! [n p] ∑ k=o pj=1 ( jn−1 p I ) k ( j+A+k−1 p I ) (−1)(p−1)kλkxpk(y)n−pk pi=1 ( jI+A p ) k (k− 1)! ,

But the last factor in ( jI+A p ) k is ( jI+A+k−1 p ) so that =(I + A)n n! [n p] ∑ k=o pj=1 ( j−n−1 p I ) k (−1)(p−1)kλkxpk(y)n−pk pj=1 ( jI+A p ) k−1(k− 1)! ,

Now we replace k by (k+1) and have  1 pj=0 1 p(θ− 1 + A + j) I = (I + A)n n! [n p] ∑ k=o pj=1 ( j−n−1 p I ) k+1 (−1)(p−1)(k+1)λk+1xp(k+1)(y)n−p(k+1) pj=1 ( jI+A p ) kk! ,

(9)

= λ(−1)p−I ( x y )p (I + A)n n! [n p] ∑ k=o pj=1 ( j−n−1 p I ) k pj=1 ( k+j−n−1 p I ) (−1)(p−1)kλkxpk(y)n−pk pj=1 ( jI+A p ) kk! , = λ(−1)p−1 ( x y )p ∏p j=0 1 p(θ + j− n − 1)I ϕ.

Some other properties.

We provide some other identities involving the generalized Laguerre poly-nomials L(λ,A)n,p (x, y) for two variables in the following theorem.

Theorem 2.5. Let λ, t, x, y c ∈ C, p, n ∈ N and A, B is positive stable

matrix inCr×r and satisfying the spectral condition (4). Then

(37) L(λ,A)n,p (x, y) = nk=0 (A− B)kL (λ,B) n−k,p(x, y) k! ; (38) L(λ,A+B+I)n,p (z, y) = nk=0 L(λ,A)k,p (x, y) L(λ,B)n−k,p(z, y),

where xp+ zp ∈ C \ {0} and w := (xp+ zp)1p whose principal branch can be

chosen; (39) L(λ,A)n,p (xz, y) = nk=0 (I + A)n(1− z)n−kzkL (λ,A) k,p (x, y) (n− k)! (I + A)k .

Proof. From (13), we have

n=0

L(λ,A)n,p (x, y) tn= (1− yt)−I−Aexp (

−λxptp (1− yt)p

)

= (1− t)−(A−B)· (1 − yt)−I−Bexp ( −λxptp (1− yt)p ) = n=0 k=0 (A− B)k k! L (λ,B) n,p (x, y)tn+k = n=0 nk=0 (A− B)k k! L (λ,B) n−k,p(x, y)t n,

(10)

We find from (13) that n=0 nk=0 L(λ,A)k,p (x, y) L(λ,B)n−k,p(z, y) tn

= (1− yt)−I−Aexp ( −λxptp (1− yt)p ) (1− t)−I−Bexp ( −λzptp (1− yt)p )

= (1− yt)−I−(A+B+I) exp ( −λwptp (1− yt)p ) = n=0 L(A+B+I)n,p (w, y) tn,

which, upon equating the coefficients of tn, gives (38). We consider eyt0Fp ( ; A + I p , A + 2I p , . . . , A + pI p ;−λ ( xzt p )p) = e(1−z)yteyzt0Fp ( ; A + I p , A + 2I p , . . . , A + pI p ;−λ ( x(zt) p )p) ,

which, in view of (27), produces n=0 L(λ,A)n,p (xz, y) tn (I + A)n = ( n=0 (1− zt)nyntn n! ) (k=0 L(λ,A)k,p (x, y) zktk (I + A)k ) .

Then, from the last equality, we obtain (39).

3. Conclusion remarks

The generalized Laguerre matrix polynomials for two variables are intro-duced here and their properties and formulas presented are hoped to be poten-tially useful. Since L(λ,A)n,1 (x, y) = L(λ,A)n (x, y), the results in Section 2 reduce to yield certain properties and formulas for the classical Laguerre matrix poly-nomials L(λ,A)n (x, y) for two variables.

References

[1] H. Abd-Elmageed, M. Abdalla, M. Abul-Ez and N. Saad. Some results on the first

Appell matrix function, Linear and Multilinear Algebra. 68(2) (2020), 278-292.

[2] A. Ali, M. Z. Iqbal, B. Anwar and A. Mehmood. Generalization of Bateman polynomial, Int. J. of Anal. and Appl. 17(5) (2019), 803-808.

[3] A. Ali, M. Z. Iqbal, T. Iqbal and M. Haider. Study of Generalized k-hypergeometric

Function, Int. J. of Math. and Comp. Sci. 16(1) (2021), 379-388.

[4] R. S. Batahan. A new extension of Hermite matrix polynomials and its applications, Linear Algebra and its Application. 419 (2006), 82–92.

(11)

[5] A. Shehata. Connections between Legendre with Hermite and Laguerre matrix

polyno-mials, Gazi Uni. J. of Sci. 28(2) (2015), 221-230.

[6] A. Shehata. Some relations on Laguerre matrix polynomials Malaysian J. of Math. Sci. 9(3) (2015), 443-462.

[7] A. Shehata. On modified Laguerre matrix polynomials, J. of Natural Sci. and Math. 8(2) (2015), 153-166.

[8] A. Shehata. Lie algebra and Laguerre matrix polynomials of one variable, Gen. Lett. in Math. 4(1) (2018), 1-5.

[9] A. J. Duran and F. A. Grnbaum. A survey on orthogonal matrix polynomials satisfying

second order differential equations, J. of Comp. and Appl. Math. 178(1-2) (2005),

169-190.

[10] G.Golub and C. F. Van Loan. Matrix Computations, The Johns Hopkins University Press, Baltimore (1989).

[11] L. Jodar, R. Company and Navarro E. Navarro. Laguerre matrix polynomials and

sys-tems of second order differential equations, App. Numer. Math. 15(1) (1994), 53-63.

[12] G. Dattoli, and A. Torre. Operational methods and two variable laguerre polynomials. Atti Rendiconti Acc. Torino. 32 (1998), 1-7.

[13] L. Jodar and J. C. Cortes. On the hypergeometric matrix function, J. of Comp. and App Math. 199 (1-2) (1998), 205-217.

[14] R. S. Batahan and A. A. Bathanya, On generalized Laguerre matrix polynomials, Acta Univ. Sapientiae, Mathematica, 6(2) (2014), 121-134.

[15] K. Subuhi; and N. A. M. Hassan. 2-variable Laguerre matrix polynomials and

Lie-algebraic techniques, J. of Phy. A: Math. and Theo. 43(23) (2010), 235204.

Asad Ali

Department of Mathematics and Statistics,

University of Agriculture Faisalabad 38000, Pakistan E-mail:mrasadali5100@gmail.com

Muhammad Zafar Iqbal

Department of Mathematics and Statistics,

University of Agriculture Faisalabad 38000, Pakistan E-mail:mzts2004@hotmail.com

참조

관련 문서

The matrix A show the cost per computer (in thousands of dollars) and B the production figures for the year 2005 (in multiples of 1000 units).. Find a matrix C that

Effects of phase I periodontal treatment on gingival crevicular fluid levels of matrix metalloproteinase-3 and tissue inhibitor of metalloproteinase-1.

using the fiber and Matrix properties obtained from previous study.(Simulation specimen is same experiment specimen.) Compare the simulation results

 자신의 무지와 몰이해에 대해 자책하거나, 일깨움이 더딘 것을 탓하지 말고 그저 부지런히 행함을 놓치지 않는다..  언제나 자신에게 솔직할 것이며, 나눌 준비와

After re analysis result YCC and XYS is graph are almost similar by applying reconstructed material properties and stress-strain curve of matrix for GENOA..

 A linear system of equations in n unknowns has a unique solution if the coefficient matrix and the augmented matrix have the same rank n, and infinitely many solution if

 So the rank vector r is an eigenvector of the web matrix M, with the corresponding eigenvalue 1.  Fact: The largest eigenvalue of a column stochastic

In this study, Ply can be stacked on Different to predict the strength and stiffness using the fiber and Matrix properties obtained from