enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lentz's algorithm - Wikipedia

    en.wikipedia.org/wiki/Lentz's_algorithm

    In addition, continued fraction representations for both ratios of Bessel functions and spherical Bessel functions of consecutive order themselves can be computed with Lentz's algorithm. [5] The algorithm suggested that it is possible to terminate the evaluation of continued fractions when | f j − f j − 1 | {\displaystyle |f_{j}-f_{j-1 ...

  3. Gauss–Laguerre quadrature - Wikipedia

    en.wikipedia.org/wiki/Gauss–Laguerre_quadrature

    More generally, one can also consider integrands that have a known power-law singularity at x=0, for some real number >, leading to integrals of the form: + (). In this case, the weights are given [2] in terms of the generalized Laguerre polynomials:

  4. Fractional calculus - Wikipedia

    en.wikipedia.org/wiki/Fractional_calculus

    To find the α th order derivative, the n th order derivative of the integral of order (n − α) is computed, where n is the smallest integer greater than α (that is, n = ⌈α⌉). The Riemann–Liouville fractional derivative and integral has multiple applications such as in case of solutions to the equation in the case of multiple systems ...

  5. Euler's continued fraction formula - Wikipedia

    en.wikipedia.org/wiki/Euler's_continued_fraction...

    Euler derived the formula as connecting a finite sum of products with a finite continued fraction. (+ (+ (+))) = + + + + = + + + +The identity is easily established by induction on n, and is therefore applicable in the limit: if the expression on the left is extended to represent a convergent infinite series, the expression on the right can also be extended to represent a convergent infinite ...

  6. Floor and ceiling functions - Wikipedia

    en.wikipedia.org/wiki/Floor_and_ceiling_functions

    Given real numbers x and y, integers m and n and the set of integers, floor and ceiling may be defined by the equations ⌊ ⌋ = {}, ⌈ ⌉ = {}. Since there is exactly one integer in a half-open interval of length one, for any real number x, there are unique integers m and n satisfying the equation

  7. Fractionation - Wikipedia

    en.wikipedia.org/wiki/Fractionation

    [1] [2] Fractions are collected based on differences in a specific property of the individual components. A common trait in fractionations is the need to find an optimum between the amount of fractions collected and the desired purity in each fraction. Fractionation makes it possible to isolate more than two components in a mixture in a single run.

  8. Heaviside cover-up method - Wikipedia

    en.wikipedia.org/wiki/Heaviside_cover-up_method

    When a partial fraction term has a single (i.e. unrepeated) binomial in the denominator, the numerator is a residue of the function defined by the input fraction. We calculate each respective numerator by (1) taking the root of the denominator (i.e. the value of x that makes the denominator zero) and (2) then substituting this root into the ...

  9. Field of fractions - Wikipedia

    en.wikipedia.org/wiki/Field_of_fractions

    The field of fractions of an integral domain is sometimes denoted by ⁡ or ⁡ (), and the construction is sometimes also called the fraction field, field of quotients, or quotient field of . All four are in common usage, but are not to be confused with the quotient of a ring by an ideal , which is a quite different concept.