ArticlePDF Available

Abstract

Conventional Hermite polynomials emerge in a great diversity of applications in mathematical physics, engineering, and related fields. However, in physical systems with higher degrees of freedom it will be of practical interest to extend the scalar Hermite functions to their matrix analogue. This work introduces various new generating functions for Hermite matrix polynomials and examines existence and convergence of their associated series expansion by using Mehler’s formula for the general matrix case. Moreover, we derive interesting new relations for even- and odd-power summation in the generating-function expansion containing Hermite matrix polynomials. Some new results for the scalar case are also presented.
A NEW TYPE OF HERMITE MATRIX POLYNOMIAL SERIES
EMILIO DEFEZAND MICHAEL M. TUNG[
Abstract. Conventional Hermite polynomials emerge in a great diversity of
applications in mathematical physics, engineering, and related fields. However,
in physical systems with higher degrees of freedom it will be of practical interest
to extend the scalar Hermite functions to their matrix analogue. This work
introduces various new generating functions for Hermite matrix polynomials
and examines existence and convergence of their associated series expansion
by using Mehler’s formula for the general matrix case. Moreover, we derive
interesting new relations for even- and odd-power summation in the generating-
function expansion containing Hermite matrix polynomials. Some new results
for the scalar case are also presented.
1. Introduction
During the last decade, orthogonal matrix polynomials have become increas-
ingly important for numerical computation and its analysis. In particular, Hermite
matrix polynomials were introduced and studied for the first time in [8, 10] and
subsequently received considerable attention for its application in the solutions of
matrix differential equations [2–5,12,13]. In the scalar case, Hermite polynomials
emerge in the context of quantum mechanics and optics, mathematical and nuclear
physics among other areas of highly practical interest. Only recently, a new kind of
series expansion involving conventional Hermite polynomials was introduced in [7]
in order to describe new field states in quantum optics—yet without any rigorous
proof of existence and convergence in general.
In this article, we present an entirely new class of series expansion for Hermite
matrix polynomials, which also includes the scalar polynomial expansion of [7] as
a particular case. Besides, we will provide an accurate analysis of convergence.
To start with, in Section 2, we define the new Hermite matrix polynomial series.
Section 3 illustrates the reduction to the scalar case, given in [7]. Throughout
this work, we denote by Cr×rthe set of all the complex square matrices of size r.
Furthermore, by Θ and Iwe denote the zero and the identity matrix, respectively.
If f(z), g(z) are holomorphic functions on an open set Ω C, and if the eigenvalues
σ(A)Ω, then f(A), g(A) represent the images of functions fand gacting on the
matrix Asuch that f(A)g(A) = g(A)f(A), see [6, p.558]. If Re(z)>0 for every
eigenvalue zσ(A), we say that matrix Ais positive stable, In this case, we use
A=A1/2= exp (log (A)/2) for the image of the function z1/2= exp (log (z)/2)
2000 Mathematics Subject Classification. 33C45, 33C47, 15A16.
Key words and phrases. Hermite matrix polynomials, Hermite polynomials, generating
functions.
The authors thank the Spanish Ministerio de Econom´ıa y Competitividad and the European
Regional Development Fund (ERDF) for financial support under grant TIN2014-59294-P.
1
2 EMILIO DEFEZAND MICHAEL M. TUNG[
acting on the matrix A. Note that log (z) as usual denotes the principal branch of
the complex logarithm.
A matrix polynomial of degree nis an expression of the form Pn(t) = Antn+
An1tn1+··· +A1t+A0, where tis a real variable and AjCr×rfor 0 jn.
The usual 2-norm of a quadratic matrix Ais denoted by kAk2.
2. The new Hermite matrix polynomial series
For any positive stable matrix ACr×r, the associated Hermite matrix polyno-
mials [8] are defined by the following three-term recurrence for any non-zero positive
integer mN:
H1(x, A)=Θ, H0(x, A) = I, Hm(x, A) = x2AHm1(x, A)2(m1)Hm2(x, A).
(2.1)
This definition fulfills for any nN0(positive integers including zero) the relations
H2n+1(0, A)=Θ, H2n(0, A)=(1)n(2n)!
n!I. (2.2)
For the following derivations we need to use two well-known results. The first result
was demonstrated in [1] and establishes the following upper bound:
kH2n(x, A)k2gn(x),kH2n+1(x, A)k2≤ |x|
A
21/2
2
2gn(x)
n+ 1 ,
gn(x)=22n(2n+ 1)!
n!exp 5
2kAk2x2, n N0.
(2.3)
The second result was demonstrated in [9] and is Mehler’s formula in the matrix
case:
X
n0
Hn(x, A)Hn(y, A)
2nn!tn= (1t2)1
2exp 2xyt (x2+y2)t2
2(1 t2)A, x, y R,|t|<1.
(2.4)
Now we are in the position to prove the following theorem:
Theorem 2.1.Let ACr×rbe a positive stable matrix and xR. Then for
|t|<1/16:
A(s;x, t, A) := X
n0
H2n+s(x, A)
n!tn=
Hsx
1+4t, A
1+4ts+1 exp 2tx2
1+4tA, s N0.
(2.5)
Proof 2.1.First we will prove that the matrix series A(s;x, t, A) is convergent for
any fixed integer sN0. Taking into account (2.3), being s= 2lan even number,
one obtains
H2n+s(x, A)
n!tn
2
=
H2n+2l(x, A)
n!tn
2gn+l(x)|t|n
n!.
Since X
n0
gn+l(x)|t|n
n!is convergent for |t|<1/16, the matrix series A(2l;x, t, A) is
convergent in any compact real interval. On other hand, if s= 2l+ 1 is an odd
A NEW TYPE OF HERMITE MATRIX POLYNOMIAL SERIES 3
number, then
H2n+s(x, A)
n!tn
2
=
H2(n+l)+1(x, A)
n!tn
2≤ |x|
(A/2)1/2
2
2gn+l(x)|t|n
(n+l+ 1)n!.
Since X
n0
|x|
(A/2)1/2
22gn+l(x)|t|n
(n+l+ 1)n!is convergent for |t|<1/16, the matrix
series A(2l+ 1; x, t, A) is convergent in any compact real interval. Thus, the series
A(s;x, t, A) is convergent for all fixed integers sN0, what was to be shown.
For proving formula (2.5), we will use the induction method. We put y= 0
in formula (2.4) and use relations (2.2). Thus, Mehler’s formula (2.4) reduces to
(see [1] for details):
X
n0
(1)nH2n(x, A)
22nn!t2n= (1 t2)1
2exp x2t2
2(1 t2)A, x R,|t|<1/2.(2.6)
Taking u=t2/4, we can rewrite (2.6) in the form
X
n0
H2n(x, A)
n!un= (1 + 4u)1
2exp 2ux2
1+4uA, x R,|u|<1/16.(2.7)
Observe that (2.7) is exactly A(0; x, u, A). Thus, formula (2.5) is true for s= 0.
Next, we proceed to prove that formula (2.5) is also true for s= 1. After using
the three-term recurrence (2.1) for m= 2n+ 1, multiplying each term by tn/n!
with |t|<1/16, and finally applying the sum from n= 1 to infinity, one arrives at
X
n1
H2n+1(x, A)
n!tn=x2AX
n1
H2n(x, A)
n!tn4X
n1
nH2n1(x, A)
n!tn.(2.8)
To start summation at n= 0, we rewrite (2.8) in the form
(1 + 4t)X
n0
H2n+1(x, A)
n!tn=H1(x, A)x2AH0(x, A) + x2AX
n0
H2n(x, A)
n!tn.
(2.9)
Applying (2.1), we conclude that H1(x, A) = x2A, H0(x, A) = I. Now, using
(2.7), we may simplify (2.9) to the form:
A(1; x, t, A) = x2A
1+4t3exp 2tx2
1+4tA=
H1x
1+4t, A
1+4t2exp 2tx2
1+4tA,
(2.10)
and formula (2.5) is also true for s= 1.
Up to this point we only have shown that the inductive statement A(s;x, u, A)
holds for s= 0,1. Next, we proceed with the inductive step, showing that if
A(l;x, u, A) holds for 0 ls1, then A(s;x, u, A) is also true.
Again, we use the recurrence relation (2.1) for m= 2n+sto obtain
H2n+s(x, A) = x2AH2n+s1(x, A)2(s1)H2n+s2(x, A)4nH2n+s2(x, A).
(2.11)
4 EMILIO DEFEZAND MICHAEL M. TUNG[
Multiplying (2.11) by tn/n! with |t|<1/16, and applying the sum from n= 1 to
infinity, we deduce
X
n1
H2n+s(x, A)
n!tn=2AX
n1
H2n+s1(x, A)
n!tn2(s1) X
n1
H2n+s2(x, A)
n!tn
4X
n1
nH2n+s2(x, A)
n!tn.(2.12)
We can rewrite (2.12) in the form
A(s;x, t, A) = Hs(x, A)x2AHs1(x, A)2(s1)Hs2(x, A) (2.13)
+x2AA(s1; x, t, A)2(s1)A(s2; x, t, A)4tA(s;x, t, A).
The first three terms of equation (2.13) reduce to Hs(x, A)x2AHs1(x, A)
2(s1)Hs2(x, A) = Θ by using recurrence (2.1) for m=s. Next, we can simplify
expression (2.13) to
(1 + 4t)A(s;x, u, A) = x2AA(s1; x, u, A)2(s1) A(s2; x, u, A).(2.14)
Using the induction hypothesis, we have
A(s1; x, u, A) =
Hs1x
1+4t, A
1+4tsexp 2tx2
1+4tA
A(s2; x, u, A) =
Hs2x
1+4t, A
1+4ts1exp 2tx2
1+4tA
.(2.15)
Substituting (2.15) in (2.14), one finally arrives at
(1 + 4t)A(s;x, u, A) = x2A
Hs1x
1+4t, A
1+4tsexp 2tx2
1+4tA
2(s1)
Hs2x
1+4t, A
1+4ts1exp 2tx2
1+4tA
=
exp 2tx2
1+4tA
1+4ts1"x2A
1+4tHs1x
1+4t, A2(s1)Hs2x
1+4t, A#
=
Hsx
1+4t, A
1+4ts1exp 2tx2
1+4tA,
which completes this proof.
Remark 2.1.Working with the series A(s;x, t, A) and its new results established
so far, we may continue to derive additional, previously unknown relations and
properties of the Hermite matrix series, altogether absent from the literature on
special functions.
A NEW TYPE OF HERMITE MATRIX POLYNOMIAL SERIES 5
For example, considering the combinations A(s;x, t, A) + A(s;x, t, A) and also
A(s;x, t, A)− A(s;x, t, A), for sN0, x R,|t|<1/16 it immediately follows
that
X
n0
H4n+s(x, A)
(2n)! t2n=
Hsx
1+4t, A
21+4ts+1 exp 2tx2
1+4tA
+
Hsx
14t, A
214ts+1 exp 2tx2
14tA,
X
n0
H4n+s+2(x, A)
(2n+ 1)! t2n+1 =
Hsx
1+4t, A
21+4ts+1 exp 2tx2
1+4tA
Hsx
14t, A
214ts+1 exp 2tx2
14tA.
(2.16)
Considering now the combinations A(s+ 1; x, t, A) + A(s+ 1; x, t, A) and also
A(s+1; x, t, A)−A(s+ 1; x, t, A), for sN0, x R, and |t|<1/16, it immediately
follows that
X
n0
H4n+s+1(x, A)
(2n)! t2n=
Hs+1 x
1+4t, A
21+4ts+2 exp 2tx2
1+4tA
+
Hs+1 x
14t, A
214ts+2 exp 2tx2
14tA,
X
n0
H4n+s+3(x, A)
(2n+ 1)! t2n+1 =
Hs+1 x
1+4t, A
21+4ts+2 exp 2tx2
1+4tA
Hs+1 x
14t, A
214ts+2 exp 2tx2
14tA.
(2.17)
3. The scalar Hermite polynomial series revisited
Clearly, all newly proposed relations for the Hermite matrix polynomials also
subsume the conventional scalar case. This puts us into the position to easily
recover the scalar formula (3.1) derived by the authors of [7] within the context of
quantum mechanics via what they call the quantum mechanical operator-Hermite
polynomial method.
6 EMILIO DEFEZAND MICHAEL M. TUNG[
From a purely mathematical standpoint, we can deduce the following result from
Theorem 2.1:
Corollary 3.1.Let {Hn(x)}n0be the usual sequence of scalar Hermite polynomi-
als. Then for sN0, x R,|t|<1/4:
X
n0
H2n+s(x)
n!tn=
Hsx
1+4t
1+4ts+1 exp 4tx2
1+4t,(3.1)
X
n0
H4n+s(x)
(2n)! t2n=
Hsx
1+4t
21+4ts+1 exp 4tx2
1+4t+
Hsx
14t
214ts+1 exp 4tx2
14t,
X
n0
H4n+s+2(x)
(2n+ 1)! t2n+1 =
Hsx
1+4t
21+4ts+1 exp 4tx2
1+4t
Hsx
14t
214ts+1 exp 4tx2
14t,
X
n0
H4n+s+1(x)
(2n)! t2n=
Hs+1 x
1+4t
21+4ts+2 exp 4tx2
1+4t+
Hs+1 x
14t
214ts+2 exp 4tx2
14t,
X
n0
H4n+s+3(x)
(2n+ 1)! t2n+1 =
Hs+1 x
1+4t
21+4ts+2 exp 4tx2
1+4t
Hs+1 x
14t
214ts+2 exp 4tx2
14t.
(3.2)
Proof 3.1.It is well known that when A= 2 with matrix dimension r= 1, the
Hermite matrix polynomials Hn(x, A) reduce to their scalar counterparts, the usual
Hermite polynomials Hn(x). After substituting these values into formulas (2.5),
(2.16) and (2.17), we recover formulas (3.1)–(3.2).
What remains is to prove the change in the interval of convergence, having
|t|<1/4 instead of |t|<1/16. For the scalar case, we use the following bound
derived by Cramer [11],
|Hn(x)| ≤ K2n/2n!ex2/2, K = 1.086435,(3.3)
to finally obtain the interval of convergence |t|<1/4.
References
[1] E. Defez, A. Herv´
as, L. J´
odar and A. Law. Bounding Hermite matrix polynomials. Math.
Comput. Model. 40 (2004)(1), 117–125.
[2] E. Defez and L. J´
odar. Some applications of the Hermite matrix polynomials series expan-
sions. J. Comput. Appl. Math. 99 (1998)(1), 105–117.
[3] E. Defez, J. Sastre, J. Ib´
a˜
nez and J. Peinado. Solving engineering models using hyperbolic
matrix functions. Appl. Math. Model. 40 (2016)(4), 2837–2844.
[4] E. Defez, J. Sastre, J. Ib´
a˜
nez and P. Ruiz. Computing matrix functions arising in en-
gineering models with orthogonal matrix polynomials. Math. Comput. Model. 57 (2013)(7),
1738–1743.
[5] E. Defez, J. Sastre, J. Ib´
a˜
nez and P. A. Ruiz. Computing matrix functions solving coupled
differential models. Math. Comput. Model. 50 (2009)(5), 831–839.
A NEW TYPE OF HERMITE MATRIX POLYNOMIAL SERIES 7
[6] N. Dunford and J. T. Schwartz.Linear Operators, Part I, John Wiley & Sons, Inc., New
York, 1958.
[7] F. Hong-Yi and Z. De-Hui. New generating function formulae of even-and odd-Hermite
polynomials obtained and applied in the context of quantum optics. Chinese Phys. B 23
(2014)(6), 060301.
[8] J. J´
odar and R. Company. Hermite matrix polynomials and second order matrix differential
equations. Approx. Theor. Appl. 12 (1996)(2), 20–30.
[9] L. J´
odar and E. Defez. A matrix formula for the generating function of the product of Her-
mite matrix polynomials. In International Workshop on Orthogonal Polynomials in Mathe-
matical Physics, SIAM, Madrid, Spain, 1996, pp. 93–101.
[10] L. J´
odar and E. Defez. On Hermite matrix polynomials and Hermite matrix functions.
Approx. Theor. Appl. 14 (1998)(1), 36–48.
[11] G. Sansone.Orthogonal Functions, Interscience Publishers, New York, 1959.
[12] J. Sastre, J. Ib´
a˜
nez, E. Defez and P. Ruiz. Efficient orthogonal matrix polynomial based
method for computing matrix exponential. Appl. Math. Comput. 217 (2011)(14), 6451–6463.
[13] J. Sastre, J. Ib´
a˜
nez, P. Ruiz and E. Defez. Efficient computation of the matrix cosine.
Appl. Math. Comput. 219 (2013)(14), 7575–7585.
Instituto de Matem´
atica Multidisciplinar, Universitat Polit`
ecnica de Val`
encia,
Camino de Vera, s/n, 46022 Valencia, Spain
E-mail address:edefez@imm.upv.es
[Instituto de Matem´
atica Multidisciplinar, Universitat Polit`
ecnica de Val`
encia,
Camino de Vera, s/n, 46022 Valencia, Spain
E-mail address:mtung@imm.upv.es
... Moreover, many authors have dealt with orthogonal matrix polynomials and their applications, For examples, Hermite, Laguerre, Chebyshev, Jacobi, Gegenbauer, Bessel and Legendre matrix polynomials were introduced and studied in [14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29]. ...
... Moreover, some properties of the Hermite matrix polynomials and generalizations for the Hermite matrix polynomials have been introduced in [16,21,50,80,81]. U n (x, A) ...
Article
Full-text available
In recent years special matrix functions and polynomials of a real or complex variable have been in a focus of increasing attention leading to new and interesting problems. In this work we present matrix space analogues to generalized some functions and polynomials in the framework of matrix setting. Many of the special matrix functions and polynomials are constructed along standard procedures. Recently published papers are also surveyed and we list the most essential ones.
... Polynomials and polynomial matrices arise naturally as modeling tools in many areas of applied mathematics, sciences and engineering, especially in systems theory and mathematical description of the dynamics of multivariable systems [17,18,21,28,29,[31][32][33]. Many authors study the algebraic properties of matrix polynomials (see [13][14][15]). Our first contribution in this work to benefit from the concept of MMs is to define MMs polynomials. ...
... have been obtained in [20], having been these formulas applied, e.g. in the theory of quantum optics. The generalization of this class of formulas for Hermite matrix polynomials H n (x, A) can be found in [21]. Hermite matrix polynomial H n (x, A) has the following generating function [12]: ...
Article
Full-text available
In this work we introduce new rational-polynomial Hermite matrix expansions which allow us to obtain a new accurate and efficient method for computing the matrix cosine. This method is compared with other state-of-the-art methods for computing the matrix cosine, including a method based on Padé approximants, showing a far superior efficiency, and higher accuracy. The algorithm implemented on the basis of this method can also be executed either in one or two NVIDIA GPUs, which demonstrates its great computational capacity.
Conference Paper
Full-text available
The Group of High Performance Scientific Computing is a research group dedicated to scientific and high performance computing and its applications. We present here their main contributions to the calculation of matrix functions: mixed rational/polynomial approximations, a general family of methods for the computation of matrix polynomials which is more efficient than the Paterson-Stockmeyer method, and new series expansions of Hermite matrix polynomials, both polynomial and rational, for some of the most important matrix functions.
Article
Full-text available
By combining the operator Hermite polynomial method and the technique of integration within an ordered product of operators, for the first time we derive the generating function of even- and odd-Hermite polynomials which will be useful in constructing new optical field states. We then show that the squeezed state and photon-added squeezed state can be expressed by even- and odd-Hermite polynomials.
Article
Full-text available
Trigonometric matrix functions play a fundamental role in second order differential equation systems. This work presents an algorithm for computing the cosine matrix function based on Taylor series and the cosine double angle formula. It uses a forward absolute error analysis providing sharper bounds than existing methods. The proposed algorithm had lower cost than state-of-the-art algorithms based on Hermite matrix polynomial series and Padé approximants with higher accuracy in the majority of test matrices.
Article
Full-text available
In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.
Article
In this paper a method for computing hyperbolic matrix functions based on Hermite matrix polynomial expansions is outlined. Hermite series truncation together with Paterson-Stockmeyer method allow to compute the hyperbolic matrix cosine e ciently. A theoretical estimate for the optimal value of its parameters is obtained. An e cient and highly-accurate Hermite algorithm and a MATLAB implementation have been developed. The MATLAB implementation has been compared with the MATLAB function funm on matrices of di erent dimensions, obtaining lower execution time and higher accuracy in most cases. To do this we used an NVIDIA Tesla K20 GPGPU card, the CUDA environment and MATLAB. With this implementation we get much better performance for large scale problems.
Article
Trigonometric matrix functions play a fundamental role in the solution of second order differential equations. Hermite series truncation together with Paterson–Stockmeyer method and the double angle formula technique allow efficient computation of the matrix cosine. A careful error bound analysis of the Hermite approximation is given and a theoretical estimate for the optimal value of its parameters is obtained. Based on the ideas above, an efficient and highly-accurate Hermite algorithm is presented. A MATLAB implementation of this algorithm has also been developed and made available online. This implementation has been compared to other efficient state-of-the-art implementations on a large class of matrices for different dimensions, obtaining higher accuracy and lower computational costs in the majority of cases.
Article
This paper deals with Hermite matrix polynomials expansions of some relevant matrix functions appearing in the solution of differential systems. Properties of Hermite matrix polynomials such as the three terms recurrence formula permit an efficient computation of matrix functions avoiding important computational drawbacks of other well-known methods. Results are applied to compute accurate approximations of certain differential systems in terms of Hermite matrix polynomials.
Article
The matrix exponential plays a fundamental role in the solution of differential systems which appear in different science fields. This paper presents an efficient method for computing matrix exponentials based on Hermite matrix polynomial expansions. Hermite series truncation together with scaling and squaring and the application of floating point arithmetic bounds to the intermediate results provide excellent accuracy results compared with the best acknowledged computational methods. A backward-error analysis of the approximation in exact arithmetic is given. This analysis is used to provide a theoretical estimate for the optimal scaling of matrices. Two algorithms based on this method have been implemented as MATLAB functions. They have been compared with MATLAB functions funm and expm obtaining greater accuracy in the majority of tests. A careful cost comparison analysis with expm is provided showing that the proposed algorithms have lower maximum cost for some matrix norm intervals. Numerical tests show that the application of floating point arithmetic bounds to the intermediate results may reduce considerably computational costs, reaching in numerical tests relative higher average costs than expm of only 4.43% for the final Hermite selected order, and obtaining better accuracy results in the 77.36% of the test matrices. The MATLAB implementation of the best Hermite matrix polynomial based algorithm has been made available online.
Article
In this paper we introduce the class of Hermite’s matrix polynomials which appear as finite series solutions of second order matrix differential equations Y″−xAY′+BY=0. An explicit expression for the Hermite matrix polynomials, the orthogonality property and a Rodrigues’ formula are given.