| |
| | [No title] |
 | | The U function is computed by means C of the backward recursive Miller algorithm applied to the C three term contiguous relation for U(A+K,A,X), K=0,1,... |
 | | C This produces accurate ratios and determines U(A+K,A,X), and C hence E(A,X), to within a multiplicative constant C. C Another contiguous relation applied to C*U(A,A,X) and C C*U(A+1,A,X) gets C*U(A+1,A+1,X), a quantity proportional to C E(A+1,X). |
 | | The normalizing constant C is obtained from the C two term recursion relation above with K=A. C The maximum number of significant digits obtainable C is the smaller of 14 and the number of digits carried in C double precision arithmetic. |
| www.ualberta.ca /CNS/RESEARCH/Software/NumericalSF/dexint.f (560 words) |
|