Bibliography for Fourier Series and Transform

unabridged

 

  1. The Hardy--Littlewood Theorem for Fourier--Haar Series
    Aubakirov T.U.; Nursultanov E.D.
    Mathematical Notes, March 2003, vol. 73, no. 3-4, pp. 314-320(7), Ingenta.  
  2. Affine invariant descriptors for color images using Fourier series
    El Oirrak A.; Daoudi M.; Aboutajdine D.
    Pattern Recognition Letters, June 2003, vol. 24, no. 9, pp. 1339-1348(10), Ingenta.  
  3. Convergence for Fourier series solutions of the forced harmonic oscillator II
    Fay T. H.
    International Journal of Mathematical Education in Science and Technology, 1 May 2002, vol. 33, no. 3, pp. 349-358(10), Ingenta.  
  4. 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.  
  5. EPR entangled states and complex fractional Fourier transformation.  
    Fan, Hong-yi; Fan, Yue
    Eur. Phys. J. D At. Mol. Opt. Phys.  21  (2002),  no. 2, 233--238, MathSciNet.  
  6. On the Convergence of Fourier Series with Orthogonal Polynomials inside and on the Closure of a Region
    Abdullaev F.G.; Küçükaslan M.
    Ukrainian Mathematical Journal, October 2002, vol. 54, no. 10, pp. 1567-1582(16), Ingenta.  
  7. On the Rate of Convergence of Fourier Series of Functions of Bounded Variation
    Telyakovskii S.A.
    Mathematical Notes, November 2002, vol. 72, no. 5-6, pp. 872-876(5), Ingenta.  
  8. Uniform Convergence of Fourier--Jacobi Series
    Kvernadze G.
    Journal of Approximation Theory, August 2002, vol. 117, no. 2, pp. 207-228(22), Ingenta.  
  9. Refined Formulas for Determination of the Inverse Laplace Transform Using Fourier Series and their Use in Problems of Heat Conduction
    Maksimovich V.N.; Solyar T.Y.
    Journal of Engineering Physics and Thermophysics, May 2002, vol. 75, no. 3, pp. 648-650(3), Ingenta.  
  10. Regularization of a Fourier series method for the Laplace transform inversion with real data
    D'Amore L.; Murli A.
    Inverse Problems, 2002, vol. 18, no. 4, pp. 1185-1205(21), Ingenta.  
  11. A Fourier Series Method For The Vibrations Of Elastically Restrained Plates Arbitrarily Loaded With Springs And Masses
    Li W.L.; Daniels M.
    Journal of Sound and Vibration, May 2002, vol. 252, no. 4, pp. 768-781(14), Ingenta.  
  12. Some Expansions in Basic Fourier Series and Related Topics
    Suslov S.K.
    Journal of Approximation Theory, April 2002, vol. 115, no. 2, pp. 289-353(65), Ingenta.  
  13. On the order of magnitude of the uniform convergence of multiple trigonometric Fourier series with respect to cubes on the function classes  Hl  
    Ilyasov N.A.
    Analysis Mathematica, March 2002, vol. 28, no. 1, pp. 25-42(18), Ingenta.  
  14. An efficient direct BEM numerical scheme for phase change problems using Fourier series
    Ibanez M.T.; Power H.
    Computer Methods in Applied Mechanics and Engineering, 15 March 2002, vol. 191, no. 21, pp. 2371-2402(32), Ingenta.  
  15. 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.  
  16. 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.  
  17. 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.  
  18. 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.
  19. 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.
  20. 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.  
  21. 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.  
  22. Worst and average case roundoff error analysis for FFT.
    Tasche, Manfred; Zeuner, Hansmartin
    BIT 41 (2001), no. 3, 563--581, Math. Sci. Net.  
  23. Gibbs-Phenomenon-Free Fourier Series for Vibration and Stability of Complex Beams
    Fan S. C.; Zheng D. Y.; Au F. T. K.
    AIAA Journal, 1 October 2001, vol. 39, no. 10, pp. 1977-1984(8), Ingenta.  
  24. Approximation by Partial Sums of Fourier Series and the Best Approximation of Certain Function Classes
    Shvetsova A.M.
    Analysis Mathematica, 2001, vol. 27, no. 3, pp. 201-222(22), Ingenta.  
  25. On an application of a generalization of the discrete Fourier transform to short time series
    Grindlay J.
    Canadian Journal of Physics, May 2001, vol. 79, no. 5, pp. 857-868(12), Ingenta.  
  26. Vibration Of Beams With Generally Restrained Boundary Conditions Using Fourier Series
    Kim H.K.; Kim M.S.
    Journal of Sound and Vibration, August 2001, vol. 245, no. 5, pp. 771-784(14), Ingenta.  
  27. Fourier series method for plane elastic problems of polygonal domain
    Deng J.-G.; Cheng F.-P.
    Computer Methods in Applied Mechanics and Engineering, 8 June 2001, vol. 190, no. 35, pp. 4569-4585(17), Ingenta.  
  28. On summability theory and method of Fourier series
    He J.
    Applied Mathematics and Computation, 25 January 2001, vol. 117, no. 2, pp. 151-159(9), Ingenta.  
  29. 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.  
  30. 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.  
  31. 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.  
  32. Applications of Fourier Series in Classical Guitar Technique  
    James Hughes  
    College Math Journal: 2000, Volume 31, Number 4, Pages: 300-303, Jstor.  
  33. Convergence for Fourier series solutions of the forced harmonic oscillator
    Fay T. H.
    International Journal of Mathematical Education in Science and Technology, 1 May 2000, vol. 31, no. 3, pp. 415-423(9), Ingenta.  
  34. 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.  
  35. Necessary Conditions for the Convergence of Fourier Series
    Waterman D.
    Analysis Mathematica, 2000, vol. 26, no. 3, pp. 235-239(5), Ingenta.  
  36. Application of Double Fourier Series to the Shallow-Water Equations on a Sphere
    Cheong H-B.
    Journal of Computational Physics, November 2000, vol. 165, no. 1, pp. 261-287(27), Ingenta.  
  37. An efficient direct BEM numerical scheme for heat transfer problems using Fourier series
    Ibez M.T.; Power H.
    International Journal of Numerical Methods for Heat & Fluid Flow, 1 July 2000, vol. 10, no. 7, pp. 687-720(34), Ingenta.  
  38. Absolute Nevanlinna Summability and Fourier Series
    Dikshit G.D.
    Journal of Mathematical Analysis and Applications, August 2000, vol. 248, no. 2, pp. 482-508(27), Ingenta.  
  39. On ''drunken sinusoids'' and their Fourier series
    Czyz J.; Niescioruk D.
    Computer Physics Communications, April 2000, vol. 126, no. 1, pp. 51-56(6), Ingenta.  
  40. A spherical analogue of the complex form of the trigonometric Fourier series; approximation. (Russian)
    Terekhin, A. P.
    Mat. Zametki 67 (2000), no. 5, 764--777; translation in Math. Notes 67 (2000), no. 5-6, 646--656, MathSciNet.  
  41. 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.  
  42. 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.  
  43. 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.  
  44. Differentiability and Dimension of Some Fractal Fourier Series
    Chamizo F.; Córdoba A.
    Advances in Mathematics, March 1999, vol. 142, no. 2, pp. 335-354(20), Ingenta.  
  45. The future fast Fourier transform ?
    Edelman, Alan; McCorquodale, Peter; Toledo, Sivan
    SIAM J. Sci. Comput. 20 (1999), no. 3, 1094--1114 (electronic).
  46. A parallel fast Fourier transform.
    Morante, Silvia; Rossi, Giancarlo; Salina, Gaetano
    Internat. J. Modern Phys. C 10 (1999), no. 5, 781--805.
  47. 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.
  48. 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.
  49. On computing the 2-D FFT.
    Sevi'c, Dragutin
    IEEE Trans. Signal Process. 47 (1999), no.5, 1428--1431, Math. Sci. Net.  
  50. 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.  
  51. 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.  
  52. 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.  
  53. 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.  
  54. 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.  
  55. Application of Fourier series methods for studying tunnelling of electrons out of quantum wells in an electric field
    Panda S.; Panda B.K.; Fung S.
    Journal of Physics: Condensed Matter, 1999, vol. 11, no. 27, pp. 5293-5311(19), Ingenta.  
  56. 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.  
  57. On the piecewise trigonometric nonlinear regression models.    
    Albeanu, Grigore    
    Stud. Cerc. Mat. 50 (1998), no. 1-2, 1--4, Math. Sci. Net.  
  58. 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.
  59. 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.  
  60. 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.  
  61. On the analytical summation of Fourier series and its relation to the asymptotic behaviour of Fourier transforms
    Marshall S.L.
    Journal of Physics A: Mathematical and General, 1998, vol. 31, no. 49, pp. 9957-9973(17), Ingenta.  
  62. Determination of the Jumps of a Bounded Function by Its Fourier Series
    Lubinsky G.D.S.
    Journal of Approximation Theory, February 1998, vol. 92, no. 2, pp. 167-190(24), Ingenta.  
  63. Local Convergence of Fourier Series with Respect to Periodized Wavelets
    DeVore M.R.A.A.
    Journal of Approximation Theory, August 1998, vol. 94, no. 2, pp. 191-202(12), Ingenta.  
  64. Absolute Euler Summability of Fourier Series
    Thomson G.B.D.S.
    Journal of Mathematical Analysis and Applications, April 1998, vol. 220, no. 1, pp. 268-282(15), Ingenta.  
  65. 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.  
  66. A parallel algorithm for the fast Fourier transform. (Chinese)
    Fu, Dong Sheng
    Nanjing Daxue Xuebao Shuxue Bannian Kan 15 (1998), no. 2, 218--224.
  67. 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.  
  68. 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.  
  69. On the Absolute Convergence of Fourier Series
    Karchava T.
    Georgian Mathematical Journal, July 1997, vol. 04, no. 4, pp. 333-340(8), Ingenta.  
  70. 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.  
  71. On numerical methods for discrete least-squares approximation by trigonometric polynomials.    
    Fassbender, Heike    
    Math. Comp. 66 (1997), no. 218, 719--741, Math. Sci. Net.  
  72. 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.  
  73. 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.
  74. 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.  
  75. On the Measure of Approximation for Some Linear Means of Trigonometric Fourier Series
    Nessel A.R.
    Journal of Approximation Theory, February 1997, vol. 88, no. 2, pp. 193-208(16), Ingenta.  
  76. Similarities Between Fourier and Power Series  
    Richard Askey; Deborah Tepper Haimo  
    The American Mathematical Monthly, Vol. 103, No. 4. (Apr., 1996), pp. 297-304, Jstor.  
  77. Computed Tomography in Multivariable Calculus  
    Yves Nievergelt
    UMAP, Unit 753, pp. 1-54, (1996), COMAP, Inc. Lexington, MA,  COMAP   
  78. 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.  
  79. Accuracy of the discrete Fourier transform and the fast Fourier transform.
    Schatzman, James C.
    SIAM J. Sci. Comput. 17 (1996), no. 5, 1150--1166.
  80. Fast Fourier transform accelerated fast multipole algorithm.
    Elliott, William D.; Board, John A., Jr.
    SIAM J. Sci. Comput. 17 (1996), no. 2, 398--415.
  81. FFTs on mesh connected computers.
    Argüello, Francisco; Amor, Margarita; Zapata, Emilio L.
    Parallel Comput. 22 (1996), no. 1, 19--38, Math. Sci. Net.  
  82. A program for fourier series synthesis of induced polarization waveforms
    Duckworth K.; Brown R.J.
    Computers & Geosciences, December 1996, vol. 22, no. 10, pp. 1133-1136(4), Ingenta.  
  83. Quantum confined Stark shift in arbitrarily shaped single quantum wells by Fourier series method
    Panda S.; Panda B.K.; Fung S.; Beling C.D.
    Solid State Communications, July 1996, vol. 99, no. 4, pp. 299-303(5), Ingenta.  
  84. A convergence acceleration method of Fourier series
    Oleksy C.
    Computer Physics Communications, July 1996, vol. 96, no. 1, pp. 17-26(10), Ingenta.  
  85. Cosine Products, Fourier Transforms, and Random Sums  
    Kent E. Morrison  
    The American Mathematical Monthly, Vol. 102, No. 8. (Oct., 1995), pp. 716-724, Jstor.  
  86. Analytic Fourier-Feynman Transforms and Convolution  
    Timothy Huffman; Chull Park; David Skoug  
    Transactions of the American Mathematical Society, Vol. 347, No. 2. (Feb., 1995), pp. 661-673.
  87. 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.  
  88. 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.  
  89. An Application of Fourier Series to the Most Significant Digit Problem  
    Jeff Boyle  
    The American Mathematical Monthly, Vol. 101, No. 9. (Nov., 1994), pp. 879-886, Jstor.  
  90. Fourier Series of Polygons  
    Alain Robert  
    The American Mathematical Monthly, Vol. 101, No. 5. (May, 1994), pp. 420-428, Jstor.  
  91. Complex symmetric functions and generalized discrete Fourier transform.
    Rinaldi, Lucia; Ricci, Paolo Emilio
    Orthogonal polynomials on the unit circle: theory and applications (Madrid, 1994), 121--141, Univ. Carlos III Madrid, Leganés, 1994, MathSciNet.  
  92. 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.  
  93. 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.  
  94. On the strong approximation by trigonometric interpolating polynomials.    
    Nowakowski, Krzysztof; Taberski, Roman    
    Funct. Approx. Comment. Math. 22 (1993), 149--158 (1994), Math. Sci. Net.  
  95. Complex Vectors and Image Identification (in Computer Corner)  
    Lyndell Kerley; Jeff Knisley  
    The College Mathematics Journal, Vol. 24, No. 2. (Mar., 1993), pp. 166-174, Jstor.  
  96. 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.  
  97. 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.  
  98. Fourier Integral Representation of the Green Function for An Anisotropic Elastic Half-Space  
    Kevin P. Walker  
    Proceedings: Mathematical and Physical Sciences, Vol. 443, No. 1918. (Nov. 8, 1993), pp. 367-389, Jstor.  
  99. 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.  
  100. 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.  
  101. Parallel compact FFTs for real sequences.
    Pelz, Richard B.
    SIAM J. Sci. Comput. 14 (1993), no. 4, 914--935, Math. Sci. Net.  
  102. Superparallel FFTs.
    Munthe-Kaas, Hans
    SIAM J. Sci. Comput. 14 (1993), no. 2, 349--367, Math. Sci. Net.  
  103. The relationships among the discrete Fourier transform and real and complex Fourier series, and their applications. (Chinese)
    Zhu, Xun Sheng; Xue, Bin Yuan; Bei, Ji Yao
    J. Shanghai Jiaotong Univ. 27 (1993), no. 1, 41--49, MathSciNet.  
  104. Using Fourier Analysis in Digital Signal Processing (in Computer Corner)  
    Lyndell M. Kerley; William P. Dotson  
    The College Mathematics Journal, Vol. 23, No. 4. (Sep., 1992), pp. 320-328, Jstor.  
  105. Connections in Mathematical Analysis: The Case of Fourier Series  
    Enrique A. Gonzalez-Velasco  
    The American Mathematical Monthly, Vol. 99, No. 5. (May, 1992), pp. 427-441, Jstor.  
  106. 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.  
  107. 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.  
  108. 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.  
  109. 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.  
  110. Iterative Reconstruction in Computerized Tomography  
    Joanne Harris & Merzik Kamel   
    UMAP, Unit 713, pp. 1-22, (1991), COMAP, Inc. Lexington, MA,  COMAP   
  111. 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.  
  112. The Fractional Fourier Transform and Applications  
    David H. Bailey, Paul N. Swarztrauber  
    SIAM Review, Vol. 33, No. 3. (Sep., 1991), pp. 389-404, Jstor.  
  113. 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.  
  114. 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.  
  115. 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.  
  116. Transforms, Finite Fields, and Fast Multiplication (in Notes)  
    Patrick Chiu  
    Mathematics Magazine, Vol. 63, No. 5. (Dec., 1990), pp. 330-336, Jstor.  
  117. Curve Fitting by Polynomial-Trigonometric Regression  
    R. L. Eubank, Paul Speckman  
    Biometrika, Vol. 77, No. 1. (Mar., 1990), pp. 1-9, Jstor.  
  118. The FFT as a Multigrid Algorithm  
    William L. Briggs, Van Emden Henson  
    SIAM Review, Vol. 32, No. 2. (Jun., 1990), pp. 252-261, Jstor.  
  119. 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.  
  120. 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.  
  121. Curve fitting by polynomial-trigonometric regression.    
    Eubank, R. L.; Speckman Paul     
    Biometrika 77 (1990), no. 1, 1--9, Math. Sci. Net.  
  122. 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.  
  123. Fast Fourier transforms: a tutorial review and a state of the art.
    Duhamel, P.; Vetterli, M.
    Signal Process. 19 (1990), no. 4, 259--299.
  124. The FFT as a multigrid algorithm.
    Briggs, William L.; Henson, Van Emden
    SIAM Rev. 32 (1990), no. 2, 252--261, Math. Sci. Net.  
  125. 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.  
  126. 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.  
  127. The Bernoulli spline and approximation by trigonometric blending polynomials.    
    Jetter, Kurt    
    Results Math. 16 (1989), no. 3-4, 243--252, Math. Sci. Net.  
  128. Nesting strategies for prime factor FFT algorithms.
    Temperton, Clive
    J. Comput. Phys. 82 (1989), no. 2, 247--268, Math. Sci. Net.  
  129. Fourier-Laplace Transforms and the Bergman Spaces  
    Saburou Saitoh  
    Proceedings of the American Mathematical Society, Vol. 102, No. 4. (Apr., 1988), pp. 985-992, Jstor.  
  130. 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.  
  131. Gray codes, fast Fourier transforms and hypercubes.
    Chamberlain, R. M.
    Parallel Comput. 6 (1988), no. 2, 225--233.
  132. 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.  
  133. A segmented FFT algorithm for vector computers.
    Ashworth, Mike; Lyne, Andrew G.
    Parallel Comput. 6 (1988), no. 2, 217--224, Math. Sci. Net.  
  134. Implementation of a prime factor FFT algorithm on CRAY-1.
    Temperton, Clive
    ParallelComput. 6 (1988), no. 1, 99--108, Math. Sci. Net.  
  135. 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.  
  136. 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.  
  137. Approximation properties of some trigonometric polynomials.   
    Taberski, Roman    
    Funct. Approx. Comment. Math. 17 (1987), 83--95, Math. Sci. Net.  
  138. Further symmetries of in-place FFTs.
    Briggs, William L.
    SIAM J. Sci. Statist. Comput. 8 (1987), no. 4, 644--654, Math. Sci. Net.  
  139. Fourier transforms in the complex domain. Reprint of the 1934 original.
    Paley, Raymond E. A. C.; Wiener, Norbert
    American Mathematical Society Colloquium Publications, 19. American Mathematical Society, Providence, RI, 1987. x+184 pp. ISBN: 0-8218-1019-7 01A75, MathSciNet.  
  140. Absolute convergence of Fourier series of complex functions on Rn. (Chinese)
    Li, Yan Nian
    Hunan Shifan Daxue Ziran Kexue Xuebao 10 (1987), no. 3, 1--10, MathSciNet.  
  141. Computer Graphics for the Vibrating String (in Computer Corner)  
    Howard Lewis Penn  
    The College Mathematics Journal, Vol. 17, No. 1. (Jan., 1986), pp. 79-89, Jstor.  
  142. 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.  
  143. 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.  
  144. 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.  
  145. Exponential Fourier series for the H-function of several complex variables.
    Sharma, C. K.; Shukla, V. S.
    Pure Appl. Math. Sci. 24 (1986), no. 1-2, 35--39, MathSciNet.  
  146. Symmetric FFTs.
    Swarztrauber, Paul N.
    Math. Comp. 47 (1986), no. 175, 323--346, MathSciNet.  
  147. Two- and three-dimensional FFTs on highly parallel computers.
    Brass, A.; Pawley, G. S.
    Parallel Comput. 3 (1986), no. 2, 167--184, MathSciNet.  
  148. 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.  
  149. 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.  
  150. 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.  
  151. 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.  
  152. Structures symplectiques, structures complexes, spineurs symplectiques et transformation de Fourier. (French) [Symplectic structures, complex structures, symplectic spinors and the Fourier transform]
    Crumeyrolle, A.
    J. Geom. Phys. 2 (1985), no. 3, 107--134, MathSciNet.  
  153. 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.  
  154. 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.  
  155. Programming an efficient radix-four FFT algorithm.
    Allen, Gregory H.
    Signal Process. 6 (1984), no. 4, 325--329, MathSciNet.  
  156. The Fourier transformation of analytic functions.
    Dubinskii, Yu. A.
    The complex Fourier method. (Russian) Dokl. Akad. Nauk SSSR 275 (1984), no. 3, 533--536, MathSciNet.  
  157. Fourier and trigonometric transforms with complex coefficients regularly varying in mean.
    Stanojevic, Vera B.
    Fourier analysis (Orono, ME, 1992), 423--432, Lecture Notes in Pure and Appl. Math., 157, Dekker, New York, 1994, MathSciNet.  
  158. 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.  
  159. Some Comments on Fourier Analysis, Uncertainty and Modeling  
    David Slepian  
    SIAM Review, Vol. 25, No. 3. (Jul., 1983), pp. 379-393, Jstor.  
  160. 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.  
  161. 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.  
  162. 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.  
  163. L1-Convergence of Fourier Series with Complex Quasimonotone Coefficients  
    Vera B. Stanojevic  
    Proceedings of the American Mathematical Society, Vol. 86, No. 2. (Oct., 1982), pp. 241-247, Jstor.  
  164. Vectorizing the FFTs.
    Swarztrauber, Paul N.
    Parallel computations, 51--83, Comput. Tech., 1, Academic Press, Orlando, FL, 1982, Math. Sci. Net.  
  165. Calculation of complex Fourier coefficients using natural splines.
    Neuman, E.
    Computing 29 (1982), no. 4, 327--336, MathSciNet.  
  166. 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.
  167. An Alternative Approach to the Vibrating String Problem (in Classroom Capsules)  
    James Chew  
    The Two-Year College Mathematics Journal,Vol.12,No.2. (Mar.,1981),pp.147-149, Jstor.  
  168. A Vector Implementation of the Fast Fourier Transform Algorithm  
    Bengt Fornberg  
    Mathematics of Computation, Vol. 36, No. 153. (Jan., 1981), pp. 189-191, Jstor.  
  169. Pointwise Convergence of Fourier Series (in Classroom Notes)  
    Paul R. Chernoff  
    The American Mathematical Monthly, Vol. 87, No. 5. (May, 1980), pp. 399-400, Jstor.  
  170. Tomography: Three Dimensional Image Reconstruction  
    Solomon, Frederick  
    UMAP, Unit 318, pp. 1-19, (1979), COMAP, Inc. Lexington, MA,  COMAP   
  171. 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.  
  172. Least Squares Fourier Series Solutions to Boundary Value Problems  
    Robert B. Kelman  
    SIAM Review, Vol. 21, No. 3. (Jul., 1979), pp. 329-338, Jstor.  
  173. Fourier Series Came First  
    Salomon Bochner  
    The American Mathematical Monthly, Vol. 86, No. 3. (Mar., 1979), pp. 197-199, Jstor.  
  174. 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.  
  175. Fast Fourier Methods in Computational Complex Analysis  
    Peter Henrici  
    SIAM Review, Vol. 21, No. 4. (Oct., 1979), pp. 481-527, Jstor.  
  176. Medical Application of Fourier Analysis (in Classroom Notes in Applied Mathematics)  
    D. E. Raeside; W. K. Chu; P. A. N. Chandraratna  
    SIAM Review, Vol. 20, No. 4. (Oct., 1978), pp. 850-854, Jstor.  
  177. Fourier Series (in Progress Reports)  
    P. R. Halmos  
    The American Mathematical Monthly, Vol. 85, No. 1. (Jan., 1978), pp. 33-34, Jstor.  
  178. 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.  
  179. On Computing the Discrete Fourier Transform  
    S. Winograd  
    Mathematics of Computation, Vol. 32, No. 141. (Jan., 1978), pp. 175-199, Jstor.
  180. 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.
  181. 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.
  182. Fourier analysis and complex variable. (Spanish)
    Córdoba, Antonio
    Rev. Real Acad. Ci. Exact. Fís. Natur. Madrid 71 (1977), no. 3-4, 515--535, MathSciNet.  
  183. 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.
  184. 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.
  185. Fourier Series of Functions of Bounded Variation (in Classroom Notes)  
    C. Horowitz  
    The American Mathematical Monthly, Vol. 82, No. 4. (Apr., 1975), pp. 391-392, Jstor.
  186. 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.
  187. Fourier coefficients of Eisenstein series of one complex variable for the special linear group.
    Terras, A.
    Trans. Amer. Math. Soc. 205 (1975), 97--114, MathSciNet.  
  188. Fourier Uniqueness Via Complex Variables (in Mathematical Notes)  
    D. J. Newman  
    The American Mathematical Monthly, Vol. 81, No. 4. (Apr., 1974), pp. 379-380, Jstor.  
  189. On Fourier Transforms  
    C. Nasim  
    Transactions of the American Mathematical Society, Vol. 191. (Apr., 1974), pp. 45-51, Jstor.  
  190. 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.  
  191. Roundoff Error Analysis of the Fast Fourier Transform  
    George U. Ramos  
    Mathematics of Computation, Vol. 25, No. 116. (Oct., 1971), pp. 757-768, Jstor.  
  192. The Fast Fourier Transform in a Finite Field  
    J. M. Pollard  
    Mathematics of Computation, Vol. 25, No. 114. (Apr., 1971), pp. 365-374, Jstor.  
  193. Complex Fourier Analysis on a Nilpotent Lie Group  
    Roe Goodman  
    Transactions of the American Mathematical Society,Vol.160. (Oct.,1971),pp.373-391, Jstor.  
  194. Trigonometric Interpolation and Curve-Fitting  
    A. C. R. Newbery  
    Mathematics of Computation, Vol. 24, No. 112. (Oct., 1970), pp. 869-876, Jstor.  
  195. Some Aspects of Fourier Series  
    Casper Goffman; Daniel Waterman  
    The American Mathematical Monthly, Vol. 77, No. 2. (Feb., 1970), pp. 119-133, Jstor.  
  196. Uniform Convergence of Fourier Series (in Classroom Notes)  
    Barry Simon  
    The American Mathematical Monthly, Vol. 76, No. 1. (Jan., 1969), pp. 55-56, Jstor.  
  197. J. B. Fourier--On the Occasion of His Two Hundredth Birthday  
    W. A. Coppel  
    The American Mathematical Monthly, Vol. 76, No. 5. (May, 1969), pp. 468-483, Jstor.  
  198. A Note on Fourier Kernels (in Mathematical Notes)  
    Kusum Soni  
    The American Mathematical Monthly, Vol. 76, No. 2. (Feb., 1969), pp. 174-176, Jstor.  
  199. Modifications of Fourier Transforms  
    Walter Rudin  
    Proceedings of the American Mathematical Society, Vol. 19, No. 5. (Oct., 1968), pp. 1069-1074, Jstor.  
  200. A Note on Fourier Series of Functions of Z Class (in Brief Versions)  
    A. H. Siddiqi  
    The American Mathematical Monthly, Vol. 75, No. 2. (Feb., 1968), pp. 173-174, Jstor.  
  201. 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.  
  202. Application of Fourier Series to Summation of Series, I  
    Clarence R. Edstrom  
    Mathematics Magazine, Vol. 40, No. 4. (Sep., 1967), pp. 214-216, Jstor.  
  203. A Fourier Series Derivation of the Euler-Lagrange Equation (in Classroom Notes)  
    Richard Menzel  
    The American Mathematical Monthly, Vol. 74, No. 5. (May, 1967), pp. 587-588, Jstor.  
  204. Pascal-Type Triangles for the Fourier Expansions of 2^(n-1) cos^n x and 2^(n-1) sin^n x  
    Bernard Rasof  
    Mathematics Magazine, Vol. 40, No. 5. (Nov., 1967), pp. 235-240, Jstor.  
  205. 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.  
  206. 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.  
  207. 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.  
  208. An Algorithm for the Machine Calculation of Complex Fourier Series  
    James W. Cooley; John W. Tukey  
    Mathematics of Computation, Vol. 19, No. 90. (Apr., 1965), pp. 297-301, Jstor.  
  209. Fourier Transforms of Two Poisson Kernels (in Mathematical Notes)  
    D. A. Sprecher  
    The American Mathematical Monthly, Vol. 72, No. 8. (Oct., 1965), pp. 864-868, Jstor.  
  210. Fourier Transforms of Two Poisson Kernels (in Mathematical Notes)  
    D. A. Sprecher  
    The American Mathematical Monthly, Vol. 72, No. 8. (Oct., 1965), pp. 864-868, Jstor.  
  211. Inversion of Fourier and Laplace Transforms  
    R. P. Boas, Jr.  
    The American Mathematical Monthly, Vol. 69, No. 10. (Dec., 1962), pp. 955-960, Jstor.  
  212. A Property of the Fourier Coefficients of an Integrable Function  
    W. A. J. Luxemburg  
    The American Mathematical Monthly, Vol. 69, No. 2. (Feb., 1962), pp. 94-98, Jstor.  
  213. The Fourier Transform and Mean Convergence  
    E. J. McShane  
    The American Mathematical Monthly, Vol. 68, No. 3. (Mar., 1961), pp. 205-211, Jstor.  
  214. A Note on Walsh-Fourier Series (in Mathematical Notes)  
    T. H. Slook  
    The American Mathematical Monthly, Vol. 67, No. 3. (Mar., 1960), pp. 253-256, Jstor.  
  215. Developments of (sin x)^a into Fourier Series (in Mathematical Notes)  
    K. Matthies  
    The American Mathematical Monthly, Vol. 67, No. 1. (Jan., 1960), pp. 52-54, Jstor.  
  216. A Note on Walsh-Fourier Series (in Mathematical Notes)  
    T. H. Slook  
    The American Mathematical Monthly, Vol. 67, No. 3. (Mar., 1960), pp. 253-256, Jstor.  
  217. Concerning the Fourier Coefficients of a Nonnegative Function (in Mathematical Notes)  
    G. Szego  
    The American Mathematical Monthly, Vol. 67, No. 4. (Apr., 1960), pp. 365-366, Jstor.  
  218. 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.  
  219. An Inequality for the Fourier Coefficients of a Nonnegative Funtion (in Mathematical Notes)  
    J. D. Weston  
    The American Mathematical Monthly, Vol. 66, No. 3. (Mar., 1959), pp. 223-224, Jstor.  
  220. Bounded Functions and Fourier Transforms  
    R. E. Edwards  
    Proceedings of the American Mathematical Society, Vol. 9, No. 3. (Jun., 1958), pp. 440-446, Jstor.  
  221. Derivation of the Equation for a Vibrating String  
    F. A. Ficken  
    The American Mathematical Monthly, Vol. 64, No. 3. (Mar., 1957), pp. 155-157, Jstor.  
  222. From Fourier Series to Fourier Integral (in Classroom Notes)  
    Walter P. Reid  
    The American Mathematical Monthly, Vol. 64, No. 9. (Nov., 1957), pp. 663-664, Jstor.  
  223. Correction: Fourier analysis of engine unbalance by contour integration  
    W. E. Bleick  
    The American Mathematical Monthly, Vol. 64, No. 3. (Mar., 1957), p. 180, Jstor.  
  224. Fourier Analysis of Engine Unbalance by Contour Integration  
    W. E. Bleick  
    The American Mathematical Monthly, Vol. 63, No. 7. (Aug. - Sep., 1956), pp. 466-472, Jstor.  
  225. A Short Proof of a Classical Theorem in the Theory of Fourier Integrals (in Mathematical Notes)  
    Marcel Riesz; A. E. Livingston  
    The American Mathematical Monthly, Vol. 62, No. 6. (Jun. - Jul., 1955), pp. 434-437, Jstor.  
  226. The Order of Magnitude of the Fourier Coefficients in Functions Having Isolated Singularities  
    Gordon Raisbeck  
    The American Mathematical Monthly,Vol.62,No.3. (Mar.,1955),pp.149-154, Jstor.  
  227. On Functions Which are Fourier Transforms  
    R. E. Edwards  
    Proceedings of the American Mathematical Society, Vol. 5, No. 1. (Feb., 1954), pp. 71-78, Jstor.  
  228. 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.  
  229. Infinite Series and Taylor and Fourier Expansions (Concluded)  
    Robert C. James  
    Mathematics Magazine, Vol. 26, No. 1. (Sep. - Oct., 1952), pp. 21-31, Jstor.  
  230. Infinite Series and Taylor and Fourier Expansions  
    Robert C. James  
    Mathematics Magazine, Vol. 25, No. 5. (May - Jun., 1952), pp. 269-272, Jstor.  
  231. Sums Representing Fourier Transforms  
    R. P. Boas, Jr.  
    Proceedings of the American Mathematical Society, Vol. 3, No. 3. (Jun., 1952), pp. 444-447, Jstor.  
  232. The Finite Fourier Series and Elementary Geometry  
    I. J. Schoenberg  
    The American Mathematical Monthly, Vol. 57, No. 6. (Jun. - Jul., 1950), pp. 390-404, Jstor.  
  233. Differentiation of Fourier Series and Integrals  
    A. E. Taylor  
    The American Mathematical Monthly, Vol. 51, No. 1. (Jan., 1944), pp. 19-25, Jstor.  
  234. On My Proof of The Budan-Fourier Theorem (in Discussions and Notes)  
    M. F. Smiley  
    The American Mathematical Monthly, Vol. 51, No. 8. (Oct., 1944), p. 465, Jstor.  
  235. Certain Expressions Related to Fourier Series  
    J. M. Dobbie  
    National Mathematics Magazine, Vol. 17, No. 7. (Apr., 1943), pp. 285-291, Jstor.  
  236. Some Introductory Exercises in the Manipulation of Fourier Transforms  
    Robert H. Cameron  
    National Mathematics Magazine, Vol. 15, No. 7. (Apr., 1941), pp. 331-356, Jstor.  
  237. On Fourier Series of Continuous Functions (in Questions, Discussions and Notes)  
    Otto Szasz  
    The American Mathematical Monthly, Vol. 42, No. 1. (Jan., 1935), pp. 37-38, Jstor.  
  238. The Convergence of Fourier Series  
    Dunham Jackson  
    The American Mathematical Monthly, Vol. 41, No. 2. (Feb., 1934), pp. 67-84, Jstor.  
  239. A Remark on Fourier Series of Continuous Functions (in Questions, Discussions, and Notes)  
    William Randels  
    The American Mathematical Monthly, Vol. 40, No. 2. (Feb., 1933), pp. 97-99, Jstor.  
  240. The Summation of Certain Series by Fourier Expansions  
    Joseph B. Reynolds  
    The American Mathematical Monthly, Vol. 39, No. 8. (Oct., 1932), pp. 473-476, Jstor.  
  241. Fourier Series in Three Dimensions  
    W. O. Pennell  
    The American Mathematical Monthly, Vol. 39, No. 5. (May, 1932), pp. 261-266, Jstor.  
  242. Necessary and Sufficient Conditions in the Theory of Fourier Transforms  
    Andrew C. Berry  
    The Annals of Mathematics, 2nd Ser., Vol. 32, No. 4. (Sep., 1931), pp. 830-8385, Jstor.  
  243. A Generalized Fourier Series Representation of a Function  
    W. O. Pennell  
    The American Mathematical Monthly, Vol. 37, No. 9. (Nov., 1930), pp. 462-472, Jstor.  
  244. Discussions: An Application of Fourier Series and a Theorem on Definite Integrals (in Questions and Discussions)  
    E. J. McShane  
    The American Mathematical Monthly, Vol. 33, No. 8. (Oct., 1926), pp. 421-424, Jstor.  
  245. Discussions: Note on the Convergence of Fourier Series (in Questions and Discussions)  
    Dunham Jackson  
    The American Mathematical Monthly, Vol. 33, No. 1. (Jan., 1926), pp. 39-40, Jstor.  
  246. A Simple Discussion of the Representation of Functions by Fourier Series  
    Philip Franklin  
    The American Mathematical Monthly, Vol. 31, No. 10. (Dec., 1924), pp. 475-478, Jstor.  
  247. An Elementary Treatment of Fourier's Series  
    George D. Birkhoff  
    The American Mathematical Monthly, Vol. 28, No. 5. (May, 1921), pp. 200-203, Jstor.  
  248. 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.  
  249. A Simple Extension of Fourier's Integral Theorem and Some Physical Applications, in Particular to the Theory of Quanta  
    R. H. Fowler  
    Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character, Vol. 99, No. 701. (Sep. 1, 1921), pp. 462-471, Jstor.  
  250. 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.  

 

 Return to the Complex Analysis Project

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2003