Lines 22-36
__FBSDID("$FreeBSD$");
Link Here
|
22 |
* y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal; |
22 |
* y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal; |
23 |
* y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal. |
23 |
* y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal. |
24 |
* Note 2. About jn(n,x), yn(n,x) |
24 |
* Note 2. About jn(n,x), yn(n,x) |
25 |
* For n=0, j0(x) is called, |
25 |
* For n=0, j0(x) is called. |
26 |
* for n=1, j1(x) is called, |
26 |
* For n=1, j1(x) is called. |
27 |
* for n<x, forward recursion us used starting |
27 |
* For n<x, forward recursion is used starting |
28 |
* from values of j0(x) and j1(x). |
28 |
* from values of j0(x) and j1(x). |
29 |
* for n>x, a continued fraction approximation to |
29 |
* For n>x, a continued fraction approximation to |
30 |
* j(n,x)/j(n-1,x) is evaluated and then backward |
30 |
* j(n,x)/j(n-1,x) is evaluated and then backward |
31 |
* recursion is used starting from a supposed value |
31 |
* recursion is used starting from a supposed value |
32 |
* for j(n,x). The resulting value of j(0,x) is |
32 |
* for j(n,x). The resulting values of j(0,x) or j(1,x) are |
33 |
* compared with the actual value to correct the |
33 |
* compared with the actual values to correct the |
34 |
* supposed value of j(n,x). |
34 |
* supposed value of j(n,x). |
35 |
* |
35 |
* |
36 |
* yn(n,x) is similar in all respects, except |
36 |
* yn(n,x) is similar in all respects, except |