Bailey's FFT algorithm: Difference between revisions

Revision as of 18:46, 20 February 2024

Revision as of 18:52, 20 February 2024

Line 26:

* {{cite book | last1 = Bailey | first1 = D. H. | title = Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 | chapter = FFTS in external of hierarchical memory | date = March 1989 | publisher = ACM Press | doi = 10.1145/76263.76288 | pages=23–35 | volume = 4 | issue = 1 | isbn = 0897913418 | s2cid = 52809390 | chapter-url = https://www.davidhbailey.com/dhbpapers/fftq.pdf}}

* {{cite journal | last1 = Frigo | first1 = M. | last2 = Johnson | first2 = S.G. | title = The Design and Implementation of FFTW3 | journal = Proceedings of the IEEE | date = February 2005 | volume = 93 | issue = 2 | pages = 216–231 | issn = 0018-9219 | doi = 10.1109/JPROC.2004.840301 | pmid = | bibcode = 2005IEEEP..93..216F | s2cid = 6644892 | url = | citeseerx = 10.1.1.66.3097 }}

* {{cite book | last1 = Hart | first1 = William B. | last2 = Tornaría | first2 = Gonzalo | last3 = Watkins | first3 = Mark | chapter = Congruent Number Theta Coefficients to 101210¹² | title = Algorithmic Number Theory | series = Lecture Notes in Computer Science | date = 2010 | volume = 6197 | pages = 186–200 | publisher = Springer Berlin Heidelberg | issn = 0302-9743 | eissn = 1611-3349 | doi = 10.1007/978-3-642-14518-6_17 | isbn = 978-3-642-14517-9 | url = | chapter-url = http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf }}

* {{cite journal | last1 = Al Na'mneh | first1 = Rami | last2 = Pan | first2 = W. David | title = Five-step FFT algorithm with reduced computational complexity | journal = Information Processing Letters | date = March 2007 | volume = 101 | issue = 6 | pages = 262–267 | issn = 0020-0190 | doi = 10.1016/j.ipl.2006.10.009 | pmid = | url = }}

* {{cite book | first1 = Jörg | last1 = Arndt | date = 1 October 2010 | title = Matters Computational: Ideas, Algorithms, Source Code | publisher = Springer Science & Business Media | pages = 438–439 | isbn = 978-3-642-14764-7 | oclc = 1005788763 | chapter-url = https://books.google.com/books?id=HsRHS6u7e80C&pg=PA438 | chapter = The Matrix Fourier Algorithm (MFA)}}