Editing Fast Fourier transform (section)

==References==
{{Reflist|refs=
<ref name="Loan_1992">{{cite book |author-first=Charles |author-last=Van Loan |title=Computational Frameworks for the Fast Fourier Transform |publisher=[[SIAM]] |date=1992}}</ref>
<ref name="Heideman_Johnson_Burrus_1984">{{cite journal |author-last1=Heideman |author-first1=Michael T. |author-first2=Don H. |author-last2=Johnson |author-first3=Charles Sidney |author-last3=Burrus |author-link3=Charles Sidney Burrus |doi=10.1109/MASSP.1984.1162257 |citeseerx=10.1.1.309.181 |title=Gauss and the history of the fast Fourier transform |journal=IEEE ASSP Magazine |volume=1 |issue=4 |pages=14–21 |date=1984 |s2cid=10032502 |url=http://www.cis.rit.edu/class/simg716/Gauss_History_FFT.pdf |archive-url=https://web.archive.org/web/20130319053449/http://www.cis.rit.edu/class/simg716/Gauss_History_FFT.pdf |archive-date=2013-03-19 |url-status=live}}</ref>
<ref name="Heideman_Burrus_1986">{{cite journal |author-first1=Michael T. |author-last1=Heideman |author-first2=Charles Sidney |author-last2=Burrus |author-link2=Charles Sidney Burrus |date=1986 |doi=10.1109/TASSP.1986.1164785 |title=On the number of multiplications necessary to compute a length-2<sup>''n''</sup> DFT |journal=[[IEEE Transactions on Acoustics, Speech, and Signal Processing]] |volume=34 |issue=1 |pages=91–95}}</ref>
<ref name="Dongarra_Sullivan_2000">{{cite journal |title=Guest Editors' Introduction to the top 10 algorithms |journal=  Computing in Science & Engineering|date=January 2000 |issn=1521-9615 |pages=22–23 |volume=2 |issue=1 |doi=10.1109/MCISE.2000.814652 |author-first1=Jack |author-last1=Dongarra |author-first2=Francis |author-last2=Sullivan|bibcode=2000CSE.....2a..22D }}</ref>
<ref name="Brenner_Rader_1976">{{cite journal |author-first1=Norman M. |author-last1=Brenner |author-first2=Charles M. |author-last2=Rader |date=1976 |title=A New Principle for Fast Fourier Transformation |journal=[[IEEE Transactions on Acoustics, Speech, and Signal Processing]] |volume=24 |issue=3 |doi=10.1109/TASSP.1976.1162805 |pages=264–266}}</ref>
<ref name="Kent_2002">{{cite book |author-last1=Kent |author-first1=Ray D. |author-last2=Read |author-first2=Charles |date=2002 |title=Acoustic Analysis of Speech |publisher=Singular/Thomson Learning |isbn=0-7693-0112-6 }}</ref>
<ref name="Strang_1994">{{cite journal |author-last=Strang |author-first=Gilbert |author-link=Gilbert Strang |date=May–June 1994 |title=Wavelets |journal=[[American Scientist]] |volume=82 |issue=3 |pages=250–255 |jstor=29775194|bibcode=1994AmSci..82..250S }}</ref>
<ref name="Ergün_1995">{{cite book |author-first=Funda |author-last=Ergün|author-link=Funda Ergun |title=Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 |chapter=Testing multivariate linear functions |date=1995 |doi=10.1145/225058.225167 |location=Kyoto, Japan |pages=407–416 |isbn=978-0897917186|s2cid=15512806 }}</ref>
<ref name="Frigo_Johnson_2005">{{cite journal |author-last1=Frigo |author-first1=Matteo |author-last2=Johnson |author-first2=Steven G. |date=2005 |title=The Design and Implementation of FFTW3 |url=http://fftw.org/fftw-paper-ieee.pdf |archive-url=https://web.archive.org/web/20050207233032/http://www.fftw.org/fftw-paper-ieee.pdf |archive-date=2005-02-07 |url-status=live |journal=[[Proceedings of the IEEE]] |volume=93 |issue=2 |pages=216–231 |doi=10.1109/jproc.2004.840301 |bibcode=2005IEEEP..93..216F |citeseerx=10.1.1.66.3097|s2cid=6644892 }}</ref>
<ref name="Frigo_Johnson_2007">{{cite journal |author-last1=Frigo |author-first1=Matteo |author-last2=Johnson |author-first2=Steven G. |title=A Modified Split-Radix FFT With Fewer Arithmetic Operations |date=January 2007  |orig-date=2006-12-19 |journal=[[IEEE Transactions on Signal Processing]] |volume=55 |issue=1 |pages=111–119 |doi=10.1109/tsp.2006.882087 |citeseerx=10.1.1.582.5497|bibcode=2007ITSP...55..111J |s2cid=14772428 }}</ref>
<ref name="Duhamel_1990">{{cite journal |author-first1=Pierre |author-last1=Duhamel |date=1990 |doi=10.1109/29.60070 |title=Algorithms meeting the lower bounds on the multiplicative complexity of length-2<sup>n</sup> DFTs and their connection with practical algorithms |journal=[[IEEE Transactions on Acoustics, Speech, and Signal Processing]] |volume=38 |issue=9 |pages=1504–1511}}</ref>
<ref name="Duhamel_Vetterli_1990">{{cite journal |author-first1=Pierre |author-last1=Duhamel |author-first2=Martin |author-last2=Vetterli |author-link2=Martin Vetterli |date=1990 |doi=10.1016/0165-1684(90)90158-U |title=Fast Fourier transforms: a tutorial review and a state of the art |journal=Signal Processing |volume=19 |issue=4 |pages=259–299 |bibcode=1990SigPr..19..259D |url=http://infoscience.epfl.ch/record/59946}}</ref>
<ref name="Edelman_McCorquodale_Toledo_1999">{{cite journal |author-first1=Alan |author-last1=Edelman |author-first2=Peter |author-last2=McCorquodale |author-first3=Sivan |author-last3=Toledo |date=1999 |doi=10.1137/S1064827597316266 |title=The Future Fast Fourier Transform? |journal=[[SIAM Journal on Scientific Computing]] |volume=20 |issue=3 |pages=1094–1114 |url=http://www.cs.tau.ac.il/~stoledo/Bib/Pubs/pp97-fft.pdf |archive-url=https://web.archive.org/web/20170705153832/http://www.cs.tau.ac.il/~stoledo/Bib/Pubs/pp97-fft.pdf |archive-date=2017-07-05 |url-status=live |citeseerx=10.1.1.54.9339}}</ref>
<ref name="Guo_Burrus_1996">{{cite book |author-first1=Haitao |author-last1=Guo |author-first2=Charles Sidney |author-last2=Burrus |chapter=Fast approximate Fourier transform via wavelets transform |editor-first1=Michael A. |editor-first2=Akram |editor-first3=Andrew F. |editor-last1=Unser |editor-last2=Aldroubi |editor-last3=Laine |author-link2=Charles Sidney Burrus |date=1996 |doi=10.1117/12.255236 |title=Wavelet Applications in Signal and Image Processing IV |series=[[Proceedings of SPIE]] |volume=2825 |pages=250–259 |citeseerx=10.1.1.54.3984 |bibcode=1996SPIE.2825..250G |s2cid=120514955 }}</ref>
<ref name="Shentov_Mitra_Heute_Hossen_1995">{{cite journal |author-first1=Ognjan V. |author-last1=Shentov |author-first2=Sanjit K. |author-last2=Mitra |author-first3=Ulrich |author-last3=Heute |author-first4=Abdul N. |author-last4=Hossen |date=1995 |doi=10.1016/0165-1684(94)00103-7 |title=Subband DFT. I. Definition, interpretations and extensions |journal=Signal Processing |volume=41 |issue=3 |pages=261–277}}</ref>
<ref name="Hassanieh_2012">{{cite journal |author-first1=Haitham |author-last1=Hassanieh |author-first2=Piotr |author-last2=Indyk |author-link2=Piotr Indyk |author-first3=Dina |author-last3=Katabi |author-first4=Eric |author-last4=Price |url=https://www.mit.edu/~ecprice/papers/sparse-fft-soda.pdf |archive-url=https://web.archive.org/web/20120304163958/http://www.mit.edu/~ecprice/papers/sparse-fft-soda.pdf |archive-date=2012-03-04 |url-status=live |title=Simple and Practical Algorithm for Sparse Fourier Transform |journal=ACM-SIAM Symposium on Discrete Algorithms  |date=January 2012}} (NB. See also the [http://groups.csail.mit.edu/netmit/sFFT/ sFFT Web Page].)</ref>
<ref name="Haynal_2011">{{cite journal |author-first1=Steve |author-last1=Haynal |author-first2=Heidi |author-last2=Haynal |title=Generating and Searching Families of FFT Algorithms |journal=Journal on Satisfiability, Boolean Modeling and Computation |volume=7 |issue=4 |pages=145–187 |date=2011 |url=http://jsat.ewi.tudelft.nl/content/volume7/JSAT7_13_Haynal.pdf |archive-url=https://web.archive.org/web/20120426031804/http://jsat.ewi.tudelft.nl/content/volume7/JSAT7_13_Haynal.pdf |archive-date=2012-04-26|doi=10.3233/SAT190084 |bibcode=2011arXiv1103.5740H |arxiv=1103.5740 |s2cid=173109 }}</ref>
<ref name="Lundy_Buskirk_2007">{{cite journal |author-first1=Thomas J. |author-last1=Lundy |author-first2=James |author-last2=Van Buskirk |date=2007 |title=A new matrix approach to real FFTs and convolutions of length 2<sup>k</sup> |journal=[[Computing (journal)|Computing]] |volume=80 |issue=1 |pages=23–45 |doi=10.1007/s00607-007-0222-6|s2cid=27296044 }}</ref>
<ref name="Papadimitriou_1979">{{cite journal |author-first=Christos H. |author-last=Papadimitriou |date=1979 |doi=10.1145/322108.322118 |title=Optimality of the fast Fourier transform |journal=[[Journal of the ACM]] |volume=26 |issue=1 |pages=95–102|s2cid=850634 |doi-access=free }}</ref>
<ref name="Sorensen_Jones_Heideman_Burrus_1987_1">{{cite journal |author-first1=Henrik V. |author-last1=Sorensen |author-first2=Douglas L. |author-last2=Jones |author-link2=Douglas L. Jones |author-first3=Michael T. |author-last3=Heideman |author-first4=Charles Sidney |author-last4=Burrus |author-link4=Charles Sidney Burrus |date=1987 |doi=10.1109/TASSP.1987.1165220 |title=Real-valued fast Fourier transform algorithms |journal=[[IEEE Transactions on Acoustics, Speech, and Signal Processing]] |volume=35 |issue=6 |pages=849–863 |citeseerx=10.1.1.205.4523}}</ref>
<ref name="Sorensen_Jones_Heideman_Burrus_1987_2">{{cite journal |doi=10.1109/TASSP.1987.1165284 |author-last1=Sorensen |author-first1=Henrik V. |author-last2=Jones |author-first2=Douglas L. |author-link2=Douglas L. Jones |author-last3=Heideman |author-first3=Michael T. |author-last4=Burrus |author-first4=Charles Sidney |author-link4=Charles Sidney Burrus |date=1987 |pages=1353 |issue=9 |volume=35 |title=Corrections to "Real-valued fast Fourier transform algorithms" |journal=[[IEEE Transactions on Acoustics, Speech, and Signal Processing]]}}</ref>
<ref name="Winograd_1978">{{cite journal |author-first=Shmuel |author-last=Winograd |date=1978 |doi=10.1090/S0025-5718-1978-0468306-4 |title=On computing the discrete Fourier transform |journal=[[Mathematics of Computation]] |volume=32 |issue=141 |pages=175–199 |jstor=2006266 |pmc=430186 |pmid=16592303}}</ref>
<ref name="Winograd_1979">{{cite journal |author-first=Shmuel |author-last=Winograd |title=On the multiplicative complexity of the discrete Fourier transform |journal=[[Advances in Mathematics]] |volume=32 |issue=2 |date=1979 |pages=83–117 |doi=10.1016/0001-8708(79)90037-9 |doi-access= }}</ref>
<ref name="Morgenstern_1973">{{cite journal |author-first1=Jacques |author-last1=Morgenstern |date=1973 |doi=10.1145/321752.321761 |title=Note on a lower bound of the linear complexity of the fast Fourier transform |journal=[[Journal of the ACM]] |volume=20 |issue=2 |pages=305–306|s2cid=2790142 |doi-access=free }}</ref>
<ref name="Mohlenkamp_1999">{{cite journal |doi=10.1007/BF01261607 |author-first1=Martin J. |author-last1=Mohlenkamp |date=1999 |title=A Fast Transform for Spherical Harmonics |journal=Journal of Fourier Analysis and Applications<!-- J. Fourier Anal. Appl. --> |volume=5 |issue=2–3 |pages=159–184 |bibcode=1999JFAA....5..159M |url=http://www.ohiouniversityfaculty.com/mohlenka/research/MOHLEN1999P.pdf |archive-url=https://web.archive.org/web/20170506033135/http://ohiouniversityfaculty.com/mohlenka/research/MOHLEN1999P.pdf |archive-date=2017-05-06 |url-status=live |access-date=2018-01-11 |citeseerx=10.1.1.135.9830|s2cid=119482349 }}</ref>
<ref name="Schatzman_1996">{{cite journal |author-last1=Schatzman |author-first1=James C. |date=1996 |title=Accuracy of the discrete Fourier transform and the fast Fourier transform |url=http://portal.acm.org/citation.cfm?id=240432 |journal=[[SIAM Journal on Scientific Computing]] |volume=17 |issue=5 |pages=1150–1166 |doi=10.1137/s1064827593247023 |bibcode=1996SJSC...17.1150S |citeseerx=10.1.1.495.9184}}</ref>
<ref name="Nussbaumer_1977">{{cite journal |author-first1=Henri J. |author-last1=Nussbaumer |date=1977 |doi=10.1049/el:19770280 |title=Digital filtering using polynomial transforms |journal=[[Electronics Letters]] |volume=13 |issue=13 |pages=386–387|bibcode=1977ElL....13..386N }}</ref>
<ref name="Pan_1986">{{cite journal |author-first=Victor Ya. |author-last=Pan |date=1986-01-02 |doi=10.1016/0020-0190(86)90035-9 |title=The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms |journal=[[Information Processing Letters]] |volume=22 |issue=1 |pages=11–14 |url=https://dl.acm.org/citation.cfm?id=8013 |access-date=2017-10-31 }}</ref>
<ref name="Potts_Steidl_Tasche_2001">{{cite book |author-first1=Daniel |author-last1=Potts |author-first2=Gabriele |author-last2=Steidl|author2-link= Gabriele Steidl |author-first3=Manfred |author-last3=Tasche |date=2001 |chapter-url=http://www.tu-chemnitz.de/~potts/paper/ndft.pdf |archive-url=https://web.archive.org/web/20070926222858/http://www.tu-chemnitz.de/~potts/paper/ndft.pdf |archive-date=2007-09-26 |url-status=live |chapter=Fast Fourier transforms for nonequispaced data: A tutorial |editor-first1=J. J. |editor-last1=Benedetto |editor-first2=P. |editor-last2=Ferreira |title=Modern Sampling Theory: Mathematics and Applications |publisher=[[Birkhäuser]]}}</ref>
<ref name="Rokhlin_Tygert_2006">{{cite journal |author-first1=Vladimir |author-last1=Rokhlin |author-first2=Mark |author-last2=Tygert |date=2006 |title=Fast Algorithms for Spherical Harmonic Expansions |journal=[[SIAM Journal on Scientific Computing]] |volume=27 |issue=6 |doi=10.1137/050623073 |pages=1903–1928 |bibcode=2006SJSC...27.1903R |url=http://tygert.com/sph2.pdf |archive-url=https://web.archive.org/web/20141217212000/http://tygert.com/sph2.pdf |archive-date=2014-12-17 |url-status=live |access-date=2014-09-18 |citeseerx=10.1.1.125.7415}} [http://www.cs.yale.edu/publications/techreports/tr1309.pdf]</ref>
<ref name="Welch_1969">{{cite journal |author-first1=Peter D. |author-last1=Welch |date=1969 |doi=10.1109/TAU.1969.1162035 |title=A fixed-point fast Fourier transform error analysis |journal=[[IEEE Transactions on Audio and Electroacoustics]] |volume=17 |issue=2 |pages=151–157}}</ref>
<ref name="Gauss_1866">{{cite book |author-first=Carl Friedrich |author-last=Gauss |author-link=Carl Friedrich Gauss |chapter-url=https://babel.hathitrust.org/cgi/pt?id=uc1.c2857678;view=1up;seq=279 |title=Nachlass |chapter=Theoria interpolationis methodo nova tractata |type=Unpublished manuscript |trans-chapter=Theory regarding a new method of interpolation |series=Werke |location=Göttingen, Germany |publisher=Königlichen Gesellschaft der Wissenschaften zu Göttingen |date=1866 |volume=3 |pages=265–303 |language=la, de}}</ref>
<ref name="Heideman_Johnson_Burrus_1985">{{cite journal |title=Gauss and the history of the fast Fourier transform |journal=Archive for History of Exact Sciences |date=1985-09-01 |issn=0003-9519 |pages=265–277 |volume=34 |issue=3 |doi=10.1007/BF00348431 |author-first1=Michael T. |author-last1=Heideman |author-first2=Don H. |author-last2=Johnson |author-first3=Charles Sidney |author-last3=Burrus |author-link3=Charles Sidney Burrus |citeseerx=10.1.1.309.181|s2cid=122847826 }}</ref>
<ref name="Yates_1937">{{cite journal |title=The design and analysis of factorial experiments |author-last=Yates |author-first=Frank |author-link=Frank Yates |date=1937 |journal=Technical Communication No. 35 of the Commonwealth Bureau of Soils|volume=142 |issue=3585 |pages=90–92 |bibcode=1938Natur.142...90F |doi=10.1038/142090a0 |s2cid=23501205 }}</ref>
<ref name="Cooley_Lewis_Welch_1967">{{cite journal |title=Historical notes on the fast Fourier transform |journal=[[IEEE Transactions on Audio and Electroacoustics]] |date=June 1967 |issn=0018-9278 |pages=76–79 |volume=15 |issue=2 |doi=10.1109/TAU.1967.1161903 |author-first1=James W. |author-last1=Cooley |author-link1=James Cooley |author-first2=Peter A. W. |author-last2=Lewis |author-first3=Peter D. |author-last3=Welch |citeseerx=10.1.1.467.7209}}</ref>
<ref name="Cooley_Tukey_1965">{{cite journal |title=An algorithm for the machine calculation of complex Fourier series |url=https://www.ams.org/mcom/1965-19-090/S0025-5718-1965-0178586-1/ |journal=[[Mathematics of Computation]] |date=1965 |issn=0025-5718 |pages=297–301 |volume=19 |issue=90 |doi=10.1090/S0025-5718-1965-0178586-1 |author-first1=James W. |author-last1=Cooley |author-link1=James Cooley |author-first2=John W. |author-last2=Tukey |author-link2=John Tukey|doi-access=free }}</ref>
<ref name="Danielson_Lanczos_1942">{{cite journal |title=Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids |author-first1=Gordon C. |author-last1=Danielson |author-link1=Gordon C. Danielson |author-first2=Cornelius |author-last2=Lanczos |author-link2=Cornelius Lanczos |date=1942 |journal=Journal of the Franklin Institute |doi=10.1016/S0016-0032(42)90767-1 |volume=233 |issue=4 |pages=365–380}}</ref>
<ref name="Lanczos_1956">{{cite book |author-first=Cornelius |author-last=Lanczos |author-link=Cornelius Lanczos |title=Applied Analysis |url=https://archive.org/details/appliedanalysis00lanc_0 |url-access=registration |date=1956 |publisher=[[Prentice–Hall]]}}</ref>
<ref name="Fernandez-de-Cossio_2012">{{cite journal |author-last1=Fernandez-de-Cossio Diaz |author-first1=Jorge |author-last2=Fernandez-de-Cossio |author-first2=Jorge |date=2012-08-08 |title=Computation of Isotopic Peak Center-Mass Distribution by Fourier Transform |journal=Analytical Chemistry<!-- Anal. Chem. --> |volume=84 |issue=16 |pages=7052–7056 |doi=10.1021/ac301296a |pmid=22873736 |issn=0003-2700}}</ref>
<ref name="Chu_George_1999">{{cite book |title=Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms |author-last1=Chu |author-first1=Eleanor |author-last2=George |author-first2=Alan |publisher=[[CRC Press]] |isbn=978-1-42004996-1 |pages=153–168 |orig-date=1999-11-11 |chapter=Chapter 16 |date=1999-11-11}}</ref>
<ref name="Rockmore_2000">{{cite journal |title=The FFT: an algorithm the whole family can use |journal=Computing in Science & Engineering|date=January 2000 |issn=1521-9615 |pages=60–64 |volume=2 |issue=1 |doi=10.1109/5992.814659 |author-first=Daniel N. |author-last=Rockmore |citeseerx=10.1.1.17.228|bibcode=2000CSE.....2a..60R |s2cid=14978667 }}</ref>
<ref name="Rockmore_2004">{{cite book |title=Computational Noncommutative Algebra and Applications |chapter=Recent Progress and Applications in Group FFTs |publisher=Springer Netherlands |date=2004 |isbn=978-1-4020-1982-1 |pages=227–254 |series=NATO Science Series II: Mathematics, Physics and Chemistry |volume=136 |author-first=Daniel N. |author-last=Rockmore |editor-first=Jim |editor-last=Byrnes |doi=10.1007/1-4020-2307-3_9 |citeseerx=10.1.1.324.4700|s2cid=1412268 }}</ref>
<ref name="Gentleman_Sande_1966">{{cite journal |author-last1=Gentleman |author-first1=W. Morven |author-last2=Sande |author-first2=G. |date=1966 |title=Fast Fourier transforms—for fun and profit |journal=[[Proceedings of the AFIPS]] |volume=29 |pages=563–578 |doi=10.1145/1464291.1464352|s2cid=207170956 |doi-access=free }}</ref>
<ref name="Gauss_1805">{{cite book |author-first=Carl Friedrich |author-last=Gauss |author-link=Carl Friedrich Gauss |date=1866 |orig-date=1805 |url=https://gdz.sub.uni-goettingen.de/id/PPN235999628 |title=Theoria interpolationis methodo nova tractata |series=Werke |volume=3 |pages=265–327 |location=Göttingen, Germany |publisher=Königliche Gesellschaft der Wissenschaften |language=la, de}}</ref>
<ref name="Cooley_1987">{{cite book |author-first=James W. |author-last=Cooley |author-link=James W. Cooley |contribution-url=https://carma.newcastle.edu.au/jon/Preprints/Talks/CARMA-CE/FFT.pdf |archive-url=https://web.archive.org/web/20160820070623/https://carma.newcastle.edu.au/jon/Preprints/Talks/CARMA-CE/FFT.pdf |archive-date=2016-08-20 |url-status=live |contribution=The Re-Discovery of the Fast Fourier Transform Algorithm |title=Microchimica Acta |location=Vienna, Austria |date=1987 |volume=III |pages=33–45}}</ref>
<ref name="Garwin_1969">{{cite journal |author-first=Richard |author-last=Garwin |url=https://fas.org/rlg/690600-fft.pdf |archive-url=https://web.archive.org/web/20060517021147/http://www.fas.org/RLG/690600-fft.pdf |archive-date=2006-05-17 |url-status=live |title=The Fast Fourier Transform As an Example of the Difficulty in Gaining Wide Use for a New Technique |journal=[[IEEE Transactions on Audio and Electroacoustics]] |volume=AU-17 |issue=2 |date=June 1969 |pages=68–72}}</ref>
<ref name="libftsh">{{Cite web |url=http://www.math.ohiou.edu/~mjm/research/libftsh.html |title=libftsh library |access-date=2007-01-09 |archive-url=https://web.archive.org/web/20100623034953/http://www.math.ohiou.edu/~mjm/research/libftsh.html |archive-date=2010-06-23 }}</ref>
<ref name="Cormen_Nicol_1998">{{cite journal |title=Performing out-of-core FFTs on parallel disk systems |author-first1=Thomas H. |author-last1=Cormen |author-first2=David M. |author-last2=Nicol |date=1998 |journal=Parallel Computing |doi=10.1016/S0167-8191(97)00114-2 |volume=24 |issue=1 |pages=5–20 |citeseerx=10.1.1.44.8212 |s2cid=14996854 }}</ref>
<ref name="Dutt_Rokhlin_1993">{{cite journal |title=Fast Fourier Transforms for Nonequispaced Data |journal=[[SIAM Journal on Scientific Computing]] |date=1993-11-01 |issn=1064-8275 |pages=1368–1393 |volume=14 |issue=6 |doi=10.1137/0914081 |author-first1=Alok |author-last1=Dutt |author-first2=Vladimir |author-last2=Rokhlin|bibcode=1993SJSC...14.1368D }}</ref>
}}