About the Project

chain%20rule

AdvancedHelp

(0.002 seconds)

11—20 of 129 matching pages

11: Bibliography G
  • M. J. Gander and A. H. Karp (2001) Stable computation of high order Gauss quadrature rules using discretization for measures in radiation transfer. J. Quant. Spectrosc. Radiat. Transfer 68 (2), pp. 213–223.
  • 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 (2003b) Computing special functions by using quadrature rules. Numer. Algorithms 33 (1-4), pp. 265–275.
  • 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.
  • G. H. Golub and J. H. Welsch (1969) Calculation of Gauss quadrature rules. Math. Comp. 23 (106), pp. 221–230.
  • 12: 1.11 Zeros of Polynomials
    Descartes’ Rule of Signs
    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 ) . …
    13: 3.4 Differentiation
    B 2 5 = 1 120 ( 6 10 t 15 t 2 + 20 t 3 5 t 4 ) ,
    B 3 6 = 1 720 ( 12 8 t 45 t 2 + 20 t 3 + 15 t 4 6 t 5 ) ,
    B 2 6 = 1 60 ( 9 9 t 30 t 2 + 20 t 3 + 5 t 4 3 t 5 ) ,
    The integral on the right-hand side can be approximated by the composite trapezoidal rule (3.5.2). … As explained in §§3.5(i) and 3.5(ix) the composite trapezoidal rule can be very efficient for computing integrals with analytic periodic integrands. …
    14: 3.5 Quadrature
    §3.5(i) Trapezoidal Rules
    The composite trapezoidal rule is …
    §3.5(ii) Simpson’s Rule
    §3.5(iv) Interpolatory Quadrature Rules
    15: 8 Incomplete Gamma and Related
    Functions
    16: 28 Mathieu Functions and Hill’s Equation
    17: 8.25 Methods of Computation
    See Allasia and Besenghi (1987b) for the numerical computation of Γ ( a , z ) from (8.6.4) by means of the trapezoidal rule. … A numerical inversion procedure is also given for calculating the value of x (with 10S accuracy), when a and P ( a , x ) are specified, based on Newton’s rule3.8(ii)). …
    18: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

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

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 19: 23 Weierstrass Elliptic and Modular
    Functions
    20: 9.17 Methods of Computation
    The trapezoidal rule3.5(i)) is then applied. … Zeros of the Airy functions, and their derivatives, can be computed to high precision via Newton’s rule3.8(ii)) or Halley’s rule3.8(v)), using values supplied by the asymptotic expansions of §9.9(iv) as initial approximations. …