About the Project

.2022世界杯中国男足蠃_『wn4.com_』世界杯冠军加多少分_w2n3c1o_2022年12月10日16时49分8秒_zwuzf2w8s

AdvancedHelp

(0.006 seconds)

21—30 of 815 matching pages

21: 30.7 Graphics
See accompanying text
Figure 30.7.1: Eigenvalues λ n 0 ( γ 2 ) , n = 0 , 1 , 2 , 3 , 10 γ 2 10 . Magnify
See accompanying text
Figure 30.7.2: Eigenvalues λ n 1 ( γ 2 ) n = 1 , 2 , 3 , 4 , 10 γ 2 10 . Magnify
See accompanying text
Figure 30.7.3: Eigenvalues λ n 5 ( γ 2 ) , n = 5 , 6 , 7 , 8 , 40 γ 2 40 . Magnify
See accompanying text
Figure 30.7.4: Eigenvalues λ n 10 ( γ 2 ) , n = 10 , 11 , 12 , 13 , 50 γ 2 150 . Magnify
See accompanying text
Figure 30.7.15: 𝖰𝗌 1 0 ( x , γ 2 ) , 1 < x < 1 , 10 γ 2 10 . Magnify 3D Help
22: 34.3 Basic Properties: 3 j Symbol
When any one of j 1 , j 2 , j 3 is equal to 0 , 1 2 , or 1 , the 3 j symbol has a simple algebraic form. …For these and other results, and also cases in which any one of j 1 , j 2 , j 3 is 3 2 or 2 , see Edmonds (1974, pp. 125–127). … Even permutations of columns of a 3 j symbol leave it unchanged; odd permutations of columns produce a phase factor ( 1 ) j 1 + j 2 + j 3 , for example,
34.3.8 ( j 1 j 2 j 3 m 1 m 2 m 3 ) = ( j 2 j 3 j 1 m 2 m 3 m 1 ) = ( j 3 j 1 j 2 m 3 m 1 m 2 ) ,
For the polynomials P l see §18.3, and for the function Y l , m see §14.30. …
23: 34.1 Special Notation
( j 1 j 2 j 3 m 1 m 2 m 3 ) ,
{ j 1 j 2 j 3 l 1 l 2 l 3 } ,
{ j 11 j 12 j 13 j 21 j 22 j 23 j 31 j 32 j 33 } .
An often used alternative to the 3 j symbol is the Clebsch–Gordan coefficient
34.1.1 ( j 1 m 1 j 2 m 2 | j 1 j 2 j 3 m 3 ) = ( 1 ) j 1 j 2 + m 3 ( 2 j 3 + 1 ) 1 2 ( j 1 j 2 j 3 m 1 m 2 m 3 ) ;
24: 14.33 Tables
  • Abramowitz and Stegun (1964, Chapter 8) tabulates 𝖯 n ( x ) for n = 0 ( 1 ) 3 , 9 , 10 , x = 0 ( .01 ) 1 , 5–8D; 𝖯 n ( x ) for n = 1 ( 1 ) 4 , 9 , 10 , x = 0 ( .01 ) 1 , 5–7D; 𝖰 n ( x ) and 𝖰 n ( x ) for n = 0 ( 1 ) 3 , 9 , 10 , x = 0 ( .01 ) 1 , 6–8D; P n ( x ) and P n ( x ) for n = 0 ( 1 ) 5 , 9 , 10 , x = 1 ( .2 ) 10 , 6S; Q n ( x ) and Q n ( x ) for n = 0 ( 1 ) 3 , 9 , 10 , x = 1 ( .2 ) 10 , 6S. (Here primes denote derivatives with respect to x .)

  • Zhang and Jin (1996, Chapter 4) tabulates 𝖯 n ( x ) for n = 2 ( 1 ) 5 , 10 , x = 0 ( .1 ) 1 , 7D; 𝖯 n ( cos θ ) for n = 1 ( 1 ) 4 , 10 , θ = 0 ( 5 ) 90 , 8D; 𝖰 n ( x ) for n = 0 ( 1 ) 2 , 10 , x = 0 ( .1 ) 0.9 , 8S; 𝖰 n ( cos θ ) for n = 0 ( 1 ) 3 , 10 , θ = 0 ( 5 ) 90 , 8D; 𝖯 n m ( x ) for m = 1 ( 1 ) 4 , n m = 0 ( 1 ) 2 , n = 10 , x = 0 , 0.5 , 8S; 𝖰 n m ( x ) for m = 1 ( 1 ) 4 , n = 0 ( 1 ) 2 , 10 , 8S; 𝖯 ν m ( cos θ ) for m = 0 ( 1 ) 3 , ν = 0 ( .25 ) 5 , θ = 0 ( 15 ) 90 , 5D; P n ( x ) for n = 2 ( 1 ) 5 , 10 , x = 1 ( 1 ) 10 , 7S; Q n ( x ) for n = 0 ( 1 ) 2 , 10 , x = 2 ( 1 ) 10 , 8S. Corresponding values of the derivative of each function are also included, as are 6D values of the first 5 ν -zeros of 𝖯 ν m ( cos θ ) and of its derivative for m = 0 ( 1 ) 4 , θ = 10 , 30 , 150 .

  • Belousov (1962) tabulates 𝖯 n m ( cos θ ) (normalized) for m = 0 ( 1 ) 36 , n m = 0 ( 1 ) 56 , θ = 0 ( 2.5 ) 90 , 6D.

  • Žurina and Karmazina (1964, 1965) tabulate the conical functions 𝖯 1 2 + i τ ( x ) for τ = 0 ( .01 ) 50 , x = 0.9 ( .1 ) 0.9 , 7S; P 1 2 + i τ ( x ) for τ = 0 ( .01 ) 50 , x = 1.1 ( .1 ) 2 ( .2 ) 5 ( .5 ) 10 ( 10 ) 60 , 7D. Auxiliary tables are included to facilitate computation for larger values of τ when 1 < x < 1 .

  • Žurina and Karmazina (1963) tabulates the conical functions 𝖯 1 2 + i τ 1 ( x ) for τ = 0 ( .01 ) 25 , x = 0.9 ( .1 ) 0.9 , 7S; P 1 2 + i τ 1 ( x ) for τ = 0 ( .01 ) 25 , x = 1.1 ( .1 ) 2 ( .2 ) 5 ( .5 ) 10 ( 10 ) 60 , 7S. Auxiliary tables are included to assist computation for larger values of τ when 1 < x < 1 .

  • 25: 23.20 Mathematical Applications
    There is a unique point z 0 [ ω 1 , ω 1 + ω 3 ] [ ω 1 + ω 3 , ω 3 ] such that ( z 0 ) = 0 . … The interior of the rectangle with vertices 0 , ω 1 , 2 ω 3 , 2 ω 3 ω 1 is mapped two-to-one onto the lower half-plane. The interior of the rectangle with vertices 0 , ω 1 , 1 2 ω 1 + ω 3 , 1 2 ω 1 ω 3 is mapped one-to-one onto the lower half-plane with a cut from e 3 to ( 1 2 ω 1 + ω 3 ) ( = ( 1 2 ω 1 ω 3 ) ) . The cut is the image of the edge from 1 2 ω 1 + ω 3 to 1 2 ω 1 ω 3 and is not a line segment. … The order of a point (if finite and not already determined) can have only the values 3, 5, 6, 7, 9, 10, or 12, and so can be found from 2 P = P , 4 P = P , 4 P = 2 P , 8 P = P , 8 P = P , 8 P = 2 P , or 8 P = 4 P . …
    26: 19.29 Reduction of General Elliptic Integrals
    Let …where … Next, for j = 1 , 2 , define Q j ( t ) = f j + g j t + h j t 2 , and assume both Q ’s are positive for y < t < x . …where …If Q 1 ( t ) = ( a 1 + b 1 t ) ( a 2 + b 2 t ) , where both linear factors are positive for y < t < x , and Q 2 ( t ) = f 2 + g 2 t + h 2 t 2 , then (19.29.25) is modified so that …
    27: 10.75 Tables
  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Kerimov and Skorokhodov (1985c) tabulates 201 double zeros of J ν ′′ ( x ) , 10 double zeros of J ν ′′′ ( x ) , 101 double zeros of Y ν ( x ) , 201 double zeros of Y ν ′′ ( x ) , and 10 double zeros of Y ν ′′′ ( x ) , all to 8 or 9D.

  • Achenbach (1986) tabulates I 0 ( x ) , I 1 ( x ) , K 0 ( x ) , K 1 ( x ) , x = 0 ( .1 ) 8 , 19D or 19–21S.

  • The main tables in Abramowitz and Stegun (1964, Chapter 10) give 𝗃 n ( x ) , 𝗒 n ( x ) n = 0 ( 1 ) 8 , x = 0 ( .1 ) 10 , 5–8S; 𝗃 n ( x ) , 𝗒 n ( x ) n = 0 ( 1 ) 20 ( 10 ) 50 , 100, x = 1 , 2 , 5 , 10 , 50 , 100 , 10S; 𝗂 n ( 1 ) ( x ) , 𝗄 n ( x ) , n = 0 , 1 , 2 , x = 0 ( .1 ) 5 , 4–9D; 𝗂 n ( 1 ) ( x ) , 𝗄 n ( x ) , n = 0 ( 1 ) 20 ( 10 ) 50 , 100, x = 1 , 2 , 5 , 10 , 50 , 100 , 10S. (For the notation see §10.1 and §10.47(ii).)

  • Young and Kirk (1964) tabulates ber n x , bei n x , ker n x , kei n x , n = 0 , 1 , x = 0 ( .1 ) 10 , 15D; ber n x , bei n x , ker n x , kei n x , modulus and phase functions M n ( x ) , θ n ( x ) , N n ( x ) , ϕ n ( x ) , n = 0 , 1 , 2 , x = 0 ( .01 ) 2.5 , 8S, and n = 0 ( 1 ) 10 , x = 0 ( .1 ) 10 , 7S. Also included are auxiliary functions to facilitate interpolation of the tables for n = 0 ( 1 ) 10 for small values of x . (Concerning the phase functions see §10.68(iv).)

  • 28: 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 . …
    29: 9.11 Products
    where w 1 and w 2 are any solutions of (9.2.1). … where J 0 is the Bessel function (§10.2(ii)). … Let w 1 , w 2 be any solutions of (9.2.1), not necessarily distinct. …
    9.11.10 z w 1 w 2 d z = 3 10 ( w 1 w 2 + z w 1 w 2 + z w 1 w 2 ) + 1 5 ( z 2 w 1 w 2 z 3 w 1 w 2 ) .
    For z n w 1 w 2 d z , z n w 1 w 2 d z , z n w 1 w 2 d z , where n is any positive integer, see Albright (1977). …
    30: 27.13 Functions
    For a given integer k 2 the function r k ( n ) is defined as the number of solutions of the equation …where the x j are integers, positive, negative, or zero, and the order of the summands is taken into account. … Hence r 2 ( 5 ) = 8 because both divisors, 1 and 5 , are congruent to 1 ( mod 4 ) . … By similar methods Jacobi proved that r 4 ( n ) = 8 σ 1 ( n ) if n is odd, whereas, if n is even, r 4 ( n ) = 24 times the sum of the odd divisors of n . …Explicit formulas for r k ( n ) have been obtained by similar methods for k = 6 , 8 , 10 , and 12 , but they are more complicated. …