11 citations · 19 across the 6 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
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…