About the Project

trapezoidal%20rule

AdvancedHelp

(0.001 seconds)

21—30 of 126 matching pages

21: Wolter Groenevelt
As of September 20, 2022, Groenevelt performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 18 Orthogonal Polynomials. …
22: 33.24 Tables
  • Abramowitz and Stegun (1964, Chapter 14) tabulates F 0 ( η , ρ ) , G 0 ( η , ρ ) , F 0 ( η , ρ ) , and G 0 ( η , ρ ) for η = 0.5 ( .5 ) 20 and ρ = 1 ( 1 ) 20 , 5S; C 0 ( η ) for η = 0 ( .05 ) 3 , 6S.

  • 23: Bibliography W
  • J. Waldvogel (2006) Fast construction of the Fejér and Clenshaw-Curtis quadrature rules. BIT 46 (1), pp. 195–202.
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • 24: About MathML
    As a general rule, using the latest available version of your chosen browser, plugins and an updated operating system is helpful. …
    25: Bibliography O
  • J. Oliver (1977) An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series. J. Inst. Math. Appl. 20 (3), pp. 379–391.
  • M. L. Overton (2001) Numerical Computing with IEEE Floating Point Arithmetic. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 26: 27.15 Chinese Remainder Theorem
    Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
    27: William P. Reinhardt
  • In November 2015, Reinhardt was named Senior Associate Editor of the DLMF and Associate Editor for Chapters 20, 22, and 23.
    28: 10.74 Methods of Computation
    Newton’s rule3.8(i)) or Halley’s rule3.8(v)) can be used to compute to arbitrarily high accuracy the real or complex zeros of all the functions treated in this chapter. …Newton’s rule is quadratically convergent and Halley’s rule is cubically convergent. …
    29: 29.20 Methods of Computation
    A second approach is to solve the continued-fraction equations typified by (29.3.10) by Newton’s rule or other iterative methods; see §3.8. …
    30: 6.19 Tables
  • Zhang and Jin (1996, pp. 652, 689) includes Si ( x ) , Ci ( x ) , x = 0 ( .5 ) 20 ( 2 ) 30 , 8D; Ei ( x ) , E 1 ( x ) , x = [ 0 , 100 ] , 8S.

  • Abramowitz and Stegun (1964, Chapter 5) includes the real and imaginary parts of z e z E 1 ( z ) , x = 19 ( 1 ) 20 , y = 0 ( 1 ) 20 , 6D; e z E 1 ( z ) , x = 4 ( .5 ) 2 , y = 0 ( .2 ) 1 , 6D; E 1 ( z ) + ln z , x = 2 ( .5 ) 2.5 , y = 0 ( .2 ) 1 , 6D.

  • Zhang and Jin (1996, pp. 690–692) includes the real and imaginary parts of E 1 ( z ) , ± x = 0.5 , 1 , 3 , 5 , 10 , 15 , 20 , 50 , 100 , y = 0 ( .5 ) 1 ( 1 ) 5 ( 5 ) 30 , 50 , 100 , 8S.