The Efficient Evaluation of the Hypergeometric Function of a Matrix Argument
Lists
Only you see this
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.
BibTeX
@inproceedings{koev2006efficient,
author = {Plamen Koev and Alan Edelman},
title = {{The Efficient Evaluation of the Hypergeometric Function of a Matrix Argument}},
booktitle = {Math. Comput},
year = {2006},
url = {https://openreview.net/forum?id=cAqn6fM8pX},
}Loading related content...