2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.SC2008
A cache-friendly truncated FFT
David Harvey
We describe a cache-friendly version of van der Hoeven's truncated FFT and inverse truncated FFT, focusing on the case of `large' coefficients, such as those arising in the Schonha…
math.NT2008★ 1 cited
A multimodular algorithm for computing Bernoulli numbers
David Harvey
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p…
cs.SC2007★ 2 cited
Faster polynomial multiplication via multipoint Kronecker substitution
David Harvey
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on…