About the Project

transition%20points

AdvancedHelp

(0.001 seconds)

21—30 of 224 matching pages

21: 3.4 Differentiation
Two-Point Formula
Three-Point Formula
Four-Point Formula
Five-Point Formula
Six-Point Formula
22: 16.23 Mathematical Applications
A substantial transition occurs in a random graph of n vertices when the number of edges becomes approximately 1 2 n . …
23: 10.19 Asymptotic Expansions for Large Order
§10.19(iii) Transition Region
24: 28.35 Tables
  • 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 .

  • Kirkpatrick (1960) contains tables of the modified functions Ce n ( x , q ) , Se n + 1 ( x , q ) for n = 0 ( 1 ) 5 , q = 1 ( 1 ) 20 , x = 0.1 ( .1 ) 1 ; 4D or 5D.

  • National Bureau of Standards (1967) includes the eigenvalues a n ( q ) , b n ( q ) for n = 0 ( 1 ) 3 with q = 0 ( .2 ) 20 ( .5 ) 37 ( 1 ) 100 , and n = 4 ( 1 ) 15 with q = 0 ( 2 ) 100 ; Fourier coefficients for ce n ( x , q ) and se n ( x , q ) for n = 0 ( 1 ) 15 , n = 1 ( 1 ) 15 , respectively, and various values of q in the interval [ 0 , 100 ] ; joining factors g e , n ( q ) , f e , n ( q ) for n = 0 ( 1 ) 15 with q = 0 ( .5  to  10 ) 100 (but in a different notation). Also, eigenvalues for large values of q . Precision is generally 8D.

  • Zhang and Jin (1996, pp. 521–532) includes the eigenvalues a n ( q ) , b n + 1 ( q ) for n = 0 ( 1 ) 4 , q = 0 ( 1 ) 50 ; n = 0 ( 1 ) 20 ( a ’s) or 19 ( b ’s), q = 1 , 3 , 5 , 10 , 15 , 25 , 50 ( 50 ) 200 . Fourier coefficients for ce n ( x , 10 ) , se n + 1 ( x , 10 ) , n = 0 ( 1 ) 7 . Mathieu functions ce n ( x , 10 ) , se n + 1 ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , x = 0 ( 5 ) 90 . Modified Mathieu functions Mc n ( j ) ( x , 10 ) , Ms n + 1 ( j ) ( x , 10 ) , and their first x -derivatives for n = 0 ( 1 ) 4 , j = 1 , 2 , x = 0 ( .2 ) 4 . Precision is mostly 9S.

  • Blanch and Clemm (1969) includes eigenvalues a n ( q ) , b n ( q ) for q = ρ e i ϕ , ρ = 0 ( .5 ) 25 , ϕ = 5 ( 5 ) 90 , n = 0 ( 1 ) 15 ; 4D. Also a n ( q ) and b n ( q ) for q = i ρ , ρ = 0 ( .5 ) 100 , n = 0 ( 2 ) 14 and n = 2 ( 2 ) 16 , respectively; 8D. Double points for n = 0 ( 1 ) 15 ; 8D. Graphs are included.

  • 25: 18.40 Methods of Computation
    Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . … The quadrature points and weights can be put to a more direct and efficient use. … This allows Stieltjes–Perron inversion for the w ( x i , N ) , given the quadrature weights and points. …
    See accompanying text
    Figure 18.40.2: Derivative Rule inversions for w RCP ( x ) carried out via Lagrange and PWCF interpolations. Shown are the absolute errors of approximation (18.40.8) at the points x i , N , i = 1 , 2 , , N for N = 40 . For the derivative rule Lagrange interpolation (red points) gives 15 digits in the central region, while PWCF interpolation (blue points) gives 25 . Magnify
    26: 25.12 Polylogarithms
    In the complex plane Li 2 ( z ) has a branch point at z = 1 . …
    See accompanying text
    Figure 25.12.1: Dilogarithm function Li 2 ( x ) , 20 x < 1 . Magnify
    See accompanying text
    Figure 25.12.2: Absolute value of the dilogarithm function | Li 2 ( x + i y ) | , 20 x 20 , 20 y 20 . … Magnify 3D Help
    27: Bibliography I
  • IEEE (2008) IEEE Standard for Floating-Point Arithmetic. The Institute of Electrical and Electronics Engineers, Inc..
  • IEEE (2019) IEEE International Standard for Information Technology—Microprocessor Systems—Floating-Point arithmetic: IEEE Std 754-2019. The Institute of Electrical and Electronics Engineers, Inc..
  • K. Inkeri (1959) The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.
  • 28: 3.1 Arithmetics and Error Measures
    A nonzero normalized binary floating-point machine number x is represented as … …
    IEEE Standard
    Rounding
    29: Bibliography D
  • B. Döring (1966) Complex zeros of cylinder functions. Math. Comp. 20 (94), pp. 215–222.
  • T. M. Dunster (1989) Uniform asymptotic expansions for Whittaker’s confluent hypergeometric functions. SIAM J. Math. Anal. 20 (3), pp. 744–760.
  • T. M. Dunster (1990b) Uniform asymptotic solutions of second-order linear differential equations having a double pole with complex exponent and a coalescing turning point. SIAM J. Math. Anal. 21 (6), pp. 1594–1618.
  • T. M. Dunster (2001a) Convergent expansions for solutions of linear ordinary differential equations having a simple turning point, with an application to Bessel functions. Stud. Appl. Math. 107 (3), pp. 293–323.
  • T. M. Dunster (2014) Olver’s error bound methods applied to linear ordinary differential equations having a simple turning point. Anal. Appl. (Singap.) 12 (4), pp. 385–402.
  • 30: Bibliography G
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • A. Gil and J. Segura (2003) Computing the zeros and turning points of solutions of second order homogeneous linear ODEs. SIAM J. Numer. Anal. 41 (3), pp. 827–855.
  • D. Goldberg (1991) What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys 23 (1), pp. 5–48.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.