About the Project

change%20of%20amplitude

AdvancedHelp

(0.002 seconds)

11—20 of 219 matching pages

11: 3.8 Nonlinear Equations
  • (a)

    f ( x 0 ) f ′′ ( x 0 ) > 0 and f ( x ) , f ′′ ( x ) do not change sign between x 0 and ξ (monotonic convergence).

  • (b)

    f ( x 0 ) f ′′ ( x 0 ) < 0 , f ( x ) , f ′′ ( x ) do not change sign in the interval ( x 0 , x 1 ) , and ξ [ x 0 , x 1 ] (monotonic convergence after the first iteration).

  • Then the sensitivity of a simple zero z to changes in α is given by … Consider x = 20 and j = 19 . We have p ( 20 ) = 19 ! and a 19 = 1 + 2 + + 20 = 210 . …
    12: 20.11 Generalizations and Analogs
    §20.11(iii) Ramanujan’s Change of Base
    These results are called Ramanujan’s changes of base. …
    13: 36 Integrals with Coalescing Saddles
    14: Gergő Nemes
    As of September 20, 2021, Nemes performed a complete analysis and acted as main consultant for the update of the source citation and proof metadata for every formula in Chapter 25 Zeta and Related Functions. …
    15: 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. …
    16: 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.

  • 17: 12.11 Zeros
    12.11.5 p 0 ( ζ ) = t ( ζ ) ,
    12.11.6 p 1 ( ζ ) = t 3 6 t 24 ( t 2 1 ) 2 + 5 48 ( ( t 2 1 ) ζ 3 ) 1 2 .
    12.11.8 q 0 ( ζ ) = t ( ζ ) .
    12.11.9 u a , 1 2 1 2 μ ( 1 1.85575 708 μ 4 / 3 0.34438 34 μ 8 / 3 0.16871 5 μ 4 0.11414 μ 16 / 3 0.0808 μ 20 / 3 ) ,
    18: 9.7 Asymptotic Expansions
    9.7.1 ζ = 2 3 z 3 / 2 .
    Numerical values of χ ( n ) are given in Table 9.7.1 for n = 1 ( 1 ) 20 to 2D. …
    9.7.20 R n ( z ) = ( 1 ) n k = 0 m 1 ( 1 ) k u k G n k ( 2 ζ ) ζ k + R m , n ( z ) ,
    9.7.21 S n ( z ) = ( 1 ) n 1 k = 0 m 1 ( 1 ) k v k G n k ( 2 ζ ) ζ k + S m , n ( z ) ,
    19: Errata
    Changes
    Changes
    Changes
    Changes
    Changes
    20: 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. …