enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Euler–Maclaurin formula - Wikipedia

    en.wikipedia.org/wiki/Euler–Maclaurin_formula

    For example, many asymptotic expansions are derived from the formula, and Faulhaber's formula for the sum of powers is an immediate consequence. The formula was discovered independently by Leonhard Euler and Colin Maclaurin around 1735. Euler needed it to compute slowly converging infinite series while Maclaurin used it to calculate integrals.

  3. Error function - Wikipedia

    en.wikipedia.org/wiki/Error_function

    For any real x, Newton's method can be used to compute erfi −1 x, and for −1 ≤ x ≤ 1, the following Maclaurin series converges: ⁡ = = + +, where c k is defined as above. Asymptotic expansion

  4. Integral test for convergence - Wikipedia

    en.wikipedia.org/wiki/Integral_test_for_convergence

    In mathematics, the integral test for convergence is a method used to test infinite series of monotonic terms for convergence. It was developed by Colin Maclaurin and Augustin-Louis Cauchy and is sometimes known as the Maclaurin–Cauchy test .

  5. Taylor series - Wikipedia

    en.wikipedia.org/wiki/Taylor_series

    It was not until 1715 that a general method for constructing these series for all functions for which they exist was finally published by Brook Taylor, [8] after whom the series are now named. The Maclaurin series was named after Colin Maclaurin, a Scottish mathematician, who published a special case of the Taylor result in the mid-18th century.

  6. Lists of integrals - Wikipedia

    en.wikipedia.org/wiki/Lists_of_integrals

    An even larger, multivolume table is the Integrals and Series by Prudnikov, Brychkov, and Marichev (with volumes 1–3 listing integrals and series of elementary and special functions, volume 4–5 are tables of Laplace transforms).

  7. 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.

  8. Asymptotic expansion - Wikipedia

    en.wikipedia.org/wiki/Asymptotic_expansion

    The theory of asymptotic series was created by Poincaré (and independently by Stieltjes) in 1886. [1] The most common type of asymptotic expansion is a power series in either positive or negative powers. Methods of generating such expansions include the Euler–Maclaurin summation formula and integral transforms such as the Laplace and Mellin ...

  9. Small-angle approximation - Wikipedia

    en.wikipedia.org/wiki/Small-angle_approximation

    The most direct method is to truncate the Maclaurin series for each of the trigonometric functions. Depending on the order of the approximation , cos ⁡ θ {\displaystyle \textstyle \cos \theta } is approximated as either 1 {\displaystyle 1} or as 1 − 1 2 θ 2 {\textstyle 1-{\frac {1}{2}}\theta ^{2}} .