In the context of the Bingham probability distribution the ${ }\_1F\_1$ hypergeometric function of matrix argument naturally arises as a normalization constant of the probability distribution function. Thus, it is of interest to evaluate this function effectively. For the more general class of hypergeometric functions $ \_pF\_q$ of Matrix argument, an [algorithm](http://web.mit.edu/sea06/agenda/talks/Koev.pdf) was given by Koev. However, this algorithm still has some open problems discussed in Koevs [paper](http://math.mit.edu/~plamen/files/hyper.pdf). My question is, whether there is a way to compute the normalization constant of a bingham distribution for arbitrary dimensions effectively.