A note on the summation of the generalised hypergeometric functions
Arun Verma · Mathematics of Computation · 1967
5. Advantages and Test Case. A simple computation shows that for n > 3 the new algorithm saves about 3n multiplications and additions when computing f (,) and about n + ,k=3 k multiplications and Ek=i k additions when computing f, (A) This algorithm has been used successfully in a Fortran application on an IBM 7094 using Legendre Polynomials. We found computation time to be reduced by approximately 25 % and accuracy increased by .5 to one order of magnitude.