About the Project

.世界杯 买球怎么买_『wn4.com_』2018世界杯一共多少支球队_w6n2c9o_2022年11月29日6时48分9秒_ok040qquy_gov_hk

AdvancedHelp

(0.005 seconds)

21—30 of 799 matching pages

21: Bibliography G
  • W. Gautschi (1966) Algorithm 292: Regular Coulomb wave functions. Comm. ACM 9 (11), pp. 793–795.
  • W. Gautschi (1969) Algorithm 363: Complex error function. Comm. ACM 12 (11), pp. 635.
  • A. Gervois and H. Navelet (1984) Some integrals involving three Bessel functions when their arguments satisfy the triangle inequalities. J. Math. Phys. 25 (11), pp. 3350–3356.
  • 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).
  • 22: Bibliography H
  • R. S. Heller (1976) 25D Table of the First One Hundred Values of j 0 , s , J 1 ( j 0 , s ) , j 1 , s , J 0 ( j 1 , s ) = J 0 ( j 0 , s + 1 ) , j 1 , s , J 1 ( j 1 , s ) . Technical report Department of Physics, Worcester Polytechnic Institute, Worcester, MA.
  • D. R. Herrick and S. O’Connor (1998) Inverse virial symmetry of diatomic potential curves. J. Chem. Phys. 109 (1), pp. 11–19.
  • H. W. Hethcote (1970) Error bounds for asymptotic approximations of zeros of Hankel functions occurring in diffraction problems. J. Mathematical Phys. 11 (8), pp. 2501–2504.
  • G. W. Hill (1970) Algorithm 395: Student’s t-distribution. Comm. ACM 13 (10), pp. 617–619.
  • K. Horata (1989) An explicit formula for Bernoulli numbers. Rep. Fac. Sci. Technol. Meijo Univ. 29, pp. 1–6.
  • 23: Publications
  • 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
  • 24: Bibliography D
  • P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou (1999b) Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory. Comm. Pure Appl. Math. 52 (11), pp. 1335–1425.
  • D. Dominici, S. J. Johnston, and K. Jordaan (2013) Real zeros of F 1 2 hypergeometric polynomials. J. Comput. Appl. Math. 247, pp. 152–161.
  • E. Dorrer (1968) Algorithm 322. F-distribution. Comm. ACM 11 (2), pp. 116–117.
  • B. A. Dubrovin (1981) Theta functions and non-linear equations. Uspekhi Mat. Nauk 36 (2(218)), pp. 11–80 (Russian).
  • J. Dutka (1981) The incomplete beta function—a historical profile. Arch. Hist. Exact Sci. 24 (1), pp. 1129.
  • 25: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    ( n n 1 , n 2 , , n k ) is the number of ways of placing n = n 1 + n 2 + + n k distinct objects into k labeled boxes so that there are n j objects in the j th box. … These are given by the following equations in which a 1 , a 2 , , a n are nonnegative integers such that … M 1 is the multinominal coefficient (26.4.2): …For each n all possible values of a 1 , a 2 , , a n are covered. … where the summation is over all nonnegative integers n 1 , n 2 , , n k such that n 1 + n 2 + + n k = n . …
    26: 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 . …
    27: 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 . …
    28: 8.26 Tables
  • Pearson (1965) tabulates the function I ( u , p ) ( = P ( p + 1 , u ) ) for p = 1 ( .05 ) 0 ( .1 ) 5 ( .2 ) 50 , u = 0 ( .1 ) u p to 7D, where I ( u , u p ) rounds off to 1 to 7D; also I ( u , p ) for p = 0.75 ( .01 ) 1 , u = 0 ( .1 ) 6 to 5D.

  • Pearson (1968) tabulates I x ( a , b ) for x = 0.01 ( .01 ) 1 , a , b = 0.5 ( .5 ) 11 ( 1 ) 50 , with b a , to 7D.

  • Chiccoli et al. (1988) presents a short table of E p ( x ) for p = 9 2 ( 1 ) 1 2 , 0 x 200 to 14S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Stankiewicz (1968) tabulates E n ( x ) for n = 1 ( 1 ) 10 , x = 0.01 ( .01 ) 5 to 7D.

  • 29: Bibliography W
  • C. A. Wills, J. M. Blair, and P. L. Ragde (1982) Rational Chebyshev approximations for the Bessel functions J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) . Math. Comp. 39 (160), pp. 617–623.
  • J. A. Wilson (1980) Some hypergeometric orthogonal polynomials. SIAM J. Math. Anal. 11 (4), pp. 690–701.
  • J. A. Wilson (1991) Asymptotics for the F 3 4 polynomials. J. Approx. Theory 66 (1), pp. 58–71.
  • G. Wolf (2008) On the asymptotic behavior of the Fourier coefficients of Mathieu functions. J. Res. Nat. Inst. Standards Tech. 113 (1), pp. 11–15.
  • E. M. Wright (1940b) The generalized Bessel function of order greater than one. Quart. J. Math., Oxford Ser. 11, pp. 36–48.
  • 30: 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).