About the Project

Fourier%20cosine%20and%20sine%20transforms

AdvancedHelp

(0.003 seconds)

11—20 of 353 matching pages

11: 23 Weierstrass Elliptic and Modular
Functions
12: 28.35 Tables
  • Ince (1932) includes eigenvalues a n , b n , and Fourier coefficients for n = 0 or 1 ( 1 ) 6 , q = 0 ( 1 ) 10 ( 2 ) 20 ( 4 ) 40 ; 7D. Also ce n ( x , q ) , se n ( x , q ) for q = 0 ( 1 ) 10 , x = 1 ( 1 ) 90 , corresponding to the eigenvalues in the tables; 5D. Notation: a n = 𝑏𝑒 n 2 q , b n = 𝑏𝑜 n 2 q .

  • Kirkpatrick (1960) contains tables of the modified functions Ce n ( x , q ) , Se n + 1 ( x , q ) for n = 0 ( 1 ) 5 , q = 1 ( 1 ) 20 , x = 0.1 ( .1 ) 1 ; 4D or 5D.

  • National Bureau of Standards (1967) includes the eigenvalues a n ( q ) , b n ( q ) for n = 0 ( 1 ) 3 with q = 0 ( .2 ) 20 ( .5 ) 37 ( 1 ) 100 , and n = 4 ( 1 ) 15 with q = 0 ( 2 ) 100 ; Fourier coefficients for ce n ( x , q ) and se n ( x , q ) for n = 0 ( 1 ) 15 , n = 1 ( 1 ) 15 , respectively, and various values of q in the interval [ 0 , 100 ] ; joining factors g e , n ( q ) , f e , n ( q ) for n = 0 ( 1 ) 15 with q = 0 ( .5  to  10 ) 100 (but in a different notation). Also, eigenvalues for large values of q . Precision is generally 8D.

  • Zhang and Jin (1996, pp. 521–532) includes the eigenvalues a n ( q ) , b n + 1 ( q ) for n = 0 ( 1 ) 4 , q = 0 ( 1 ) 50 ; n = 0 ( 1 ) 20 ( a ’s) or 19 ( b ’s), q = 1 , 3 , 5 , 10 , 15 , 25 , 50 ( 50 ) 200 . Fourier coefficients for ce n ( x , 10 ) , se n + 1 ( x , 10 ) , n = 0 ( 1 ) 7 . Mathieu functions ce n ( x , 10 ) , se n + 1 ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , x = 0 ( 5 ) 90 . Modified Mathieu functions Mc n ( j ) ( x , 10 ) , Ms n + 1 ( j ) ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , j = 1 , 2 , x = 0 ( .2 ) 4 . Precision is mostly 9S.

  • 13: Bibliography F
  • J. Faraut (1982) Un théorème de Paley-Wiener pour la transformation de Fourier sur un espace riemannien symétrique de rang un. J. Funct. Anal. 49 (2), pp. 230–268.
  • FDLIBM (free C library)
  • S. Fempl (1960) Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).
  • H. E. Fettis and J. C. Caslin (1964) Tables of Elliptic Integrals of the First, Second, and Third Kind. Technical report Technical Report ARL 64-232, Aerospace Research Laboratories, Wright-Patterson Air Force Base, Ohio.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • 14: 36 Integrals with Coalescing Saddles
    15: Gergő Nemes
    As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …
    16: Wolter Groenevelt
    As of September 20, 2022, Groenevelt performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 18 Orthogonal Polynomials. …
    17: 33.24 Tables
  • Abramowitz and Stegun (1964, Chapter 14) tabulates F 0 ( η , ρ ) , G 0 ( η , ρ ) , F 0 ( η , ρ ) , and G 0 ( η , ρ ) for η = 0.5 ( .5 ) 20 and ρ = 1 ( 1 ) 20 , 5S; C 0 ( η ) for η = 0 ( .05 ) 3 , 6S.

  • 18: Bibliography S
  • K. L. Sala (1989) Transformations of the Jacobian amplitude function and its calculation via the arithmetic-geometric mean. SIAM J. Math. Anal. 20 (6), pp. 1514–1528.
  • A. Sharples (1967) Uniform asymptotic forms of modified Mathieu functions. Quart. J. Mech. Appl. Math. 20 (3), pp. 365–380.
  • J. R. Stembridge (1995) A Maple package for symmetric functions. J. Symbolic Comput. 20 (5-6), pp. 755–768.
  • F. Stenger (1993) Numerical Methods Based on Sinc and Analytic Functions. Springer Series in Computational Mathematics, Vol. 20, Springer-Verlag, New York.
  • R. S. Strichartz (1994) A Guide to Distribution Theory and Fourier Transforms. Studies in Advanced Mathematics, CRC Press, Boca Raton, FL.
  • 19: 15.17 Mathematical Applications
    Harmonic analysis can be developed for the Jacobi transform either as a generalization of the Fourier-cosine transform1.14(ii)) or as a specialization of a group Fourier transform. …
    20: 27.15 Chinese Remainder Theorem
    Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …