From: Eduardo Quintana (eduardo.quintana_at_[hidden])
Date: 2021-03-11 09:46:54
I've been working on a C++ templated library for Fast Fourier Transforms,
Templated because some FFT algorithms are algebraic-field independent, eg. you
could FFT an array of N matrices provided a Nth matrix-root-of-unity is given.
As a result you could have a single algorithm for a variety of underlying, eg.
`std::complex<float>`, `std::complex<double>`, `std::complex<long double>`,
`boost::math::quaternion`, finite field types (this would yield the "Number
theoretic transform" https://cp-algorithms.com/algebra/fft.html#toc-tgt-6).
I would like to improve this library during the GSOC 2021, as a proposal for
inclusion inside Boost.Math or Boost.Algorithms.
Is there anyone interested in supervising this project? Any opinions?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk