The FFT algorithm is a key pillar of modern numerical computing. This document is a collection of working notes on FFT-based algorithms. Efficient implementations of the former are made available through the pyFFS package.
Type
report
Author(s)
Date Issued
2020-09-30
Total of pages
5
Subjects
Editorial or Peer reviewed
NON-REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
September 30, 2020
Use this identifier to reference this record