17 search results - page 1 / 4 » Fast Table-Driven Algorithms for Interval Elementary Functio... |
ARITH
1997
IEEE
13 years 10 months ago
1997
IEEE
ARITH
2001
IEEE
13 years 9 months ago
2001
IEEE
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
ANTS
1998
Springer
13 years 10 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
JCSS
2010
13 years 4 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
CSR
2010
Springer
13 years 10 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...