The efficient evaluation of the hypergeometric function of a matrix argument
Top Cited Papers
Open Access
- 19 January 2006
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (254) , 833-846
Abstract
We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have complexity that is only linear in the size of the matrix.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Accurate and efficient evaluation of Schur and Jack functionsMathematics of Computation, 2005
- Tails of Condition Number DistributionsSIAM Journal on Matrix Analysis and Applications, 2005
- Largest eigenvalue of complex wishart matrices and performance analysis of MIMO MRC systemsIEEE Journal on Selected Areas in Communications, 2003
- Matrix models for beta ensemblesJournal of Mathematical Physics, 2002
- Laplace approximations for hypergeometric functions with matrix argumentThe Annals of Statistics, 2002
- Computing the confluent hypergeometric function, M ( a,b,x )Numerische Mathematik, 2001
- Theoretical reliability of MMSE linear diversity combining in Rayleigh-fading additive interference channelsIEEE Transactions on Communications, 1998
- Total positivity, spherical series, and hypergeometric functions of matrix argumentJournal of Approximation Theory, 1989
- Some combinatorial properties of Jack symmetric functionsAdvances in Mathematics, 1989
- Latent Roots and Matrix Variates: A Review of Some Asymptotic ResultsThe Annals of Statistics, 1978