For small values of $\Vert 𝐓\Vert$ the zonal polynomial expansion given by (35.8.1) can be summed numerically. For large $\Vert 𝐓\Vert$ the asymptotic approximations referred to in §35.7(iv) are available.

Other methods include numerical quadrature applied to double and multiple integral representations. See Yan (1992) for the ${}_1{}^{}F_1^{}$ and ${}_2{}^{}F_1^{}$ functions of matrix argument in the case $m=2$, and Bingham et al. (1992) for Monte Carlo simulation on $𝐎(m)$ applied to a generalization of the integral (35.5.8).

Koev and Edelman (2006) utilizes combinatorial identities for the zonal polynomials to develop computational algorithms for approximating the series expansion (35.8.1). These algorithms are extremely efficient, converge rapidly even for large values of $m$, and have complexity linear in $m$.