About the Project

Pringsheim theorem for continued fractions

AdvancedHelp

(0.001 seconds)

21—30 of 241 matching pages

21: 8.9 Continued Fractions
§8.9 Continued Fractions
22: 4.9 Continued Fractions
§4.9 Continued Fractions
§4.9(i) Logarithms
For other continued fractions involving logarithms see Lorentzen and Waadeland (1992, pp. 566–568). …
§4.9(ii) Exponentials
For other continued fractions involving the exponential function see Lorentzen and Waadeland (1992, pp. 563–564). …
23: Bibliography C
  • L. Carlitz (1961b) The Staudt-Clausen theorem. Math. Mag. 34, pp. 131–146.
  • B. W. Char (1980) On Stieltjes’ continued fraction for the gamma function. Math. Comp. 34 (150), pp. 547–551.
  • A. D. Chave (1983) Numerical integration of related Hankel transforms by quadrature and continued fraction expansion. Geophysics 48 (12), pp. 1671–1686.
  • A. Cuyt, V. Petersen, B. Verdonk, H. Waadeland, W. B. Jones, and C. Bonan-Hamada (2007) Handbook of Continued Fractions for Special Functions. Kluwer Academic Publishers Group, Dordrecht.
  • A. Cuyt, V. B. Petersen, B. Verdonk, H. Waadeland, and W. B. Jones (2008) Handbook of Continued Fractions for Special Functions. Springer, New York.
  • 24: Wadim Zudilin
    Zudilin is author or coauthor of numerous publications including the book Neverending Fractions, An Introduction to Continued Fractions published by Cambridge University Press in 2014. …
    25: Bibliography M
  • S. C. Milne (1985a) A q -analog of the F 4 5 ( 1 ) summation theorem for hypergeometric series well-poised in 𝑆𝑈 ( n ) . Adv. in Math. 57 (1), pp. 14–33.
  • S. C. Milne (1988) A q -analog of the Gauss summation theorem for hypergeometric series in U ( n ) . Adv. in Math. 72 (1), pp. 59–131.
  • S. C. Milne (2002) Infinite families of exact sums of squares formulas, Jacobi elliptic functions, continued fractions, and Schur functions. Ramanujan J. 6 (1), pp. 7–149.
  • C. Mortici (2011a) A new Stirling series as continued fraction. Numer. Algorithms 56 (1), pp. 17–26.
  • C. Mortici (2013a) A continued fraction approximation of the gamma function. J. Math. Anal. Appl. 402 (2), pp. 405–410.
  • 26: 8.25 Methods of Computation
    §8.25(iv) Continued Fractions
    The computation of γ ( a , z ) and Γ ( a , z ) by means of continued fractions is described in Jones and Thron (1985) and Gautschi (1979b, §§4.3, 5). …
    27: 33.8 Continued Fractions
    §33.8 Continued Fractions
    The continued fraction (33.8.1) converges for all finite values of ρ , and (33.8.2) converges for all ρ 0 . … The ambiguous sign in (33.8.4) has to agree with that of the final denominator in (33.8.1) when the continued fraction has converged to the required precision. …
    28: 1.9 Calculus of a Complex Variable
    DeMoivre’s Theorem
    Jordan Curve Theorem
    Cauchy’s Theorem
    Liouville’s Theorem
    Dominated Convergence Theorem
    29: 18.30 Associated OP’s
    Associated polynomials and the related corecursive polynomials appear in Ismail (2009, §§2.3, 2.6, and 2.10), where the relationship of OP’s to continued fractions is made evident. … The p n ( 0 ) ( x ) are also referred to as the numerator polynomials, the p n ( x ) then being the denominator polynomials, in that the n -th approximant of the continued fraction, z , …
    Markov’s Theorem
    The ratio p n ( 0 ) ( z ) / p n ( z ) , as defined here, thus provides the same statement of Markov’s Theorem, as in (18.2.9_5), but now in terms of differently obtained numerator and denominator polynomials. … See Ismail (2009, p. 46 ), where the k th corecursive polynomial is also related to an appropriate continued fraction, given here as its n th convergent, …
    30: 27.15 Chinese Remainder Theorem
    §27.15 Chinese Remainder Theorem
    The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …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. …