About the Project

combined

AdvancedHelp

(0.000 seconds)

11—20 of 163 matching pages

11: 10.33 Continued Fractions
12: 13.25 Products
13: 27.15 Chinese Remainder Theorem
These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
14: 28.34 Methods of Computation
  • (c)

    Solution of (28.2.1) by boundary-value methods; see §3.7(iii). This can be combined with §28.34(ii)(c).

  • (d)

    Solution of the systems of linear algebraic equations (28.4.5)–(28.4.8) and (28.14.4), with the conditions (28.4.9)–(28.4.12) and (28.14.5), by boundary-value methods (§3.6) to determine the Fourier coefficients. Subsequently, the Fourier series can be summed with the aid of Clenshaw’s algorithm (§3.11(ii)). See Meixner and Schäfke (1954, §2.87). This procedure can be combined with §28.34(ii)(d).

  • 15: 9.8 Modulus and Phase
    9.8.9 | x | 1 / 2 M 2 ( x ) = 1 2 ξ ( J 1 / 3 2 ( ξ ) + Y 1 / 3 2 ( ξ ) ) ,
    9.8.10 | x | 1 / 2 N 2 ( x ) = 1 2 ξ ( J 2 / 3 2 ( ξ ) + Y 2 / 3 2 ( ξ ) ) ,
    9.8.11 θ ( x ) = 2 3 π + arctan ( Y 1 / 3 ( ξ ) / J 1 / 3 ( ξ ) ) ,
    9.8.12 ϕ ( x ) = 1 3 π + arctan ( Y 2 / 3 ( ξ ) / J 2 / 3 ( ξ ) ) .
    9.8.19 θ 2 ( x ) + 1 2 ( θ ′′′ ( x ) / θ ( x ) ) 3 4 ( θ ′′ ( x ) / θ ( x ) ) 2 = x .
    16: 19.17 Graphics
    17: 10.44 Sums
    18: 19.12 Asymptotic Approximations
    19.12.6 R C ( x , y ) = π 2 y x y ( 1 + O ( x y ) ) , x / y 0 ,
    19.12.7 R C ( x , y ) = 1 2 x ( ( 1 + y 2 x ) ln ( 4 x y ) y 2 x ) ( 1 + O ( y 2 / x 2 ) ) , y / x 0 .
    19: 10.51 Recurrence Relations and Derivatives
    20: 13.11 Series
    13.11.2 M ( a , b , z ) = Γ ( b a 1 2 ) e 1 2 z ( 1 4 z ) a b + 1 2 s = 0 ( 1 ) s ( 2 b 2 a 1 ) s ( b 2 a ) s ( b a 1 2 + s ) ( b ) s s ! I b a 1 2 + s ( 1 2 z ) , b a + 1 2 , b 0 , 1 , 2 , .
    For additional expansions combine (13.14.4), (13.14.5), and §13.24. …