Re: [boost] FFT proposal for gsoc 2021

13 Mar 2021

      ...
Strongly and beneficially Influence that. But we still need
To adhere to all formal application Steps
A note regarding these formal steps:

https://github.com/boostorg/wiki/wiki/Google-Summer-of-Code%3A-2021
https://lists.boost.org/Archives/boost/2021/02/250876.php
https://www.boost.org/users/faq.html
...
On the board. I can do 1 mentor of Either quad double or FFT.
Yeah, both of them are very useful for me. If we make FFT this year, we can
hope for quad-double next year :-)

best regards
Janek

Christopher Kormanyos said:     (by the date of Fri, 12 Mar 2021 16:00:38 +0100)
...
We still need to adhere to the
Formal application process
And we should have our dialog
On the board. I can do 1 mentor of
Either quad double or FFT.
Having your own idea and a
Working model is a tremendous
Advantage in the application
Process and is likely to very
Strongly and beneficially
Influence that. But we still need
To adhere to all formal application
Steps
Kindest regards, Chris
Sent from my iPhone
...
On 12. Mar 2021, at 07:26, Eduardo Quintana  wrote:
Dear Christopher,
I am thrilled to hear from you! Thank you for offering mentorship for this
project. I look forward to start working on it.
Best regards,
Eduardo
...
On Thu, Mar 11, 2021 at 06:55:37PM +0000, Christopher Kormanyos wrote:
<html><head></head><body><div class="ydpad5c413ayahoo-style-wrap" style="font-family:Helvetica Neue, Helvetica, Arial, sans-serif;font-size:16px;"><div></div>
       <div dir="ltr" data-setdir="false"><div>> Hi Boost community,<br><div>> I've been working on a C++ templated library</div><div>> for Fast Fourier Transforms</div><div><br></div><div>> ...<br></div></div><div dir="ltr" data-setdir="false"><span>> Is there anyone interested in supervising this</span></div><div dir="ltr" data-setdir="false"><span>> project? Any opinions?</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Thank you for your interest and query.<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Yes. I think I am interested and potentially qualified</span></div><div dir="ltr" data-setdir="false"><span>as 5 time GSoC mentor in Multiprecision and Math.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>The plan seems good, start with header only</span></div><div dir="ltr" data-setdir="false"><span>simple implementation and increase complexity</span></div><div dir="ltr" data-setdir="false"><span>and efficiency as time allows.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>This project would fill a present gap and wish list</span></div><div dir="ltr" data-setdir="false"><span>entry in Math/Multirpecision for those unable/unwilling</span></div><div dir="ltr" data-setdir="false"><span>to include FFTW.</span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>I will write a little project description at rthe relevant</span></div><div dir="ltr" data-setdir="false"><span>page, link will follow...<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Feel free to continue this thread, at the moment, i'm</span></div><div dir="ltr" data-setdir="false"><span>too busy to put down all my thoughts...<br></span></div><div dir="ltr" data-setdir="false"><span><br></span></div><div dir="ltr" data-setdir="false"><span>Kind regards, Christopher</span><br></div></div><div><br></div>
</div><div id="yahoo_quoted_5520563993" class="yahoo_quoted">
           <div style="font-family:'Helvetica Neue', Helvetica, Arial, sans-serif;font-size:13px;color:#26282a;">
<div>
                   On Thursday, March 11, 2021, 10:55:29 AM GMT+1, Eduardo Quintana via Boost <boost@lists.boost.org> wrote:
               </div>
               <div><br></div>
               <div><br></div>
               <div>Hi Boost community,<br><br>I've been working on a C++ templated library for Fast Fourier Transforms,<br>https://github.com/Lagrang3/fftx.<br>Templated because some FFT algorithms are algebraic-field independent, eg. you<br>could FFT an array of N matrices provided a Nth matrix-root-of-unity is given.<br>As a result you could have a single algorithm for a variety of underlying, eg.<br>`std::complex<float>`, `std::complex<double>`, `std::complex<long double>`,<br>`boost::math::quaternion`, finite field types (this would yield the "Number<br>theoretic transform" <a href="https://cp-algorithms.com/algebra/fft.html#toc-tgt-6" target="_blank">https://cp-algorithms.com/algebra/fft.html#toc-tgt-6</a>).<br><br>I would like to improve this library during the GSOC 2021, as a proposal for<br>inclusion inside Boost.Math or Boost.Algorithms.<br><br>Is there anyone interested in supervising this project? Any opinions?<br><br>Best regards,<br>Eduardo Quintana<br><br>_______________________________________________<br>Unsubscribe & other changes: <a href="http://lists.boost.org/mailman/listinfo.cgi/boost" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost</a><br></div>
           </div>
       </div></body></html>

-- 
--
Janek Kozicki, PhD. DSc. Arch. Assoc. Prof.
Gdańsk University of Technology
Faculty of Applied Physics and Mathematics
Department of Theoretical Physics and Quantum Information
--
http://yade-dem.org/
http://pg.edu.pl/jkozicki (click English flag on top right)