Hi Boost community,
I've been working on a C++ templated library> for Fast Fourier Transforms
...
Is there anyone interested in supervising this> project? Any opinions?
Thank you for your interest and query.
Yes. I think I am interested and potentially qualifiedas 5 time GSoC mentor in Multiprecision and Math.
The plan seems good, start with header onlysimple implementation and increase complexityand efficiency as time allows.
This project would fill a present gap and wish listentry in Math/Multirpecision for those unable/unwillingto include FFTW.
I will write a little project description at rthe relevantpage, link will follow...
Feel free to continue this thread, at the moment, i'mtoo busy to put down all my thoughts...
Kind regards, Christopher
On Thursday, March 11, 2021, 10:55:29 AM GMT+1, Eduardo Quintana via Boost wrote:
Hi Boost community,
I've been working on a C++ templated library for Fast Fourier Transforms,
https://github.com/Lagrang3/fftx.
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?
Best regards,
Eduardo Quintana
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
