Search results
Results From The WOW.Com Content Network
The Taylor series of any polynomial is the polynomial itself.. The Maclaurin series of 1 / 1 − x is the geometric series + + + +. So, by substituting x for 1 − x, the Taylor series of 1 / x at a = 1 is
The coefficients of a Taylor series of any rational function satisfy a linear recurrence relation, which can be found by equating the rational function to a Taylor series with indeterminate coefficients, and collecting like terms after clearing the denominator. For example,
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.
For a smooth function, the Taylor polynomial is the truncation at the order of the Taylor series of the function. The first-order Taylor polynomial is the linear approximation of the function, and the second-order Taylor polynomial is often referred to as the quadratic approximation. [1] There are several versions of Taylor's theorem, some ...
The digamma has a rational zeta series, given by the Taylor series at ... is the Riemann zeta function. This series is easily derived from the corresponding Taylor's ...
Since a Padé approximant is a rational function, an artificial singular point may occur as an approximation, but this can be avoided by Borel–Padé analysis. The reason the Padé approximant tends to be a better approximation than a truncating Taylor series is clear from the viewpoint of the multi-point summation method.
In probability theory, it is possible to approximate the moments of a function f of a random variable X using Taylor expansions, provided that f is sufficiently differentiable and that the moments of X are finite. A simulation-based alternative to this approximation is the application of Monte Carlo simulations.
The importance of the partial fraction decomposition lies in the fact that it provides algorithms for various computations with rational functions, including the explicit computation of antiderivatives, [2] Taylor series expansions, inverse Z-transforms, and inverse Laplace transforms.