Digital Library of Mathematical Functions
About the Project
NIST
35 Functions of Matrix ArgumentProperties

§35.7 Gaussian Hypergeometric Function of Matrix Argument

Contents

§35.7(ii) Basic Properties

§35.7(iii) Partial Differential Equations

Let f:{\boldsymbol{\Omega}}\to\Complex (a) be orthogonally invariant, so that f(\mathbf{T}) is a symmetric function of t_{1},\dots,t_{m}, the eigenvalues of the matrix argument \mathbf{T}\in{\boldsymbol{\Omega}}; (b) be analytic in t_{1},\dots,t_{m} in a neighborhood of \mathbf{T}=\boldsymbol{{0}}; (c) satisfy f(\boldsymbol{{0}})=1. Subject to the conditions (a)–(c), the function f(\mathbf{T})=\mathop{{{}_{{2}}F_{{1}}}\/}\nolimits\!\left(a,b;c;\mathbf{T}\right) is the unique solution of each partial differential equation

for j=1,\dots,m.

Systems of partial differential equations for the \mathop{{{}_{{0}}F_{{1}}}\/}\nolimits (defined in §35.8) and \mathop{{{}_{{1}}F_{{1}}}\/}\nolimits functions of matrix argument can be obtained by applying (35.8.9) and (35.8.10) to (35.7.9).

§35.7(iv) Asymptotic Approximations

Butler and Wood (2002) applies Laplace’s method (§2.3(iii)) to (35.7.5) to derive uniform asymptotic approximations for the functions

and

as \alpha\to\infty. These approximations are in terms of elementary functions.

For other asymptotic approximations for Gaussian hypergeometric functions of matrix argument, see Herz (1955), Muirhead (1982, pp. 264–281, 290, 472, 563), and Butler and Wood (2002).