enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Cauchy's convergence test - Wikipedia

    en.wikipedia.org/wiki/Cauchy's_convergence_test

    The Cauchy convergence test is a method used to test infinite series for convergence. It relies on bounding sums of terms in the series. It relies on bounding sums of terms in the series. This convergence criterion is named after Augustin-Louis Cauchy who published it in his textbook Cours d'Analyse 1821.

  3. List of mathematical series - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_series

    An infinite series of any rational function of can be reduced to a finite series of polygamma functions, by use of partial fraction decomposition, [8] as explained here. This fact can also be applied to finite series of rational functions, allowing the result to be computed in constant time even when the series contains a large number of terms.

  4. Ramanujan summation - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_summation

    Ramanujan summation is a technique invented by the mathematician Srinivasa Ramanujan for assigning a value to divergent infinite series.Although the Ramanujan summation of a divergent series is not a sum in the traditional sense, it has properties that make it mathematically useful in the study of divergent infinite series, for which conventional summation is undefined.

  5. Residue theorem - Wikipedia

    en.wikipedia.org/wiki/Residue_theorem

    The fact that π cot(πz) has simple poles with residue 1 at each integer can be used to compute the sum = (). Consider, for example, f(z) = z −2. Let Γ N be the rectangle that is the boundary of [−N − ⁠ 1 / 2 ⁠, N + ⁠ 1 / 2 ⁠] 2 with positive orientation, with an integer N. By the residue formula,

  6. Lazy evaluation - Wikipedia

    en.wikipedia.org/wiki/Lazy_evaluation

    The actual values are only computed when needed. For example, one could create a function that creates an infinite list (often called a stream) of Fibonacci numbers. The calculation of the n-th Fibonacci number would be merely the extraction of that element from the infinite list, forcing the evaluation of only the first n members of the list.

  7. Generating function - Wikipedia

    en.wikipedia.org/wiki/Generating_function

    As another example of using generating functions to relate sequences and manipulate sums, for an arbitrary sequence f n we define the two sequences of sums := = ~:= = (+) (+) (+), for all n ≥ 0, and seek to express the second sums in terms of the first. We suggest an approach by generating functions.

  8. Euler–Maclaurin formula - Wikipedia

    en.wikipedia.org/wiki/Euler–Maclaurin_formula

    It can be used to approximate integrals by finite sums, or conversely to evaluate finite sums and infinite series using integrals and the machinery of calculus. For example, many asymptotic expansions are derived from the formula, and Faulhaber's formula for the sum of powers is an immediate consequence.

  9. Kahan summation algorithm - Wikipedia

    en.wikipedia.org/wiki/Kahan_summation_algorithm

    For example, if the summands are uncorrelated random numbers with zero mean, the sum is a random walk, and the condition number will grow proportional to . On the other hand, for random inputs with nonzero mean the condition number asymptotes to a finite constant as n → ∞ {\displaystyle n\to \infty } .