About the Project

.2002年世界杯魔咒__『wn4.com_』_世界杯赛十六强产生情况_w6n2c9o_2022年11月29日5时25分54秒_l15ffl75v.com

AdvancedHelp

(0.010 seconds)

31—40 of 785 matching pages

31: 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 . …
32: 24.20 Tables
Abramowitz and Stegun (1964, Chapter 23) includes exact values of k = 1 m k n , m = 1 ( 1 ) 100 , n = 1 ( 1 ) 10 ; k = 1 k n , k = 1 ( 1 ) k 1 k n , k = 0 ( 2 k + 1 ) n , n = 1 , 2 , , 20D; k = 0 ( 1 ) k ( 2 k + 1 ) n , n = 1 , 2 , , 18D. Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. … For information on tables published before 1961 see Fletcher et al. (1962, v. 1, §4) and Lebedev and Fedorova (1960, Chapters 11 and 14).
33: 3.11 Approximation Techniques
Beginning with u n + 1 = 0 , u n = c n , we apply … With b 0 = 1 , the last q equations give b 1 , , b q as the solution of a system of linear equations. … (3.11.29) is a system of n + 1 linear equations for the coefficients a 0 , a 1 , , a n . … With this choice of a k and f j = f ( x j ) , the corresponding sum (3.11.32) vanishes. … Two are endpoints: ( x 0 , y 0 ) and ( x 3 , y 3 ) ; the other points ( x 1 , y 1 ) and ( x 2 , y 2 ) are control points. …
34: 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 . …
35: 21.1 Special Notation
g , h positive integers.
a j j th element of vector 𝐚 .
diag 𝐀 Transpose of [ A 11 , A 22 , , A g g ] .
𝐉 2 g [ 𝟎 g 𝐈 g 𝐈 g 𝟎 g ] .
S 1 S 2 set of all elements of the form “ element of  S 1 × element of  S 2 ”.
S 1 / S 2 set of all elements of S 1 , modulo elements of S 2 . Thus two elements of S 1 / S 2 are equivalent if they are both in S 1 and their difference is in S 2 . (For an example see §20.12(ii).)
36: 16.6 Transformations of Variable
16.6.1 F 2 3 ( a , b , c a b + 1 , a c + 1 ; z ) = ( 1 z ) a F 2 3 ( a b c + 1 , 1 2 a , 1 2 ( a + 1 ) a b + 1 , a c + 1 ; 4 z ( 1 z ) 2 ) .
16.6.2 F 2 3 ( a , 2 b a 1 , 2 2 b + a b , a b + 3 2 ; z 4 ) = ( 1 z ) a F 2 3 ( 1 3 a , 1 3 a + 1 3 , 1 3 a + 2 3 b , a b + 3 2 ; 27 z 4 ( 1 z ) 3 ) .
For Kummer-type transformations of F 2 2 functions see Miller (2003) and Paris (2005a), and for further transformations see Erdélyi et al. (1953a, §4.5), Miller and Paris (2011), Choi and Rathie (2013) and Wang and Rathie (2013).
37: 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 …
38: 17.9 Further Transformations of ϕ r r + 1 Functions
§17.9(i) ϕ 1 2 ϕ 2 2 , ϕ 1 3 , or ϕ 2 3
§17.9(ii) ϕ 2 3 ϕ 2 3
Transformations of ϕ 2 3 -Series
§17.9(iii) Further ϕ s r Functions
Sears’ Balanced ϕ 3 4 Transformations
39: 10.63 Recurrence Relations and Derivatives
§10.63(i) ber ν x , bei ν x , ker ν x , kei ν x
Let f ν ( x ) , g ν ( x ) denote any one of the ordered pairs:
ber ν x , bei ν x ;
bei ν x , ber ν x ;
ker ν x , kei ν x ;
40: 17.12 Bailey Pairs
β n = j = 0 n α j u n j v n + j ,
γ n = j = n δ j u j n v j + n .
A sequence of pairs of rational functions of several variables ( α n , β n ) , n = 0 , 1 , 2 , , is called a Bailey pair provided that for each n 0 If ( α n , β n ) is a Bailey pair, then … If ( α n , β n ) is a Bailey pair, then so is ( α n , β n ) , where …