TAYLOR_SERIES
(Redirected from Taylor expansion)
In mathematics, the 'Taylor series' is a representation of a function as an infinite sum of terms calculated from the values of its derivatives at a single point. It may be regarded as the limit of the Taylor polynomials. Taylor series are named in honour of English mathematician Brook Taylor. If the series uses the derivatives at zero, the series is also called a 'Maclaurin series', named after Scottish mathematician Colin Maclaurin.
The Taylor series of a real or complex function ''f'' that is infinitely differentiable in a neighbourhood of a real or complex number ''a'', is the power series
:
which in a more compact form can be written
:
where ''n''! is the factorial of ''n'' and ''f'' (''n'')(''a'') denotes the ''n''th derivative of ''f'' at the point ''a''; the zeroth derivative of ''f'' is defined to be ''f'' itself and is defined to be 1.
The Maclaurin series for any polynomial is the polynomial itself.
The Maclaurin series for is the geometric series
:
so the Taylor series for at is
:
By integrating the above Maclaurin series we find the Maclaurin series for :
:
and the corresponding Taylor series for at is
:
The Maclaurin series for the exponential function at is
:
The above expansion holds because the derivative of is also and equals 1. This leaves the terms in the numerator and n! in the denominator for each term in the infinite sum.
The Maclaurin series for is
:
The Taylor series need not in general be a convergent series, but often it is.
The limit of a convergent Taylor series need not in general be equal to the function value ''f''(''x'') , but often it is. If ''f''(''x'') is equal to its Taylor series in a neighbourhood of ''a'', it is said to be analytic in this neighborhood. If ''f''(''x'') is equal to its Taylor series everywhere it is called entire. The exponential function and the trigonometric functions sine and cosine are examples of such functions. Examples of functions that are not entire include the logarithm, the trigonometric function tangent, and its inverse arctan. For these functions the Taylor series do not even converge if ''x'' is far from ''a''.
A Taylor series can be used to calculate the value of an entire function in every point, if the value of the function, and of all of its derivatives, is known at a single point. Uses of the Taylor series for entire functions include:
# The partial sums (the Taylor polynomials) of the series can be used as approximations of the entire function. These approximations are good if sufficiently many terms are included.
# The series representation simplifies many mathematical proofs.
Pictured on the right is an accurate approximation of sin(''x'') around the point ''a'' = 0. The pink curve is a polynomial of degree seven:
:
The error in this approximation is no more than . In particular, for , the error is less than 0.000003.
The Pythagorean philosopher Zeno considered the problem of summing an infinite series to achieve a finite result, but rejected it as an impossibility: the result was Zeno's paradox. Later, Aristotle proposed a philosophical resolution of the paradox, but the mathematical content was apparently unresolved until taken up by Democritus and then Archimedes. It was through Archimedes's method of exhaustion that an infinite number of progressive subdivisions could be performed to achieve a finite trigonometric result.[1] Liu Hui independently employed a similar method several centuries later.[2]
In the 14th century, the earliest examples of the use of Taylor series and closely-related methods were given by Madhava of Sangamagrama.[3] Though no record of his work survives, writings of later Indian mathematicians suggest that he found a number of special cases of the Taylor series, including those for the trigonometric functions of sine, cosine, tangent, and arctangent. The Kerala school of astronomy and mathematics further expanded his works with various series expansions and rational approximations until the 16th century.
In the 17th century, James Gregory also worked in this area and published several Maclaurin series. It was not until 1715 however that a general method for constructing these series for all functions for which they exist was finally provided by Brook Taylor, after whom the series are now named.
The Maclaurin series was named after Colin Maclaurin, a professor in Edinburgh, who published the special case of the Taylor result in the 18th century.
If this series converges for every ''x'' in the interval (''a'' − ''r'', ''a'' + ''r'') and the sum is equal to ''f''(''x''), then the function ''f''(''x'') is said to be 'analytic in the interval' (''a'' − ''r'', ''a'' + ''r''). If this is true for any ''r'' then the function is said to be an 'entire function'. To check whether the series converges towards ''f''(''x''), one normally uses estimates for the remainder term of Taylor's theorem. A function is analytic if and only if it can be represented as a power series; the coefficients in that power series are then necessarily the ones given in the above Taylor series formula.
The importance of such a power series representation is at least fourfold. First, differentiation and integration of power series can be performed term by term and is hence particularly easy. Second, an analytic function can be uniquely extended to a holomorphic function defined on an open disk in the complex plane, which makes the whole machinery of complex analysis available. Third, the (truncated) series can be used to compute function values approximately (often by recasting the polynomial into the Chebyshev form and evaluating it with the Clenshaw algorithm).
Fourth, algebraic operations can often be done much more readily on the power series representation; for instance the simplest proof of Euler's formula uses the Taylor series expansions for sine, cosine, and exponential functions. This result is of fundamental importance in such fields as harmonic analysis.
Note that there are examples of infinitely differentiable functions ''f''(''x'') whose Taylor series converge, but are ''not'' equal to ''f''(''x''). For instance, for the function defined piecewise by saying that ''f''(''x'') = e−1/''x''² if ''x'' ≠ 0 and ''f''(0) = 0, all the derivatives are zero at ''x'' = 0, so the Taylor series of ''f''(''x'') is zero everywhere, and its radius of convergence is infinite, even though the function most definitely is not zero everywhere. This particular pathology does not afflict complex-valued functions of a complex variable. Notice that e−1/''z''² does not approach 0 as ''z'' approaches 0 along the imaginary axis.
Some functions cannot be written as Taylor series because they have a singularity; in these cases, one can often still achieve a series expansion if one allows also negative powers of the variable ''x''; see Laurent series. For example, ''f''(''x'') = e−1/''x''² can be written as a Laurent series.
The Parker-Sochacki method is a recent advance in finding Taylor series which are solutions to differential equations. This algorithm is an extension of the Picard iteration.

Several important Maclaurin series expansions follow. All these expansions are valid for complex arguments .
Square root:
:
Exponential function and natural logarithm:
:
:
Geometric series:
:
Binomial theorem:
:
:where
Trigonometric functions:
:
:
:
::where the ''B''s are Bernoulli numbers.
:
:
:
Hyperbolic functions:
:
:
:
:
:
Several methods exist for the calculation of Taylor series of a large number of functions. One can attempt to use the Taylor series as-is and generalize the form of the coefficients, or one can use manipulations such as substitution, multiplication or division, addition or subtraction of standard Taylor series to construct the Taylor series of a function, by virtue of Taylor series being power series. In some cases, one can also derive the Taylor series by repeatedly applying integration by parts. Particularly convenient is the use of computer algebra systems to calculate Taylor series.
Compute the 6'th degree Maclaurin polynomial for the function
: .
We have for the natural logarithm
:
and for the cosine function
:
Substitute the second series into the first, omitting terms of higher than the 6'th degree, and reducing
:
:
:
Suppose we want the Taylor series at 0 of the function
:
We have for the exponential function
:
and, as in the first example,
:
Assume the power series is
:
Then multiplication with the denominator and substitution of the series of the cosine yields
:
Collecting the terms up to fourth order yields
:
Comparing coefficients with the above series of the exponential function yields the desired Taylor series
:
Classically, the above functions are defined by some property that holds for them. For example, the exponential function is defined as the function that is equal to its own derivative. However, in computable analysis, functions must be defined by algorithms rather than properties, so the above Taylor expansions are used as primary definitions rather than derived results. This is also likely to be the case in software implementations of the functions.
Using Taylor series, one may define analytical functions of matrices and operators, such as matrix exponential or matrix logarithm.
The Taylor series may also be generalised to functions of more than one variable with
:
For example, for a function that depends on two variables, ''x'' and ''y'', the Taylor series to second order about the point (''a'', ''b'') is:
:
::
:::
A second-order Taylor series expansion of a scalar-valued function of more than one variable can be compactly written as
:
where is the gradient and is the Hessian matrix (not to be confused with the Laplacian, which sometimes has the same notation). Applying the multi-index notation the Taylor series for several variables becomes
:
in full analogy to the single variable case.
★ Laurent series
★ Holomorphic functions are analytic — a proof that a holomorphic function can be expressed as a Taylor power series
★ Newton's divided difference interpolation
★ Madhava of Sangamagrama (credited with the first use of "Taylor" series)
★ Difference engine
1. Kline, M. (1990) ''Mathematical Thought from Ancient to Modern Times''. Oxford University Press. pp. 35-37.
2. Boyer, C. and Merzbach, U. (1991) ''A History of Mathematics''. John Wiley and Sons. pp. 202-203.
3. Neither Newton nor Leibniz - The Pre-History of Calculus and Celestial Mechanics in Medieval Kerala
★ Calculus and Analytic Geometry (9th ed.), Thomas, George B. Jr.; Finney, Ross L., , , Addison Wesley, 1996, ISBN 0-201-53174-7
★ Advanced Engineering Mathematics (2nd ed.), Greenberg, Michael, , , Prentice Hall, 1998, ISBN 0-13-321431-1
★
★ Madhava of Sangamagramma
★ Taylor Series Representation Module by John H. Mathews
★ "Discussion of the Parker-Sochacki Method"
★ Why so much fuss about Taylor Series Expansion?
★ Another Taylor visualisation - where you can choose the point of the approximation and the number of derivatives
In mathematics, the 'Taylor series' is a representation of a function as an infinite sum of terms calculated from the values of its derivatives at a single point. It may be regarded as the limit of the Taylor polynomials. Taylor series are named in honour of English mathematician Brook Taylor. If the series uses the derivatives at zero, the series is also called a 'Maclaurin series', named after Scottish mathematician Colin Maclaurin.
Definition
The Taylor series of a real or complex function ''f'' that is infinitely differentiable in a neighbourhood of a real or complex number ''a'', is the power series
:
which in a more compact form can be written
:
where ''n''! is the factorial of ''n'' and ''f'' (''n'')(''a'') denotes the ''n''th derivative of ''f'' at the point ''a''; the zeroth derivative of ''f'' is defined to be ''f'' itself and is defined to be 1.
Examples
The Maclaurin series for any polynomial is the polynomial itself.
The Maclaurin series for is the geometric series
:
so the Taylor series for at is
:
By integrating the above Maclaurin series we find the Maclaurin series for :
:
and the corresponding Taylor series for at is
:
The Maclaurin series for the exponential function at is
:
The above expansion holds because the derivative of is also and equals 1. This leaves the terms in the numerator and n! in the denominator for each term in the infinite sum.
The Maclaurin series for is
:
Convergence
The Taylor series need not in general be a convergent series, but often it is.
The limit of a convergent Taylor series need not in general be equal to the function value ''f''(''x'') , but often it is. If ''f''(''x'') is equal to its Taylor series in a neighbourhood of ''a'', it is said to be analytic in this neighborhood. If ''f''(''x'') is equal to its Taylor series everywhere it is called entire. The exponential function and the trigonometric functions sine and cosine are examples of such functions. Examples of functions that are not entire include the logarithm, the trigonometric function tangent, and its inverse arctan. For these functions the Taylor series do not even converge if ''x'' is far from ''a''.
A Taylor series can be used to calculate the value of an entire function in every point, if the value of the function, and of all of its derivatives, is known at a single point. Uses of the Taylor series for entire functions include:
# The partial sums (the Taylor polynomials) of the series can be used as approximations of the entire function. These approximations are good if sufficiently many terms are included.
# The series representation simplifies many mathematical proofs.
Pictured on the right is an accurate approximation of sin(''x'') around the point ''a'' = 0. The pink curve is a polynomial of degree seven:
:
The error in this approximation is no more than . In particular, for , the error is less than 0.000003.
History
The Pythagorean philosopher Zeno considered the problem of summing an infinite series to achieve a finite result, but rejected it as an impossibility: the result was Zeno's paradox. Later, Aristotle proposed a philosophical resolution of the paradox, but the mathematical content was apparently unresolved until taken up by Democritus and then Archimedes. It was through Archimedes's method of exhaustion that an infinite number of progressive subdivisions could be performed to achieve a finite trigonometric result.[1] Liu Hui independently employed a similar method several centuries later.[2]
In the 14th century, the earliest examples of the use of Taylor series and closely-related methods were given by Madhava of Sangamagrama.[3] Though no record of his work survives, writings of later Indian mathematicians suggest that he found a number of special cases of the Taylor series, including those for the trigonometric functions of sine, cosine, tangent, and arctangent. The Kerala school of astronomy and mathematics further expanded his works with various series expansions and rational approximations until the 16th century.
In the 17th century, James Gregory also worked in this area and published several Maclaurin series. It was not until 1715 however that a general method for constructing these series for all functions for which they exist was finally provided by Brook Taylor, after whom the series are now named.
The Maclaurin series was named after Colin Maclaurin, a professor in Edinburgh, who published the special case of the Taylor result in the 18th century.
Properties
If this series converges for every ''x'' in the interval (''a'' − ''r'', ''a'' + ''r'') and the sum is equal to ''f''(''x''), then the function ''f''(''x'') is said to be 'analytic in the interval' (''a'' − ''r'', ''a'' + ''r''). If this is true for any ''r'' then the function is said to be an 'entire function'. To check whether the series converges towards ''f''(''x''), one normally uses estimates for the remainder term of Taylor's theorem. A function is analytic if and only if it can be represented as a power series; the coefficients in that power series are then necessarily the ones given in the above Taylor series formula.
The importance of such a power series representation is at least fourfold. First, differentiation and integration of power series can be performed term by term and is hence particularly easy. Second, an analytic function can be uniquely extended to a holomorphic function defined on an open disk in the complex plane, which makes the whole machinery of complex analysis available. Third, the (truncated) series can be used to compute function values approximately (often by recasting the polynomial into the Chebyshev form and evaluating it with the Clenshaw algorithm).
Fourth, algebraic operations can often be done much more readily on the power series representation; for instance the simplest proof of Euler's formula uses the Taylor series expansions for sine, cosine, and exponential functions. This result is of fundamental importance in such fields as harmonic analysis.
Note that there are examples of infinitely differentiable functions ''f''(''x'') whose Taylor series converge, but are ''not'' equal to ''f''(''x''). For instance, for the function defined piecewise by saying that ''f''(''x'') = e−1/''x''² if ''x'' ≠ 0 and ''f''(0) = 0, all the derivatives are zero at ''x'' = 0, so the Taylor series of ''f''(''x'') is zero everywhere, and its radius of convergence is infinite, even though the function most definitely is not zero everywhere. This particular pathology does not afflict complex-valued functions of a complex variable. Notice that e−1/''z''² does not approach 0 as ''z'' approaches 0 along the imaginary axis.
Some functions cannot be written as Taylor series because they have a singularity; in these cases, one can often still achieve a series expansion if one allows also negative powers of the variable ''x''; see Laurent series. For example, ''f''(''x'') = e−1/''x''² can be written as a Laurent series.
The Parker-Sochacki method is a recent advance in finding Taylor series which are solutions to differential equations. This algorithm is an extension of the Picard iteration.
List of Taylor series of some common functions
An 8th degree approximation of the cosine function in the complex plane.
Several important Maclaurin series expansions follow. All these expansions are valid for complex arguments .
Square root:
:
Exponential function and natural logarithm:
:
:
Geometric series:
:
Binomial theorem:
:
:where
Trigonometric functions:
:
:
:
::where the ''B''s are Bernoulli numbers.
:
:
:
Hyperbolic functions:
:
:
:
:
:
Lambert's W function:
:
The numbers ''B''''k'' appearing in the ''summation'' expansions of tan(''x'') and tanh(''x'') are the Bernoulli numbers. The binomial expansion uses binomial coefficients. The ''E''''k'' in the expansion of sec(''x'') are Euler numbers.
Calculation of Taylor series
Several methods exist for the calculation of Taylor series of a large number of functions. One can attempt to use the Taylor series as-is and generalize the form of the coefficients, or one can use manipulations such as substitution, multiplication or division, addition or subtraction of standard Taylor series to construct the Taylor series of a function, by virtue of Taylor series being power series. In some cases, one can also derive the Taylor series by repeatedly applying integration by parts. Particularly convenient is the use of computer algebra systems to calculate Taylor series.
First example
Compute the 6'th degree Maclaurin polynomial for the function
: .
We have for the natural logarithm
:
and for the cosine function
:
Substitute the second series into the first, omitting terms of higher than the 6'th degree, and reducing
:
:
:
Second example
Suppose we want the Taylor series at 0 of the function
:
We have for the exponential function
:
and, as in the first example,
:
Assume the power series is
:
Then multiplication with the denominator and substitution of the series of the cosine yields
:
Collecting the terms up to fourth order yields
:
Comparing coefficients with the above series of the exponential function yields the desired Taylor series
:
Taylor series as definitions
Classically, the above functions are defined by some property that holds for them. For example, the exponential function is defined as the function that is equal to its own derivative. However, in computable analysis, functions must be defined by algorithms rather than properties, so the above Taylor expansions are used as primary definitions rather than derived results. This is also likely to be the case in software implementations of the functions.
Using Taylor series, one may define analytical functions of matrices and operators, such as matrix exponential or matrix logarithm.
Taylor series for several variables
The Taylor series may also be generalised to functions of more than one variable with
:
For example, for a function that depends on two variables, ''x'' and ''y'', the Taylor series to second order about the point (''a'', ''b'') is:
:
::
:::
A second-order Taylor series expansion of a scalar-valued function of more than one variable can be compactly written as
:
where is the gradient and is the Hessian matrix (not to be confused with the Laplacian, which sometimes has the same notation). Applying the multi-index notation the Taylor series for several variables becomes
:
in full analogy to the single variable case.
See also
★ Laurent series
★ Holomorphic functions are analytic — a proof that a holomorphic function can be expressed as a Taylor power series
★ Newton's divided difference interpolation
★ Madhava of Sangamagrama (credited with the first use of "Taylor" series)
★ Difference engine
Notes
1. Kline, M. (1990) ''Mathematical Thought from Ancient to Modern Times''. Oxford University Press. pp. 35-37.
2. Boyer, C. and Merzbach, U. (1991) ''A History of Mathematics''. John Wiley and Sons. pp. 202-203.
3. Neither Newton nor Leibniz - The Pre-History of Calculus and Celestial Mechanics in Medieval Kerala
References
★ Calculus and Analytic Geometry (9th ed.), Thomas, George B. Jr.; Finney, Ross L., , , Addison Wesley, 1996, ISBN 0-201-53174-7
★ Advanced Engineering Mathematics (2nd ed.), Greenberg, Michael, , , Prentice Hall, 1998, ISBN 0-13-321431-1
External links
★
★ Madhava of Sangamagramma
★ Taylor Series Representation Module by John H. Mathews
★ "Discussion of the Parker-Sochacki Method"
★ Why so much fuss about Taylor Series Expansion?
★ Another Taylor visualisation - where you can choose the point of the approximation and the number of derivatives
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español