About the Project

.世界杯赌挣钱吗盘_『wn4.com_』澳门赛的抽签出来了吗_w2n3c1o_2022年12月10日16时43分54秒_eeyyrupg4_gov_hk

AdvancedHelp

(0.006 seconds)

11—20 of 805 matching pages

11: 23.9 Laurent and Other Power Series
Let z 0 ( 0 ) be the nearest lattice point to the origin, and define …Explicit coefficients c n in terms of c 2 and c 3 are given up to c 19 in Abramowitz and Stegun (1964, p. 636). For j = 1 , 2 , 3 , and with e j as in §23.3(i), … where a 0 , 0 = 1 , a m , n = 0 if either m or n < 0 , and …For a m , n with m = 0 , 1 , , 12 and n = 0 , 1 , , 8 , see Abramowitz and Stegun (1964, p. 637).
12: 32.3 Graphics
Plots of solutions w k ( x ) of P I  with w k ( 0 ) = 0 and w k ( 0 ) = k for various values of k , and the parabola 6 w 2 + x = 0 . …
See accompanying text
Figure 32.3.3: w k ( x ) for 12 x 0.73 and k = 1.85185 3 , 1.85185 5 . … Magnify
Here w k ( x ) is the solution of P II  with α = 0 and such that … Here u = u k ( x ; ν ) is the solution of …The corresponding solution of P IV  is given by …
13: 3.9 Acceleration of Convergence
A transformation of a convergent sequence { s n } with limit σ into a sequence { t n } is called limit-preserving if { t n } converges to the same limit σ . … Then the transformation of the sequence { s n } into a sequence { t n , 2 k } is given by … Then t n , 2 k = ε 2 k ( n ) . … with s = 1 12 π 2 = 0.82246 70334 24 . … We give a special form of Levin’s transformation in which the sequence s = { s n } of partial sums s n = j = 0 n a j is transformed into: …
14: 11.14 Tables
  • Abramowitz and Stegun (1964, Chapter 12) tabulates 𝐇 n ( x ) , 𝐇 n ( x ) Y n ( x ) , and I n ( x ) 𝐋 n ( x ) for n = 0 , 1 and x = 0 ( .1 ) 5 , x 1 = 0 ( .01 ) 0.2 to 6D or 7D.

  • Barrett (1964) tabulates 𝐋 n ( x ) for n = 0 , 1 and x = 0.2 ( .005 ) 4 ( .05 ) 10 ( .1 ) 19.2 to 5 or 6S, x = 6 ( .25 ) 59.5 ( .5 ) 100 to 2S.

  • Abramowitz and Stegun (1964, Chapter 12) tabulates 0 x ( I 0 ( t ) 𝐋 0 ( t ) ) d t and ( 2 / π ) x t 1 𝐇 0 ( t ) d t for x = 0 ( .1 ) 5 to 5D or 7D; 0 x ( 𝐇 0 ( t ) Y 0 ( t ) ) d t ( 2 / π ) ln x , 0 x ( I 0 ( t ) 𝐋 0 ( t ) ) d t ( 2 / π ) ln x , and x t 1 ( 𝐇 0 ( t ) Y 0 ( t ) ) d t for x 1 = 0 ( .01 ) 0.2 to 6D.

  • Bernard and Ishimaru (1962) tabulates 𝐉 ν ( x ) and 𝐄 ν ( x ) for ν = 10 ( .1 ) 10 and x = 0 ( .1 ) 10 to 5D.

  • Agrest and Maksimov (1971, Chapter 11) defines incomplete Struve, Anger, and Weber functions and includes tables of an incomplete Struve function 𝐇 n ( x , α ) for n = 0 , 1 , x = 0 ( .2 ) 10 , and α = 0 ( .2 ) 1.4 , 1 2 π , together with surface plots.

  • 15: 24.2 Definitions and Generating Functions
    B 2 n + 1 = 0 ,
    24.2.4 B n = B n ( 0 ) ,
    Table 24.2.4: Euler numbers E n .
    n E n
    Table 24.2.5: Coefficients b n , k of the Bernoulli polynomials B n ( x ) = k = 0 n b n , k x k .
    k
    Table 24.2.6: Coefficients e n , k of the Euler polynomials E n ( x ) = k = 0 n e n , k x k .
    k
    16: 27.2 Functions
    where p 1 , p 2 , , p ν ( n ) are the distinct prime factors of n , each exponent a r is positive, and ν ( n ) is the number of distinct primes dividing n . … Note that σ 0 ( n ) = d ( n ) . …Note that J 1 ( n ) = ϕ ( n ) . In the following examples, a 1 , , a ν ( n ) are the exponents in the factorization of n in (27.2.1). … Table 27.2.1 lists the first 100 prime numbers p n . …
    17: 1.3 Determinants, Linear Operators, and Spectral Expansions
    The cofactor A j k of a j k is … For real-valued a j k , … where ω 1 , ω 2 , , ω n are the n th roots of unity (1.11.21). … If 𝐷 n [ a j , k ] tends to a limit L as n , then we say that the infinite determinant 𝐷 [ a j , k ] converges and 𝐷 [ a j , k ] = L . … The corresponding eigenvectors 𝐚 1 , , 𝐚 n can be chosen such that they form a complete orthonormal basis in 𝐄 n . …
    18: 3.2 Linear Algebra
    where u j = c j , j = 1 , 2 , , n 1 , d 1 = b 1 , and …Forward elimination for solving 𝐀 𝐱 = 𝐟 then becomes y 1 = f 1 , …and back substitution is x n = y n / d n , followed by … Define the Lanczos vectors 𝐯 j and coefficients α j and β j by 𝐯 0 = 𝟎 , a normalized vector 𝐯 1 (perhaps chosen randomly), α 1 = 𝐯 1 T 𝐀 𝐯 1 , β 1 = 0 , and for j = 1 , 2 , , n 1 by the recursive scheme … Start with 𝐯 0 = 𝟎 , vector 𝐯 1 such that 𝐯 1 T 𝐒 𝐯 1 = 1 , α 1 = 𝐯 1 T 𝐀 𝐯 1 , β 1 = 0 . …
    19: 3.10 Continued Fractions
    For instance, if none of the u n vanish, then we can define … The first two columns in this table are defined by …where the c n ( 0 ) appear in (3.10.7). … The A n and B n of (3.10.2) can be computed by means of three-term recurrence relations (1.12.5). … Then u 0 = C n . …
    20: 10.48 Graphs
    See accompanying text
    Figure 10.48.1: 𝗃 n ( x ) , n = 0 ( 1 ) 4 , 0 x 12 . Magnify
    See accompanying text
    Figure 10.48.2: 𝗒 n ( x ) , n = 0 ( 1 ) 4 , 0 < x 12 . Magnify
    See accompanying text
    Figure 10.48.3: 𝗃 5 ( x ) , 𝗒 5 ( x ) , 𝗃 5 2 ( x ) + 𝗒 5 2 ( x ) , 0 x 12 . Magnify
    See accompanying text
    Figure 10.48.4: 𝗃 5 ( x ) , 𝗒 5 ( x ) , 𝗃 5 2 ( x ) + 𝗒 5 2 ( x ) , 0 x 12 . Magnify
    See accompanying text
    Figure 10.48.5: 𝗂 0 ( 1 ) ( x ) , 𝗂 0 ( 2 ) ( x ) , 𝗄 0 ( x ) , 0 x 4 . Magnify