1. Description of dental arch form using the Fourier series
   Valenzuela A, P.; Pardo, M. A.; Yezioro, S.
   International Journal of Adult Orthodontics and Orthognathic Surgery, 2002, vol. 17, no. 1, pp. 59-65 , Ingenta.  
2. Efficient implementation of quaternion Fourier transform, convolution, and correlation by 2-D complex FFT.  
   Pei, Soo-Chang; Ding, Jian-Jiun; Chang, Ja-Han  
   IEEE Trans. Signal Process. 49 (2001), no. 11, 2783--2797, Math. Sci. Net.  
3. The Cooley-Tukey FFT and group theory.  
   Maslen, David K.; Rockmore, Daniel N.
   Notices Amer. Math. Soc. 48 (2001), no. 10, 1151--1160, Math. Sci. Net.  
4. Approximation by a kind of trigonometric interpolation polynomials in the Hölder metric. (Chinese)    
   Hou, Xiang Qian    
   J. Ningxia Univ. Nat. Sci. Ed. 22 (2001), no. 3, 282--283, Math. Sci. Net.  
5. Fast Fourier transforms for nonequispaced data: a tutorial.
   Potts, Daniel; Steidl, Gabriele; Tasche, Manfred
   Modern sampling theory, 247--270, Appl. Numer. Harmon. Anal., Birkhäuser Boston, Boston, MA, 2001.
6. The fast Fourier transform method and ill-conditioned matrices.
   Soon, Boon Yi; Eloe, Paul W.; Kammler, David
   Appl. Math. Comput. 117 (2001), no. 2-3, 117--129.
7. Gibbs-Phenomenon-Free Fourier Series for Vibration and Stability of Complex Beams
   Fan, S. C.; Zheng, D. Y.; Au, F. T. K.
   AIAA Journal, 2001, vol. 39, no. 10, pp. 1977-1984 , Ingenta.  
8. Teaching time-series analysis. I. Finite Fourier analysis of ocean waves
   Whitford, D. J.; Vieira, M. E. C.; Waters, J. K.
   American Journal of Physics, 2001, vol. 69, no. 4, pp. 490-496 , Ingenta.  
9. Lesser known FFT algorithms.
   Tolimieri, R.; An, M.
   Twentieth century harmonic analysis---a celebration (Il Ciocco, 2000), 151--162, NATO Sci. Ser. II Math. Phys. Chem., 33, Kluwer Acad. Publ., Dordrecht, 2001, Math. Sci. Net.  
10. A simple and efficient parallel FFT algorithm using the BSP model.
    Inda, Márcia A.; Bisseling, Rob H.
    Parallel Comput. 27 (2001), no. 14, 1847--1878, Math. Sci. Net.  
11. Worst and average case roundoff error analysis for FFT.
    Tasche, Manfred; Zeuner, Hansmartin
    BIT 41 (2001), no. 3, 563--581, Math. Sci. Net.  
12. Applications of Fourier Series in Classical Guitar Technique  
    James Hughes  
    College Math Journal: 2000, Volume 31, Number 4, Pages: 300-303.  
13. Using FFT-based techniques in polynomial and matrix computations: recent advances and applications.
    Bini, Dario Andrea
    Proceedings of the International Conference on Fourier Analysis and Applications (Kuwait, 1998). Numer. Funct. Anal. Optim. 21 (2000), no. 1-2, 47--66, Math. Sci. Net.  
14. Multiply-add optimized FFTkernels.  
    Karner, Herbert; Auer, Martin; Ueberhuber, Christoph W.  
    Special issue in memory of Richard Weiss. Math. Models Methods Appl. Sci. 11 (2001), no. 1, 105--117, Math. Sci. Net.  
15. Discussion about architectures associated with the parallel FFT algorithm. (Chinese)
    Sun, Shi Xin; Chen, Ping An; Zhang, Yan
    Dianzi Keji Daxue Xuebao 29 (2000), no. 5, 535--539, Math. Sci. Net.  
16. Approximation of periodic functions with high smoothness by interpolation trigonometric polynomials in the L1-metric. (Ukrainian)    
    Serdyuk, A. S.    
    Ukraïn. Mat. Zh. 52 (2000), no. 7, 994--998; translation in Ukrainian Math. J. 52 (2000), no. 7, 1141--1146, Math. Sci. Net.  
17. The degree of best approximation in the Lipschitz norm by trigonometric polynomials.   
    Bustamante, Jorge; Jiménez, Miguel Antonio    
    XXXI National Congress of the Mexican Mathematical Society (Spanish) (Hermosillo, 1998), 23--30, Aportaciones Mat. Comun., 25, Soc. Mat. Mexicana, México, 1999, Math. Sci. Net.  
18. A parallel fast Fourier transform.
    Morante, Silvia; Rossi, Giancarlo; Salina, Gaetano
    Internat. J. Modern Phys. C 10 (1999), no. 5, 781--805.
19. A fast program generator of fast Fourier transforms.  
    Clausen, Michael; Müller, Meinard
    Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999), 29--42, Lecture Notes in Comput. Sci., 1719, Springer, Berlin, 1999.
20. Multidimensional fast Fourier transform algorithm for signals with arbitrary symmetries.
    Bernardini, R.; Cortelazzo, G.; Mian, G. A.
    J. Opt. Soc. Amer. A 16 (1999), no. 8, 1892--1908.
21. The future fast Fourier transform ?
    Edelman, Alan; McCorquodale, Peter; Toledo, Sivan
    SIAM J. Sci. Comput. 20 (1999), no. 3, 1094--1114 (electronic).
22. On computing the 2-D FFT.
    Sevi'c, Dragutin
    IEEE Trans. Signal Process. 47 (1999), no.5, 1428--1431, Math. Sci. Net.  
23. Least-squares trigonometric regression estimation. (English. English summary)
    Popi'nski, W.
    Appl. Math. (Warsaw) 26 (1999), no. 2, 121--131, Math. Sci. Net, Math. Sci. Net.  
24. Two- and three-dimensional image rotation using the FFT.
    Cox, Robert W.; Tong, Raoqiong
    IEEE Trans. Image Process. 8 (1999), no. 9, 1297--1299, Math. Sci. Net.  
25. An FFT-based algorithm for 2D power series expansions.  
    Hwang, Chyi; Guo, Jia-Chyu; Guo, Tong-Yi
    Comput. Math. Appl. 37 (1999), no. 10, 19--27, Math. Sci. Net.  
26. The Fitting of A Regression Function Using the Fourier Series Estimator.
    Lin, Yung-Li; Kuo, Bo-Jein; Ho, Siu Chuen
    Nung lin hsueh pao, 1999, vol. 48, no. 3, pp. 55 , Ingenta.  
27. Pepinsky's Machine: an interactive graphics-based Fourier synthesis program with applications in teaching and research.
    Glykos, N. M.
    Journal of applied crystallography, 1999, vol. 32p4, pp. 821 , Ingenta.  
28. Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programming.
    Cormen, Thomas H.
    Algorithms for parallel processing (Minneapolis, MN, 1996), 307--320, IMA Vol. Math. Appl., 105, Springer, New York, 1999, Math. Sci. Net.  
29. On the piecewise trigonometric nonlinear regression models.    
    Albeanu, Grigore    
    Stud. Cerc. Mat. 50 (1998), no. 1-2, 1--4, Math. Sci. Net.  
30. Numerical calculation of fractional Fourier transforms with a single fast-Fourier-transform algorithm.
    Marinho, Francisco J.; Bernardo, Luís M.
    J. Opt. Soc. Amer. A 15 (1998), no. 8, 2111--2116.
31. A parallel algorithm for the fast Fourier transform. (Chinese)
    Fu, Dong Sheng
    Nanjing Daxue Xuebao Shuxue Bannian Kan 15 (1998), no. 2, 218--224.
32. The quick Fourier transform: an FFT based on symmetries.
    Guo, Haitao; Sitton, Gary A.; Burrus, C. Sydney
    IEEE Trans. Signal Process. 46 (1998), no. 2, 335--341, Math. Sci. Net.  
33. Performing out-of-core FFTs on parallel disk systems.  
    Cormen, Thomas H.; Nicol, David M.
    Parallel Comput. 24 (1998), no. 1, 5--20, Math. Sci. Net.  
34. Implementation and evaluation of radix-2, 3 and 5 1-D FFT on distributed memory parallel computers. (Japanese)
    Takahashi, Daisuke; Kanada, Yasumasa
    Trans. Inform. Process. Soc. Japan 39(1998), no. 3, 519--528, Math. Sci. Net.  
35. FFT algorithms and their adaptation to parallel processing.
    Chu, Eleanor; George, Alan
    ILASSymposium on Fast Algorithms for Control, Signals and Image Processing (Winnipeg, MB, 1997). Linear Algebra Appl. 284 (1998), no. 1-3, 95--124, Math. Sci. Net.  
36. Best multivariate approximations by trigonometric polynomials with frequencies from hyperbolic crosses.    
    Dinh Dung    
    J. Approx. Theory 91 (1997), no. 2, 205--225, Math. Sci. Net.  
37. On numerical methods for discrete least-squares approximation by trigonometric polynomials.    
    Fassbender, Heike    
    Math. Comp. 66 (1997), no. 218, 719--741, Math. Sci. Net.  
38. A parallel algorithm for computing FFTs on MIMD parallel computers. (Chinese)
    Lin, Shui Sheng; Huang, Shun Ji
    Dianzi Keji Daxue Xuebao 26 (1997), no. 6, 621--626, Math. Sci. Net.  
39. Generalized FFTs---a survey of some recent results.
    Maslen, David K.; Rockmore, Daniel N.
    Groups and computation, II (New Brunswick, NJ, 1995), 183--237, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 28, Amer. Math. Soc., Providence, RI, 1997, Math. Sci. Net.  
40. Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT).
    Kosheleva, Olga; Cabrera, Sergio D.; Gibson, Glenn A.; Koshelev, Misha
    Fuzzy Sets and Systems 91 (1997), no. 2, 269--277, Math. Sci. Net.  
41. Configurational transitions in Fourier series-represented DNA supercoils.
    Liu, Guohua; Schlick, Tamar; Olson, Wilma K.
    Biophysical journal, 1997, vol. 73, no. 4, pp. 1742 , Ingenta.  
42. A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.    
    Faßbender, Heike    
    Electron. Trans. Numer. Anal. 4 (1996), June, 64--74 (electronic), Math. Sci. Net.  
43. Accuracy of the discrete Fourier transform and the fast Fourier transform.
    Schatzman, James C.
    SIAM J. Sci. Comput. 17 (1996), no. 5, 1150--1166.
44. Fast Fourier transform accelerated fast multipole algorithm.
    Elliott, William D.; Board, John A., Jr.
    SIAM J. Sci. Comput. 17 (1996), no. 2, 398--415.
45. FFTs on mesh connected computers.
    Argüello, Francisco; Amor, Margarita; Zapata, Emilio L.
    Parallel Comput. 22 (1996), no. 1, 19--38, Math. Sci. Net.  
46. On the L^2 Inequalities Involving Trigonometric Polynomials and Their Derivatives  
    Weiyu Chen  
    Transactions of the American Mathematical Society, Vol. 347, No. 5. (May, 1995), pp. 1753-1761, Jstor.  
47. Parallel FFT algorithms using radix 4 butterfly computation on an eight-neighbor processor array.
    Tanno, Kuninobu; Taketa, Toshihiro; Horiguchi, Susumu
    Parallel Comput. 21 (1995), no. 1, 121--136, Math. Sci. Net.  
48. Determining the number of terms in a trigonometric regression.    
    Kavalieris, L.; Hannan, E. J.    
    J. Time Ser. Anal. 15 (1994), no. 6, 613--625, Math. Sci. Net.  
49. On the numerical treatment of nonlinear regression models by trigonometric B-splines.    
    Albeanu, Grigore    
    An. Univ. Bucuresti Mat. Inform. 42/43 (1993/94), 41--49, Math. Sci. Net.  
50. On the strong approximation by trigonometric interpolating polynomials.    
    Nowakowski, Krzysztof; Taberski, Roman    
    Funct. Approx. Comment. Math. 22 (1993), 149--158 (1994), Math. Sci. Net.  
51. Fast Fourier Transforms for Symmetric Groups: Theory and Implementation  
    Michael Clausen, Ulrich Baum  
    Mathematics of Computation, Vol. 61, No. 204. (Oct., 1993), pp. 833-847, Jstor.  
52. FFT-Based Preconditioners for Toeplitz-Block Least Squares Problems  
    Raymond H. Chan, James G. Nagy, Robert J. Plemmons  
    SIAM Journal on Numerical Analysis, Vol. 30, No. 6. (Dec., 1993), pp. 1740-1768, Jstor.  
53. On approximation by trigonometric polynomials in Lp-spaces.    
    Ky, N. X.    
    Studia Sci. Math. Hungar. 28 (1993), no. 1-2, 183--188, Math. Sci. Net.  
54. FFT in calculating nonparametric regression estimate based on trigonometric series.
    Rafajowicz, Ewaryst; Skubalska-Rafajowicz, Ewa
    Appl. Math. Comput. Sci. 3 (1993), no. 4, 713--720, Math. Sci. Net.  
55. Parallel compact FFTs for real sequences.
    Pelz, Richard B.
    SIAM J. Sci. Comput. 14 (1993), no. 4, 914--935, Math. Sci. Net.  
56. Superparallel FFTs.
    Munthe-Kaas, Hans
    SIAM J. Sci. Comput. 14 (1993), no. 2, 349--367, Math. Sci. Net.  
57. On approximation by trigonometric Lagrange interpolating polynomials. II.    
    Borwein, P. B.; Xie, T. F.; Zhou, S. P.    
    Bull. Austral. Math. Soc. 45 (1992), no. 2, 215--221, Math. Sci. Net.  
58. A novel correlation-based FFT algorithm.
    Wu, Chia Lin; Chin, I Ming
    J. Chinese Inst. Engrs. 15 (1992), no. 5, 549--557, Math. Sci. Net.  
59. On optimal embeddings of the FFT graph and the butterfly graph into the hypercube.
    Stöhr, Elena A.
    Comput. Artificial Intelligence 11 (1992), no. 5, 509--519, Math. Sci. Net.  
60. Communication efficient multi-processor FFT.
    Johnsson, S. Lennart; Jacquemin, Michel; Krawitz, Robert L.
    J. Comput. Phys. 102 (1992), no. 2, 381--397, Math. Sci. Net.  
61. Discrete Least Squares Approximation by Trigonometric Polynomials  
    L. Reichel, G. S. Ammar, W. B. Gragg  
    Mathematics of Computation, Vol. 57, No. 195. (Jul., 1991), pp. 273-289, Jstor.  
62. The Fractional Fourier Transform and Applications  
    David H. Bailey, Paul N. Swarztrauber  
    SIAM Review, Vol. 33, No. 3. (Sep., 1991), pp. 389-404, Jstor.  
63. A Stochastic Roundoff Error Analysis for the Fast Fourier Transform  
    Daniela Calvetti  
    Mathematics of Computation, Vol. 56, No. 194. (Apr., 1991), pp. 755-774, Jstor.  
64. Algorithm AS 265:  G/G/1 Via Fast Fourier Transform (in Statistical Algorithms)  
    R. Grubel  
    Applied Statistics, Vol. 40, No. 2. (1991), pp. 355-365, Jstor.  
65. Tests of Distributional Hypotheses with Nuisance Parameters Using Fourier Series Methods (in Theory and Methods)  
    Bryan Langholz, Richard A. Kronmal  
    Journal of the American Statistical Association, Vol. 86, No. 416. (Dec., 1991), pp. 1077-1084, Jstor.  
66. Transforms, Finite Fields, and Fast Multiplication  
    Patrick Chu  
    Mathematics Magazine: 1990, Volume 63, Number 5, Pages: 330-336.  
67. Curve Fitting by Polynomial-Trigonometric Regression  
    R. L. Eubank, Paul Speckman  
    Biometrika, Vol. 77, No. 1. (Mar., 1990), pp. 1-9, Jstor.  
68. The FFT as a Multigrid Algorithm  
    William L. Briggs, Van Emden Henson  
    SIAM Review, Vol. 32, No. 2. (Jun., 1990), pp. 252-261, Jstor.  
69. An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation  
    Takemitsu Hasegawa, Tatsuo Torii, Hiroshi Sugiura  
    Mathematics of Computation, Vol. 54, No. 189. (Jan., 1990), pp. 195-210, Jstor.  
70. An FFT Extension to the P-1 Factoring Algorithm  
    Peter L. Montgomery, Robert D. Silverman  
    Mathematics of Computation, Vol. 54, No. 190. (Apr., 1990), pp. 839-854, Jstor.  
71. Curve fitting by polynomial-trigonometric regression.    
    Eubank, R. L.; Speckman Paul     
    Biometrika 77 (1990), no. 1, 1--9, Math. Sci. Net.  
72. On the best approximation of Riemann integrable functions by trigonometric polynomials.    
    Mevissen, H.; Nessel, R. J.    
    Math. Balkanica (N.S.) 4 (1990), no. 3, 289--299 (1991), Math. Sci. Net.  
73. Fast Fourier transforms: a tutorial review and a state of the art.
    Duhamel, P.; Vetterli, M.
    Signal Process. 19 (1990), no. 4, 259--299.
74. The FFT as a multigrid algorithm.
    Briggs, William L.; Henson, Van Emden
    SIAM Rev. 32 (1990), no. 2, 252--261, Math. Sci. Net.  
75. An algorithm based on the FFT for a generalized Chebyshev interpolation.
    Hasegawa, Takemitsu; Torii, Tatsuo; Sugiura, Hiroshi
    Math. Comp. 54 (1990), no. 189, 195--210, Math. Sci. Net.  
76. On approximation by trigonometric Lagrange interpolating polynomials.    
    Xie, T. F.; Zhou, S. P.    
    Bull. Austral. Math. Soc. 40 (1989), no. 3, 425--428, Math. Sci. Net.  
77. The Bernoulli spline and approximation by trigonometric blending polynomials.    
    Jetter, Kurt    
    Results Math. 16 (1989), no. 3-4, 243--252, Math. Sci. Net.  
78. Nesting strategies for prime factor FFT algorithms.
    Temperton, Clive
    J. Comput. Phys. 82 (1989), no. 2, 247--268, Math. Sci. Net.  
79. Remark AS R73: A Remark on Algorithm AS 222: Resistant Smoothing Using the Fast Fourier Transform (in Statistical Algorithms)  
    Tony Dusoir  
    Applied Statistics, Vol. 37, No. 2. (1988), pp. 316-317, Jstor.  
80. Gray codes, fast Fourier transforms and hypercubes.
    Chamberlain, R. M.
    Parallel Comput. 6 (1988), no. 2, 225--233.
81. Parallel compact symmetric FFTs.
    Henson, Van Emden
    Vector and parallel computing (Tromsø, 1988), 153--164, Ellis Horwood Ser. Comput. Appl., Horwood, Chichester, 1989, Math. Sci. Net.  
82. A segmented FFT algorithm for vector computers.
    Ashworth, Mike; Lyne, Andrew G.
    Parallel Comput. 6 (1988), no. 2, 217--224, Math. Sci. Net.  
83. Implementation of a prime factor FFT algorithm on CRAY-1.
    Temperton, Clive
    ParallelComput. 6 (1988), no. 1, 99--108, Math. Sci. Net.  
84. Algorithm AS 222: Resistant Smoothing Using the Fast Fourier Transform (in Statistical Algorithms)  
    W. Hardle  
    Applied Statistics, Vol. 36, No. 1. (1987), pp. 104-111, Jstor.  
85. The local approximation properties for trigonometric polynomials.    
    Zhou, Xin Long   
    J. Hangzhou Univ. Natur. Sci. Ed. 14 (1987), no. 4, 409--418, Math. Sci. Net.  
86. Approximation properties of some trigonometric polynomials.   
    Taberski, Roman    
    Funct. Approx. Comment. Math. 17 (1987), 83--95, Math. Sci. Net.  
87. Further symmetries of in-place FFTs.
    Briggs, William L.
    SIAM J. Sci. Statist. Comput. 8 (1987), no. 4, 644--654, Math. Sci. Net.  
88. Computer Graphics for the Vibrating String  
    Howard Lewis Penn  
    College Math Journal: 1986, Volume 17, Number 1, Pages: 79-89.  
89. Remark ASR 64: A Remark on Algorithm AS 176: Kernel Density Estimation Using The Fast Fourier Transform (in Statistical Algorithms)  
    Paul Schiffelbein  
    Applied Statistics, Vol. 35, No. 2. (1986), pp. 235-236, Jstor.  
90. Application of Fourier series to curve fitting. (Spanish)  
    Soto Villaverde, Andrés; Cuesta Saínz de la Torre, Lylia E.
    Investigación Oper. 7 (1986), no. 3, 17--28, MathSciNet.  
91. The discrete Fourier transform, the FFT and the solution of differential equations. (Spanish)
    Mora E., Héctor M.
    Bol. Mat. 20 (1986), no. 2, 107--123, MathSciNet.  
92. Symmetric FFTs.
    Swarztrauber, Paul N.
    Math. Comp. 47 (1986), no. 175, 323--346, MathSciNet.  
93. Two- and three-dimensional FFTs on highly parallel computers.
    Brass, A.; Pawley, G. S.
    Parallel Comput. 3 (1986), no. 2, 167--184, MathSciNet.  
94. Implementation of "split-radix" FFT algorithms for complex, real, and real-symmetric data.
    Duhamel, Pierre
    IEEE Trans. Acoust. Speech Signal Process. 34 (1986), no. 2, 285--295, MathSciNet.  
95. A new FFT algorithm of radix 3, 6, and 12.
    Suzuki, Yoiti; Sone, Toshio; Kido, Ken'iti
    IEEE Trans. Acoust. Speech Signal Process. 34 (1986), no. 2, 380--383, MathSciNet.  
96. Optimal Designs for Trigonometric and Polynomial Regression Using Canonical Moments  
    Tai-Shing Lau, W. J. Studden  
    Annals of Statistics, Vol. 13, No. 1. (Mar., 1985), pp. 383-394, Jstor.  
97. Mathematical Considerations for the Problem of Fourier Transform Phase Retrieval from Magnitude  
    Jorge L. C. Sanz  
    SIAM Journal on Applied Mathematics, Vol. 45, No. 4. (Aug., 1985), pp. 651-664, Jstor.  
98. Remark AS R50: A Remark on Algorithm AS 176. Kernal Density Estimation Using the Fast Fourier Transform (in Statistical Algorithms)  
    M. C. Jones, H. W. Lotwick  
    Applied Statistics, Vol. 33, No. 1. (1984), pp. 120-122, Jstor.  
99. Improving the accuracy and error analysis in floating-point FFT computation.
    Honma, Hitoshi; Sagawa, Masahiko
    Electron. Comm. Japan 67 (1984), no. 11, 9--18, MathSciNet.  
100. Programming an efficient radix-four FFT algorithm.
     Allen, Gregory H.
     Signal Process. 6 (1984), no. 4, 325--329, MathSciNet.  
101. On the Degree of Approximation of a Class of Functions by Means of Fourier Series  
     S. M. Mazhar  
     Proceedings of the American Mathematical Society, Vol. 88, No. 2. (Jun., 1983), pp. 317-320, Jstor.  
102. Exact values of best one-sided approximations by trigonometric polynomials and splines. (Russian)    
     Totkov, G. A.    
     Mat. Zametki 33 (1983), no. 2, 215--226, 316, Math. Sci. Net.  
103. Algorithm AS 176: Kernel Density Estimation Using the Fast Fourier Transform (in Statistical Algorithms)  
     B. W. Silverman  
     Applied Statistics, Vol. 31, No. 1. (1982), pp. 93-99, Jstor.  
104. Fast Algorithm of Data Permutation in Discrete Fast Fourier Transform (in Statistical Algorithms)  
     Andrzej Francik, Janusz Koscielniak  
     Applied Statistics, Vol. 31, No. 3. (1982), pp. 327-330, Jstor.  
105. A new fast Fourier transform algorithm. (Chinese)
     Kaporin, I. E. Translated from the Russian by Zhong Hui Shen.
     Yingyong Shuxue yu Jisuan Shuxue 1982, no. 6, 49--51, 26.
106. Vectorizing the FFTs.
     Swarztrauber, Paul N.
     Parallel computations, 51--83, Comput. Tech., 1, Academic Press, Orlando, FL, 1982, Math. Sci. Net.  
107. A Vector Implementation of the Fast Fourier Transform Algorithm  
     Bengt Fornberg  
     Mathematics of Computation, Vol. 36, No. 153. (Jan., 1981), pp. 189-191, Jstor.  
108. Computing the Fast Fourier Transform on a Vector Computer  
     David G. Korn, Jules J. Lambiotte, Jr.  
     Mathematics of Computation, Vol. 33, No. 147. (Jul., 1979), pp. 977-992, Jstor.  
109. Least Squares Fourier Series Solutions to Boundary Value Problems  
     Robert B. Kelman  
     SIAM Review, Vol. 21, No. 3. (Jul., 1979), pp. 329-338, Jstor.  
110. Basic Fourier Series  
     H. Exton  
     Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, Vol. 369, No. 1736. (Dec. 13, 1979), pp. 115-136, Jstor.  
111. Fast Fourier Methods in Computational Complex Analysis  
     Peter Henrici  
     SIAM Review, Vol. 21, No. 4. (Oct., 1979), pp. 481-527, Jstor.  
112. On the Degree of Approximation of a Function by the Partial Sums of its Fourier Series  
     Elaine Cohen  
     Transactions of the American Mathematical Society, Vol. 235. (Jan., 1978), pp. 35-74, Jstor.  
113. On Computing the Discrete Fourier Transform  
     S. Winograd  
     Mathematics of Computation, Vol. 32, No. 141. (Jan., 1978), pp. 175-199, Jstor.
114. The Fast Fourier Transform Spectral Estimator (in Notes, Comments and Queries)  
     Piet De Jong  
     Journal of the Royal Statistical Society. Series B (Methodological), Vol. 39, No. 3. (1977), pp. 327-330, Jstor.
115. A Table of Discrete Fourier Transform Pairs  
     Brian Conolly, I. J. Good  
     SIAM Journal on Applied Mathematics, Vol. 32, No. 4. (Jun., 1977), pp. 810-822, Jstor.
116. On Computing the Discrete Fourier Transform  
     Shmuel Winograd  
     Proceedings of the National Academy of Sciences of the United States of America, Vol. 73, No. 4. (Apr., 1976), pp. 1005-1006, Jstor.
117. Algorithm AS 97: Real Discrete Fast Fourier Transform (in Statistical Algorithms)  
     Donald M. Monro  
     Applied Statistics, Vol. 25, No. 2. (1976), pp. 166-172, Jstor.
118. Algorithm AS 83: Complex Discrete Fast Fourier Transform (in Statistical Algorithms)  
     Donald M. Monro  
     Applied Statistics, Vol. 24, No. 1. (1975), pp. 153-160, Jstor.
119. Sequential least-squares Fourier estimation with fading memory.  
     Taylor, Fred J.  
     IEEE Trans. Acoust. Speech Signal Processing ASSP-22 (1974), no. 4, 300--303, MathSciNet.  
120. Roundoff Error Analysis of the Fast Fourier Transform  
     George U. Ramos  
     Mathematics of Computation, Vol. 25, No. 116. (Oct., 1971), pp. 757-768, Jstor.  
121. The Fast Fourier Transform in a Finite Field  
     J. M. Pollard  
     Mathematics of Computation, Vol. 25, No. 114. (Apr., 1971), pp. 365-374, Jstor.  
122. Trigonometric Interpolation and Curve-Fitting  
     A. C. R. Newbery  
     Mathematics of Computation, Vol. 24, No. 112. (Oct., 1970), pp. 869-876, Jstor.  
123. Trigonometric interpolation and curve-fitting.    
     Newbery, A. C. R.    
     Math. Comp. 24 1970 869--876, Math. Sci. Net.  
124. A Fast Fourier Transform Algorithm Using Base 8 Iterations  
     G. D. Bergland  
     Mathematics of Computation, Vol. 22, No. 102. (Apr., 1968), pp. 275-279, Jstor.  
125. Application of Fourier Series to Summation of Series.  
     Edstrom,Clarence R.  
     Mathematics Magazine 40 (1967) 214-216.
126. The Fast Fourier Transform Recursive Equations for Arbitrary Length Records (in Technical Notes and Short Papers)  
     G. D. Bergland  
     Mathematics of Computation, Vol. 21, No. 98. (Apr., 1967), pp. 236-238, Jstor.  
127. Curve fitting to unequally-spaced data: Polynomial and trigonometric approximation.    
     Oliveira-Pinto, F.    
     Inst. Gulbenkian Ci. Centro Cálc. Ci. Estud. Program. Anál. Numér. No. 2 1967 47--59, Math. Sci. Net.  
128. Interpolation by Algebraic and Trigonometric Polynomials (in Technical Notes and Short Papers)  
     A. C. R. Newbery  
     Mathematics of Computation, Vol. 20, No. 96. (Oct., 1966), pp. 597-599, Jstor.  
129. Note on Invariance of Degree of Polynomial and Trigonometric Approximation under Change of Independent Variable  
     J. L. Walsh  
     Proceedings of the National Academy of Sciences of the United States of America, Vol. 45, No. 10. (Oct. 15, 1959), pp. 1528-1533, Jstor.  
130. Analogue Calculation of Polynomial and Trigonometric Expansions (in Other Aids to Computation)  
     Max G. Scherberg, John F. Riordan  
     Mathematical Tables and Other Aids to Computation, Vol. 7, No. 41. (Jan., 1953), pp. 61-65, Jstor.  
131. Infinite Series and Taylor and Fourier Expansions.  
     James, Robert C.
     Mathematics Magazine 25 (1952) 269-272;26 (1952) 21-31.  
132. Certain Expressions Related to Fourier Series.  
     Dobbie, J. M.  
     Mathematics Magazine 17 (1943) 285-291.  
133. Some Introductory Exercises in the Manipulation of Fourier Transforms.  
     Cameron, Robert H.  
     Mathematics Magazine 15 (1941) 331-356.  
134. On the Convergence of Certain Trigonometric and Polynomial Approximations  
     Dunham Jackson  
     Transactions of the American Mathematical Society, Vol. 22, No. 2. (Apr., 1921), pp. 158-166, Jstor.  
135. On Approximation by Trigonometric Sums and Polynomials  
     Dunham Jackson  
     Transactions of the American Mathematical Society, Vol. 13, No. 4. (Oct., 1912), pp. 491-515, Jstor.  

(c) John H. Mathews 2003