About the Project

fractional

AdvancedHelp

(0.001 seconds)

31—40 of 114 matching pages

31: 7.22 Methods of Computation
Additional references are Matta and Reichel (1971) for the application of the trapezoidal rule, for example, to the first of (7.7.2), and Gautschi (1970) and Cuyt et al. (2008) for continued fractions. …
32: 12.1 Special Notation
Unless otherwise noted, primes indicate derivatives with respect to the variable, and fractional powers take their principal values. …
33: 19.13 Integrals of Elliptic Integrals
Cvijović and Klinowski (1994) contains fractional integrals (with free parameters) for F ( ϕ , k ) and E ( ϕ , k ) , together with special cases. …
34: 27.19 Methods of Computation: Factorization
These algorithms include the Continued Fraction Algorithm (cfrac), the Multiple Polynomial Quadratic Sieve (mpqs), the General Number Field Sieve (gnfs), and the Special Number Field Sieve (snfs). …
35: Bibliography J
  • L. Jacobsen, W. B. Jones, and H. Waadeland (1986) Further results on the computation of incomplete gamma functions. In Analytic Theory of Continued Fractions, II (Pitlochry/Aviemore, 1985), W. J. Thron (Ed.), Lecture Notes in Math. 1199, pp. 67–89.
  • W. B. Jones and W. J. Thron (1974) Numerical stability in evaluating continued fractions. Math. Comp. 28 (127), pp. 795–810.
  • W. B. Jones and W. J. Thron (1980) Continued Fractions: Analytic Theory and Applications. Encyclopedia of Mathematics and its Applications, Vol. 11, Addison-Wesley Publishing Co., Reading, MA.
  • W. B. Jones and W. Van Assche (1998) Asymptotic behavior of the continued fraction coefficients of a class of Stieltjes transforms including the Binet function. In Orthogonal functions, moment theory, and continued fractions (Campinas, 1996), Lecture Notes in Pure and Appl. Math., Vol. 199, pp. 257–274.
  • 36: 5.15 Polygamma Functions
    For B 2 k see §24.2(i). For continued fractions for ψ ( z ) and ψ ′′ ( z ) see Cuyt et al. (2008, pp. 231–238).
    37: 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. …
    38: 22.12 Expansions in Other Trigonometric Series and Doubly-Infinite Partial Fractions: Eisenstein Series
    §22.12 Expansions in Other Trigonometric Series and Doubly-Infinite Partial Fractions: Eisenstein Series
    22.12.13 2 K cs ( 2 K t , k ) = lim N n = N N ( 1 ) n π tan ( π ( t n τ ) ) = lim N n = N N ( 1 ) n ( lim M m = M M 1 t m n τ ) .
    39: 2.6 Distributional Methods
    §2.6(iii) Fractional Integrals
    The Riemann–Liouville fractional integral of order μ is defined by
    2.6.33 𝐼 μ f ( x ) = 1 Γ ( μ ) 0 x ( x t ) μ 1 f ( t ) d t , μ > 0 ;
    2.6.35 𝐼 μ f ( x ) = 1 Γ ( μ ) ( t μ 1 f ) ( x ) .
    If both f and g in (2.6.34) have asymptotic expansions of the form (2.6.9), then the distribution method can also be used to derive an asymptotic expansion of the convolution f g ; see Li and Wong (1994). …
    40: 3.1 Arithmetics and Error Measures
    A nonzero normalized binary floating-point machine number x is represented as …where s is equal to 1 or 0 , each b j , j 1 , is either 0 or 1 , b 1 is the most significant bit, p ( ) is the number of significant bits b j , b p 1 is the least significant bit, E is an integer called the exponent, b 0 . b 1 b 2 b p 1 is the significand, and f = . b 1 b 2 b p 1 is the fractional part. …