The efficient evaluation of the hypergeometric function of a matrix argument

From MaRDI portal




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.




Cited in
(86)


Describes a project that uses

Uses Software





This page was built for publication: The efficient evaluation of the hypergeometric function of a matrix argument

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q78925)