About the Project

Fourier integrals

AdvancedHelp

(0.003 seconds)

31—40 of 49 matching pages

31: 22.11 Fourier and Hyperbolic Series
22.11.13 sn 2 ( z , k ) = 1 k 2 ( 1 E K ) 2 π 2 k 2 K 2 n = 1 n q n 1 q 2 n cos ( 2 n ζ ) .
32: 29.6 Fourier Series
33: 22.20 Methods of Computation
This formula for dn becomes unstable near x = K . If only the value of dn ( x , k ) at x = K is required then the exact value is in the table 22.5.1. … If k , k are given with k 2 + k 2 = 1 and k / k < 0 , then K , K can be found from … am ( x , k ) can be computed from its definition (22.16.1) or from its Fourier series (22.16.9). … Jacobi’s epsilon function can be computed from its representation (22.16.30) in terms of theta functions and complete elliptic integrals; compare §20.14. …
34: 1.18 Linear Second Order Differential Operators and Eigenfunction Expansions
where the integral kernel is given by … This may be compared to (1.17.21), the resulting Fourier, or eigenfunction, expansion … … The Fourier cosine and sine transform pairs (1.14.9) & (1.14.11) and (1.14.10) & (1.14.12) can be easily obtained from (1.18.57) as for ν = ± 1 2 the Bessel functions reduce to the trigonometric functions, see (10.16.1). … For f ( x ) even in x this yields the Fourier cosine transform pair (1.14.9) & (1.14.11), and for f ( x ) odd the Fourier sine transform pair (1.14.10) & (1.14.12). …
35: Guide to Searching the DLMF
Table 1: Query Examples
Query Matching records contain
"Fourier transform" and series both the phrase “Fourier transform” and the word “series”.
Fourier or series at least one of the words “Fourier” or “series”.
Fourier (transform or series) at least one of “Fourier transform” or “Fourier series”.
1/(2pi) and "Fourier transform" both 1 / ( 2 π ) and the phrase “Fourier transform”.
int_$^$ sin any definite integral of sin
36: 28.11 Expansions in Series of Mathieu Functions
28.11.3 1 = 2 n = 0 A 0 2 n ( q ) ce 2 n ( z , q ) ,
28.11.4 cos 2 m z = n = 0 A 2 m 2 n ( q ) ce 2 n ( z , q ) , m 0 ,
28.11.5 cos ( 2 m + 1 ) z = n = 0 A 2 m + 1 2 n + 1 ( q ) ce 2 n + 1 ( z , q ) ,
28.11.6 sin ( 2 m + 1 ) z = n = 0 B 2 m + 1 2 n + 1 ( q ) se 2 n + 1 ( z , q ) ,
28.11.7 sin ( 2 m + 2 ) z = n = 0 B 2 m + 2 2 n + 2 ( q ) se 2 n + 2 ( z , q ) .
37: Bibliography Z
  • R. Zanovello (1978) Su un integrale definito del prodotto di due funzioni di Struve. Atti Accad. Sci. Torino Cl. Sci. Fis. Mat. Natur. 112 (1-2), pp. 63–81 (Italian).
  • Ya. M. Zhileĭkin and A. B. Kukarkin (1995) A fast Fourier-Bessel transform algorithm. Zh. Vychisl. Mat. i Mat. Fiz. 35 (7), pp. 1128–1133 (Russian).
  • D. G. Zill and B. C. Carlson (1970) Symmetric elliptic integrals of the third kind. Math. Comp. 24 (109), pp. 199–214.
  • 38: Bibliography G
  • W. Gautschi (1973) Algorithm 471: Exponential integrals. Comm. ACM 16 (12), pp. 761–763.
  • M. Geller and E. W. Ng (1969) A table of integrals of the exponential integral. J. Res. Nat. Bur. Standards Sect. B 73B, pp. 191–210.
  • M. L. Glasser (1976) Definite integrals of the complete elliptic integral K . J. Res. Nat. Bur. Standards Sect. B 80B (2), pp. 313–323.
  • M. L. Glasser (1979) A method for evaluating certain Bessel integrals. Z. Angew. Math. Phys. 30 (4), pp. 722–723.
  • W. Groenevelt (2007) Fourier transforms related to a root system of rank 1. Transform. Groups 12 (1), pp. 77–116.
  • 39: Bibliography L
  • A. M. Legendre (1825) Traité des fonctions elliptiques et des intégrales Eulériennes. Huzard-Courcier, Paris.
  • M. J. Lighthill (1958) An Introduction to Fourier Analysis and Generalised Functions. Cambridge Monographs on Mechanics and Applied Mathematics, Cambridge University Press, New York.
  • Y. L. Luke (1968) Approximations for elliptic integrals. Math. Comp. 22 (103), pp. 627–634.
  • Y. L. Luke (1970) Further approximations for elliptic integrals. Math. Comp. 24 (109), pp. 191–198.
  • J. N. Lyness (1971) Adjusted forms of the Fourier coefficient asymptotic expansion and applications in numerical quadrature. Math. Comp. 25 (113), pp. 87–104.
  • 40: 3.11 Approximation Techniques
    In fact, (3.11.11) is the Fourier-series expansion of f ( cos θ ) ; compare (3.11.6) and §1.8(i). …
    Example. The Discrete Fourier Transform
    is called a discrete Fourier transform pair.
    The Fast Fourier Transform
    The direct computation of the discrete Fourier transform (3.11.38), that is, of …