About the Project

series

AdvancedHelp

(0.001 seconds)

21—30 of 271 matching pages

21: 27.4 Euler Products and Dirichlet Series
§27.4 Euler Products and Dirichlet Series
if the series on the left is absolutely convergent. … Euler products are used to find series that generate many functions of multiplicative number theory. … The Riemann zeta function is the prototype of series of the form …called Dirichlet series with coefficients f ( n ) . …
22: 1.8 Fourier Series
§1.8 Fourier Series
Uniqueness of Fourier Series
§1.8(ii) Convergence
23: 28.19 Expansions in Series of me ν + 2 n Functions
§28.19 Expansions in Series of me ν + 2 n Functions
The series (28.19.2) converges absolutely and uniformly on compact subsets within S . …
24: 28.30 Expansions in Series of Eigenfunctions
§28.30 Expansions in Series of Eigenfunctions
Then every continuous 2 π -periodic function f ( x ) whose second derivative is square-integrable over the interval [ 0 , 2 π ] can be expanded in a uniformly and absolutely convergent series
25: 5.7 Series Expansions
§5.7 Series Expansions
§5.7(i) Maclaurin and Taylor Series
For 15D numerical values of c k see Abramowitz and Stegun (1964, p. 256), and for 31D values see Wrench (1968). … For 20D numerical values of the coefficients of the Maclaurin series for Γ ( z + 3 ) see Luke (1969b, p. 299).
§5.7(ii) Other Series
26: 8.7 Series Expansions
§8.7 Series Expansions
8.7.6 Γ ( a , x ) = x a e x n = 0 L n ( a ) ( x ) n + 1 , x > 0 , a < 1 2 .
For an expansion for γ ( a , i x ) in series of Bessel functions J n ( x ) that converges rapidly when a > 0 and x ( 0 ) is small or moderate in magnitude see Barakat (1961).
27: 22.10 Maclaurin Series
§22.10 Maclaurin Series
§22.10(i) Maclaurin Series in z
§22.10(ii) Maclaurin Series in k and k
28: 9.19 Approximations
§9.19(ii) Expansions in Chebyshev Series
The constants a and b are chosen numerically, with a view to equalizing the effort required for summing the series. …
  • Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of Ai ( z ) , Ai ( z ) stored at the nodes. Ai ( z ) and Ai ( z ) are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of Ai ( z ) , Ai ( z ) at the node. Similarly for Bi ( z ) , Bi ( z ) .

  • MacLeod (1994) supplies Chebyshev-series expansions to cover Gi ( x ) for 0 x < and Hi ( x ) for < x 0 . The Chebyshev coefficients are given to 20D.

  • 29: 16.25 Methods of Computation
    Methods for computing the functions of the present chapter include power series, asymptotic expansions, integral representations, differential equations, and recurrence relations. …
    30: 31.11 Expansions in Series of Hypergeometric Functions
    §31.11 Expansions in Series of Hypergeometric Functions
    Such series diverge for Fuchs–Frobenius solutions. …Every Heun function can be represented by a series of Type II.
    §31.11(v) Doubly-Infinite Series