About the Project

Lagrange%20inversion%20theorem

AdvancedHelp

(0.002 seconds)

11—20 of 321 matching pages

11: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product m has 20 digits, twice the number of digits in the data. By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
12: 2.2 Transcendental Equations
where F 0 = f 0 and s F s ( s 1 ) is the coefficient of x 1 in the asymptotic expansion of ( f ( x ) ) s (Lagrange’s formula for the reversion of series). …
13: 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.
  • W. Gautschi (1992) On mean convergence of extended Lagrange interpolation. J. Comput. Appl. Math. 43 (1-2), pp. 19–35.
  • 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.
  • K. Girstmair (1990a) A theorem on the numerators of the Bernoulli numbers. Amer. Math. Monthly 97 (2), pp. 136–138.
  • 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.
  • 14: Peter L. Walker
    Walker’s books are An Introduction to Complex Analysis, published by Hilger in 1974, The Theory of Fourier Series and Integrals, published by Wiley in 1986, Elliptic Functions. A Constructive Approach, published by Wiley in 1996, and Examples and Theorems in Analysis, published by Springer in 2004. …
  • 15: 8 Incomplete Gamma and Related
    Functions
    16: 28 Mathieu Functions and Hill’s Equation
    17: Bibliography L
  • J. Lagrange (1770) Démonstration d’un Théoréme d’Arithmétique. Nouveau Mém. Acad. Roy. Sci. Berlin, pp. 123–133 (French).
  • P. W. Lawrence, R. M. Corless, and D. J. Jeffrey (2012) Algorithm 917: complex double-precision evaluation of the Wright ω function. ACM Trans. Math. Software 38 (3), pp. Art. 20, 17.
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • 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: 3.8 Nonlinear Equations
    Regula Falsi
    Inverse linear interpolation (§3.3(v)) is used to obtain the first approximation: … Consider x = 20 and j = 19 . We have p ( 20 ) = 19 ! and a 19 = 1 + 2 + + 20 = 210 . …