Back to Search
Start Over
An in-place truncated Fourier transform
- Source :
- Journal of Symbolic Computation. 110:66-80
- Publication Year :
- 2022
- Publisher :
- Elsevier BV, 2022.
-
Abstract
- We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
- Subjects :
- FOS: Computer and information sciences
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Inverse
[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Computational Complexity (cs.CC)
symbols.namesake
Simple (abstract algebra)
truncated Fourier transform
Computer Science - Data Structures and Algorithms
Overhead (computing)
Data Structures and Algorithms (cs.DS)
Computer Science::Symbolic Computation
0601 history and archaeology
Mathematics
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Algebra and Number Theory
060102 archaeology
[INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC]
in-place algorithms
06 humanities and the arts
fast Fourier transform
Computer Science - Computational Complexity
Computational Mathematics
Fourier transform
060105 history of science, technology & medicine
symbols
[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]
Algorithm
Subjects
Details
- ISSN :
- 07477171
- Volume :
- 110
- Database :
- OpenAIRE
- Journal :
- Journal of Symbolic Computation
- Accession number :
- edsair.doi.dedup.....9bc9d6711e0a8e6ab678009177054191