A cache-friendly truncated FFT

Simple item page
dc.creatorHarvey, David
dc.date2008-10-17
dc.date.accessioned2026-07-07T10:11:16Z
dc.date.available2026-07-07T10:11:16Z
dc.descriptionWe 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 Schonhage--Strassen algorithm for multiplication in Z[x]. We describe two implementations and examine their performance.
dc.description14 pages, 11 figures, uses algorithm2e package
dc.identifierhttps://arxiv.org/abs/0810.3203
dc.identifierhttp://arxiv.org/abs/0810.3203
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171813
dc.subjectSymbolic Computation
dc.subjectData Structures and Algorithms
dc.titleA cache-friendly truncated FFT
dc.typetext

Files

Collections

arXiv