About the Project

.联通盒子怎么看世界杯_『wn4.com_』世界杯赌球平了怎么算_w6n2c9o_2022年11月29日5时31分38秒_m2c8qeq0s

AdvancedHelp

(0.005 seconds)

31—40 of 783 matching pages

31: 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.

  • Agrest et al. (1982) tabulates 𝐇 n ( x ) and e x 𝐋 n ( x ) for n = 0 , 1 and x = 0 ( .001 ) 5 ( .005 ) 15 ( .01 ) 100 to 11D.

  • 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.

  • Agrest et al. (1982) tabulates 0 x 𝐇 0 ( t ) d t and e x 0 x 𝐋 0 ( t ) d t for x = 0 ( .001 ) 5 ( .005 ) 15 ( .01 ) 100 to 11D.

  • 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.

  • 32: 17.7 Special Cases of Higher ϕ s r Functions
    §17.7(i) ϕ 2 2 Functions
    q -Analog of Bailey’s F 1 2 ( 1 ) Sum
    q -Analog of Gauss’s F 1 2 ( 1 ) Sum
    q -Analog of Dixon’s F 2 3 ( 1 ) Sum
    where m 1 , m 2 , , m r are arbitrary nonnegative integers. …
    33: 28.35 Tables
  • Blanch and Rhodes (1955) includes 𝐵𝑒 n ( t ) , 𝐵𝑜 n ( t ) , t = 1 2 q , n = 0 ( 1 ) 15 ; 8D. The range of t is 0 to 0.1, with step sizes ranging from 0.002 down to 0.00025. Notation: 𝐵𝑒 n ( t ) = a n ( q ) + 2 q ( 4 n + 2 ) q , 𝐵𝑜 n ( t ) = b n ( q ) + 2 q ( 4 n 2 ) q .

  • Ince (1932) includes eigenvalues a n , b n , and Fourier coefficients for n = 0 or 1 ( 1 ) 6 , q = 0 ( 1 ) 10 ( 2 ) 20 ( 4 ) 40 ; 7D. Also ce n ( x , q ) , se n ( x , q ) for q = 0 ( 1 ) 10 , x = 1 ( 1 ) 90 , corresponding to the eigenvalues in the tables; 5D. Notation: a n = 𝑏𝑒 n 2 q , b n = 𝑏𝑜 n 2 q .

  • Stratton et al. (1941) includes b n , b n , and the corresponding Fourier coefficients for Se n ( c , x ) and So n ( c , x ) for n = 0 or 1 ( 1 ) 4 , c = 0 ( .1 or .2 ) 4.5 . Precision is mostly 5S. Notation: c = 2 q , b n = a n + 2 q , b n = b n + 2 q , and for Se n ( c , x ) , So n ( c , x ) see §28.1.

  • Ince (1932) includes the first zero for ce n , se n for n = 2 ( 1 ) 5 or 6 , q = 0 ( 1 ) 10 ( 2 ) 40 ; 4D. This reference also gives zeros of the first derivatives, together with expansions for small q .

  • For other tables prior to 1961 see Fletcher et al. (1962, §2.2) and Lebedev and Fedorova (1960, Chapter 11).
    34: Bibliography G
  • W. Gautschi (1966) Algorithm 292: Regular Coulomb wave functions. Comm. ACM 9 (11), pp. 793–795.
  • W. Gautschi (1959a) Exponential integral 1 e x t t n 𝑑 t for large values of n . J. Res. Nat. Bur. Standards 62, pp. 123–125.
  • D. Goss (1978) Von Staudt for 𝐅 q [ T ] . Duke Math. J. 45 (4), pp. 885–910.
  • H. W. Gould (1960) Stirling number representation problems. Proc. Amer. Math. Soc. 11 (3), pp. 447–451.
  • V. I. Gromak (1975) Theory of Painlevé’s equations. Differ. Uravn. 11 (11), pp. 373–376 (Russian).
  • 35: 18.8 Differential Equations
    Table 18.8.1: Classical OP’s: differential equations A ( x ) f ′′ ( x ) + B ( x ) f ( x ) + C ( x ) f ( x ) + λ n f ( x ) = 0 .
    # f ( x ) A ( x ) B ( x ) C ( x ) λ n
    11 e n 1 x x + 1 L n 1 ( 2 + 1 ) ( 2 n 1 x ) 1 0 2 x ( + 1 ) x 2 1 n 2
    12 H n ( x ) 1 2 x 0 2 n
    14 𝐻𝑒 n ( x ) 1 x 0 n
    Item 11 of Table 18.8.1 yields (18.39.36) for Z = 1 .
    36: 26.13 Permutations: Cycle Notation
    𝔖 n denotes the set of permutations of { 1 , 2 , , n } . σ 𝔖 n is a one-to-one and onto mapping from { 1 , 2 , , n } to itself. … An element of 𝔖 n with a 1 fixed points, a 2 cycles of length 2 , , a n cycles of length n , where n = a 1 + 2 a 2 + + n a n , is said to have cycle type ( a 1 , a 2 , , a n ) . The number of elements of 𝔖 n with cycle type ( a 1 , a 2 , , a n ) is given by (26.4.7). … A permutation with cycle type ( a 1 , a 2 , , a n ) can be written as a product of a 2 + 2 a 3 + + ( n 1 ) a n = n ( a 1 + a 2 + + a n ) transpositions, and no fewer. …
    37: Publications
  • D. W. Lozier (2003) The NIST Digital Library of Mathematical Functions Project, Annals of Mathematics and Artificial Intelligence—Special Issue on Mathematical Knowledge Management, Vol. 38, Nos. 1–3, pp. 105–119. PDF
  • B. R. Miller and A. Youssef (2003) Technical Aspects of the Digital Library of Mathematical Functions, Annals of Mathematics and Artificial Intelligence—Special Issue on Mathematical Knowledge Management, Vol. 38, Nos. 1–3, pp. 121–136. PDF
  • B. V. Saunders and Q. Wang (2005) Boundary/Contour Fitted Grid Generation for Effective Visualizations in a Digital Library of Mathematical Functions, Proceedings of the 9th International Conference on Numerical Grid Generation in Computational Field Simulations, San Jose, June 11–18, 2005. pp. 61–71. PDF
  • Q. Wang and B. V. Saunders (2005) Web-Based 3D Visualization in a Digital Library of Mathematical Functions, Proceedings of the Web3D Symposium, Bangor, UK, March 29–April 1, 2005. PDF
  • B. V. Saunders and Q. Wang (2006) From B-Spline Mesh Generation to Effective Visualizations for the NIST Digital Library of Mathematical Functions, in Curve and Surface Design, Proceedings of the Sixth International Conference on Curves and Surfaces, Avignon, France June 29–July 5, 2006, pp. 235–243. PDF
  • 38: 3.1 Arithmetics and Error Measures
    with b 0 = 1 and all allowable choices of E , p , s , and b j . … Let E min E E max with E min < 0 and E max > 0 . …The integers p , E min , and E max are characteristics of the machine. … N min x N max , and …Then rounding by chopping or rounding down of x gives x , with maximum relative error ϵ M . …
    39: 3.8 Nonlinear Equations
    The choice of x 0 here is critical. … Let x 0 and x 1 be such that f 0 = f ( x 0 ) and f 1 = f ( x 1 ) have opposite signs. …We continue with x 2 and either x 0 or x 1 , depending which of f 0 and f 1 is of opposite sign to f ( x 2 ) , and so on. … Whether or not f 0 and f 1 have opposite signs, x 2 is computed as in (3.8.6). … We construct sequences q j and r j , j = n + 1 , n , , 0 , from q n + 1 = r n + 1 = 0 , q n = r n = a n , and for j n 1 , …
    40: 1.11 Zeros of Polynomials
    where b n = a n , … With b k as in (1.11.1)–(1.11.3) let c n = a n and … where z 1 , z 2 , , z n are the zeros of f ( z ) . … Resolvent cubic is z 3 + 12 z 2 + 20 z + 9 = 0 with roots θ 1 = 1 , θ 2 = 1 2 ( 11 + 85 ) , θ 3 = 1 2 ( 11 85 ) , and θ 1 = 1 , θ 2 = 1 2 ( 17 + 5 ) , θ 3 = 1 2 ( 17 5 ) . … Let …