Revision as of 23:52, 23 August 2023 edit Dimawik (talk \| contribs) Extended confirmed users 2,445 edits m →Sources: -journal Tag: Reverted ← Previous edit		Revision as of 23:54, 23 August 2023 edit undo Dimawik (talk \| contribs) Extended confirmed users 2,445 edits restoring cite per pdf file Tag: Undo Next edit →
Line 24: ==Sources== * {{cite ~~book~~journal \| last1 = Bailey \| first1 = D. H. \| title = ~~Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 \| chapter = FFTS~~FFTs in external or hierarchical memory \| date = March 1989 \| publisher = ACM Press \| doi = 10.1145/76263.76288 \| journal = Journal of Supercomputing \| 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 = \| s2cid = 6644892 \| url = }} * {{cite book \| title = Lecture Notes in Computer Science \| last1 = Hart \| first1 = William B. \| last2 = Tornaría \| first2 = Gonzalo \| last3 = Watkins \| first3 = Mark \| chapter = Congruent Number Theta Coefficients to 10<sup>12</sup> \| 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 }}

Bailey's FFT algorithm: Difference between revisions