Lines Matching +full:p +full:- +full:each +full:- +full:series

16 significantly complicated the code, and lengthened start-up times for
37 <P>
38 |<I>f<SUB>x</sub></i>(<I>n</i>) * 2<SUP><I>n</i></sup> - x| < 2<SUP><I>n</i></sup>
39 <P>
42 function.  In order to obtain reasonable performance, each object
44 <P>
53 <P>
65 series expansions.  There is also a specialized function that computes
66 the Taylor series expansion of atan(1/n), where n is a small integer.
68 <P>
69 pi/4 = 4*atan(1/5) - atan(1/239)
70 <P>
72 of the cosine function, which again uses a Taylor series expansion.
73 <P>
76 more expensive than a direct implementation, since each time an approximation
85 <P>
87 either infinite, lazily-evaluated decimal expansions (Schwartz),
90 <P>
94 <P>
97 <P>
100 <P>
103 Implementation, SIGPLAN Notices 25</i>, 6, pp. 102-111.
104 <P>
107 <P>
110 1986 ACM Lisp and Functional Programming Conference</i>, pp. 162-173, 1986.