GetWiki
Taylor series
ARTICLE SUBJECTS
being →
database →
ethics →
fiction →
history →
internet →
language →
linux →
logic →
method →
news →
policy →
purpose →
religion →
science →
software →
truth →
unix →
wiki →
ARTICLE TYPES
essay →
feed →
help →
system →
wiki →
ARTICLE ORIGINS
critical →
forked →
imported →
original →
Taylor series
please note:
 the content below is remote from Wikipedia
 it has been imported raw for GetWiki
{{forother notions of series expansionSeries (mathematics)}}{{good article}}(File:sintay_SVG.svgthumb300pxAs the degree of the Taylor polynomial rises, it approaches the correct function. This image shows {{mathsin x}} and its Taylor approximations, polynomials of degree 1, 3, 5, 7, 9, 11 and 13.){{Calculus Series}}In mathematics, a Taylor series is a representation of a function as an infinite sum of terms that are calculated from the values of the function's derivatives at a single point.WEB, Canisius College, MAT 314,weblink Neither Newton nor Leibniz â€“ The PreHistory of Calculus and Celestial Mechanics in Medieval Kerala, 20060709, no,weblink" title="web.archive.org/web/20150223113517weblink">weblink 20150223, JOURNAL, Ancient Indian Mathematics â€“ A Conspectus, S. G. Dani, Resonance, 17, 3, 2012, 236â€“246, 10.1007/s120450120022y, {{Ranjan Roy, The Discovery of the Series Formula for Ï€ by Leibniz, Gregory and Nilakantha, Mathematics MagazineVol. 63, No. 5 (Dec., 1990), pp. 291306.}}In the West, the subject was formulated by the Scottish mathematician James Gregory and formally introduced by the English mathematician Brook Taylor in 1715. If the Taylor series is centered at zero, then that series is also called a Maclaurin series, after the Scottish mathematician Colin Maclaurin, who made extensive use of this special case of Taylor series in the 18th century.A function can be approximated by using a finite number of terms of its Taylor series. Taylor's theorem gives quantitative estimates on the error introduced by the use of such an approximation. The polynomial formed by taking some initial terms of the Taylor series is called a Taylor polynomial. The Taylor series of a function is the limit of that function's Taylor polynomials as the degree increases, provided that the limit exists. A function may not be equal to its Taylor series, even if its Taylor series converges at every point. A function that is equal to its Taylor series in an open interval (or a disc in the complex plane) is known as an analytic function in that interval. the content below is remote from Wikipedia
 it has been imported raw for GetWiki
Definition
The Taylor series of a real or complexvalued function {{mathf (x)}} that is infinitely differentiable at a real or complex number {{matha}} is the power series
f(a)+frac {f'(a)}{1!} (xa)+ frac{f(a)}{2!} (xa)^2+frac{f'(a)}{3!}(xa)^3+ cdots,
where {{mathn!}} denotes the factorial of {{mvarn}} and {{mathf{{isup(n)}}(a)}} denotes the {{mvarn}}th derivative of {{mvarf}} evaluated at the point {{mvara}}. In the more compact sigma notation, this can be written as
sum_{n=0} ^ {infty} frac {f^{(n)}(a)}{n!} (xa)^{n}.
The derivative of order zero of {{mvarf}} is defined to be {{mvarf}} itself and {{math(x âˆ’ a)0}} and {{math0!}} are both defined to be 1. When {{matha {{=}} 0}}, the series is also called a Maclaurin series.{{harvnbThomasFinney1996loc=Â§8.9}}Examples
The Taylor series for any polynomial is the polynomial itself.The Maclaurin series for {{math{{sfrac11 âˆ’ x}}}} is the geometric series
1+x+x^2+x^3+cdots
so the Taylor series for {{math{{sfrac1x}}}} at {{matha {{=}} 1}} is
1(x1)+(x1)^2(x1)^3+cdots.
By integrating the above Maclaurin series, we find the Maclaurin series for {{mathlog(1 âˆ’ x)}}, where log denotes the natural logarithm:
xtfrac{1}{2}x^2tfrac{1}{3}x^3tfrac{1}{4}x^4cdots
and the corresponding Taylor series for {{mathlog x}} at {{matha {{=}} 1}} is
(x1)tfrac{1}{2}(x1)^2+tfrac{1}{3}(x1)^3tfrac{1}{4}(x1)^4+cdots,
and more generally, the corresponding Taylor series for {{mathlog x}} at some {{matha {{=}} x0}} is:
log x_0 + frac{1}{x_0} ( x  x_0 )  frac{1}{x_0^2}frac{left( x  x_0 right)^2}{2} + cdots.
The Taylor series for the exponential function {{mathex}} at {{matha {{=}} 0}} is
begin{align}
sum_{n=0}^infty frac{x^n}{n!} &= frac{x^0}{0!} + frac{x^1}{1!} + frac{x^2}{2!} + frac{x^3}{3!} + frac{x^4}{4!} + frac{x^5}{5!}+ cdots
&= 1 + x + frac{x^2}{2} + frac{x^3}{6} + frac{x^4}{24} + frac{x^5}{120} + cdots.
end{align}
The above expansion holds because the derivative of {{mathe'x}} with respect to {{mvarx}} is also {{mathe'x}} and {{mathe0}} equals 1. This leaves the terms {{math(x âˆ’ 0)n}} in the numerator and {{mathn!}} in the denominator for each term in the infinite sum.&= 1 + x + frac{x^2}{2} + frac{x^3}{6} + frac{x^4}{24} + frac{x^5}{120} + cdots.
end{align}
History
The Greek philosopher Zeno considered the problem of summing an infinite series to achieve a finite result, but rejected it as an impossibility;BOOK, Lindberg, David, The Beginnings of Western Science, 2007, University of Chicago Press, 9780226482057, 33, 2nd, 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 Archimedes, as it had been prior to Aristotle by the Presocratic Atomist Democritus. It was through Archimedes's method of exhaustion that an infinite number of progressive subdivisions could be performed to achieve a finite result.BOOK, Kline, M., 1990, Mathematical Thought from Ancient to Modern Times, New York, Oxford University Press, 35â€“37, 0195061357, Liu Hui independently employed a similar method a few centuries later.BOOK, Boyer, C., Merzbach, U., Uta Merzbach, 1991, A History of Mathematics, John Wiley and Sons, Second revised, 202â€“203, 0471097632, In the 14th century, the earliest examples of the use of Taylor series and closely related methods were given by Madhava of Sangamagrama.WEB, Canisius College, MAT 314,weblink Neither Newton nor Leibniz â€“ The PreHistory of Calculus and Celestial Mechanics in Medieval Kerala, 20060709, no,weblink" title="web.archive.org/web/20150223113517weblink">weblink 20150223, JOURNAL, Ancient Indian Mathematics â€“ A Conspectus, S. G. Dani, Resonance, 17, 3, 2012, 236â€“246, 10.1007/s120450120022y, 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,BOOK, Latin, Taylor, Brook, Methodus Incrementorum Directa et Inversa, Direct and Reverse Methods of Incrementation, London, 1715, p. 21â€“23 (Prop. VII, Thm. 3, Cor. 2), Translated into English in BOOK, D. J., Struik, A Source Book in Mathematics 1200â€“1800, Cambridge, Massachusetts, Harvard University Press, 1969, 329â€“332, 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.Analytic functions
300pxthumbrightThe function {{math1=e(âˆ’1/x2)}} is not analytic at {{math1=x {{=}} 0}}: the Taylor series is identically 0, although the function is not.If {{mathf (x)}} is given by a convergent power series in an open disc (or interval in the real line) centred at {{mvarb}} in the complex plane, it is said to be analytic in this disc. Thus for {{mvarx}} in this disc, {{mvarf}} is given by a convergent power series
f(x) = sum_{n=0}^infty a_n(xb)^n.
Differentiating by {{mvarx}} the above formula {{mvarn}} times, then setting {{mathx {{=}} b}} gives:
frac{f^{(n)}(b)}{n!} = a_n
and so the power series expansion agrees with the Taylor series. Thus a function is analytic in an open disc centred at {{mvarb}} if and only if its Taylor series converges to the value of the function at each point of the disc.If {{mathf (x)}} is equal to its Taylor series for all {{mvarx}} in the complex plane, it is called entire. The polynomials, exponential function {{mathex}}, and the trigonometric functions sine and cosine, are examples of entire functions. Examples of functions that are not entire include the square root, the logarithm, the trigonometric function tangent, and its inverse, arctan. For these functions the Taylor series do not converge if {{mvarx}} is far from {{mvarb}}. That is, the Taylor series diverges at {{mvarx}} if the distance between {{mvarx}} and {{mvarb}} is larger than the radius of convergence. The Taylor series can be used to calculate the value of an entire function at every point, if the value of the function, and of all of its derivatives, are known at a single point.Uses of the Taylor series for analytic functions include:  The partial sums (the Taylor polynomials) of the series can be used as approximations of the function. These approximations are good if sufficiently many terms are included.
 Differentiation and integration of power series can be performed term by term and is hence particularly easy.
 An analytic function is uniquely extended to a holomorphic function on an open disk in the complex plane. This makes the machinery of complex analysis available.
 The (truncated) series can be used to compute function values numerically, (often by recasting the polynomial into the Chebyshev form and evaluating it with the Clenshaw algorithm).
 Algebraic operations can be done readily on the power series representation; for instance, Euler's formula follows from Taylor series expansions for trigonometric and exponential functions. This result is of fundamental importance in such fields as harmonic analysis]].
 Approximations using the first few terms of a Taylor series can make otherwise unsolvable problems possible for a restricted domain; this approach is often used in physics.
Approximation error and convergence
missing image!
 Taylorsine.svg">300pxthumbrightThe sine function (blue) is closely approximated by its Taylor polynomial of degree 7 (pink) for a full period centered at the origin.300pxthumbrightThe Taylor polynomials for {{mathlog(1 + x)}} only provide accurate approximations in the range {{mathâˆ’1 < x â‰¤ 1}}. For {{mathx > 1}}, Taylor polynomials of higher degree provide worse approximations.Logarithm GIF.gif 
Pictured on the right is an accurate approximation of {{mathsin x}} around the point {{mathx {{=}} 0}}. The pink curve is a polynomial of degree seven:
 Taylorsine.svg">300pxthumbrightThe sine function (blue) is closely approximated by its Taylor polynomial of degree 7 (pink) for a full period centered at the origin.300pxthumbrightThe Taylor polynomials for {{mathlog(1 + x)}} only provide accurate approximations in the range {{mathâˆ’1 < x â‰¤ 1}}. For {{mathx > 1}}, Taylor polynomials of higher degree provide worse approximations.Logarithm GIF.gif 
sinleft( x right) approx x  frac{x^3}{3!} + frac{x^5}{5!}  frac{x^7}{7!}.!
The error in this approximation is no more than {{math{{sfrac{{absx}}99!}}}}. In particular, for {{mathâˆ’1 < x < 1}}, the error is less than 0.000003.In contrast, also shown is a picture of the natural logarithm function {{mathlog(1 + x)}} and some of its Taylor polynomials around {{matha {{=}} 0}}. These approximations converge to the function only in the region {{mathâˆ’1 < x â‰¤ 1}}; outside of this region the higherdegree Taylor polynomials are worse approximations for the function. This is similar to Runge's phenomenon.{{cndate=November 2017}}The error incurred in approximating a function by its {{mvarn}}thdegree Taylor polynomial is called the remainder or residual and is denoted by the function {{mathRn(x)}}. Taylor's theorem can be used to obtain a bound on the size of the remainder.In general, Taylor series need not be convergent at all. And in fact the set of functions with a convergent Taylor series is a meager set in the FrÃ©chet space of smooth functions. And even if the Taylor series of a function {{mvarf}} does converge, its limit need not in general be equal to the value of the function {{mathf (x)}}. For example, the function
Generalization
There is, however, a generalization{{citationfirst=Williamlast=Fellerauthorlink=William Fellertitle=An introduction to probability theory and its applications, Volume 2edition=3rdpublisher=Wileyyear=1971pages=230â€“232}}.{{citationfirst1=Einarlast1=Hilleauthorlink1=Einar Hillefirst2=Ralph S.last2=Phillipsauthorlink2=Ralph S. Phillipstitle=Functional analysis and semigroupspublisher=American Mathematical Societyseries=AMS Colloquium Publicationsvolume=31year=1957pages=300â€“327}}. of the Taylor series that does converge to the value of the function itself for any bounded continuous function on {{math(0,âˆž)}}, using the calculus of finite differences. Specifically, one has the following theorem, due to Einar Hille, that for any {{matht > 0}},
lim_{hto 0^+}sum_{n=0}^infty frac{t^n}{n!}frac{Delta_h^nf(a)}{h^n} = f(a+t).
Here {{mathÎ”{{sup=nb=h}}}} is the {{mvarn}}th finite difference operator with step size {{mvarh}}. The series is precisely the Taylor series, except that divided differences appear in place of differentiation: the series is formally similar to the Newton series. When the function {{mvarf}} is analytic at {{mvara}}, the terms in the series converge to the terms of the Taylor series, and in this sense generalizes the usual Taylor series.In general, for any infinite sequence {{mathai}}, the following power series identity holds:
sum_{n=0}^inftyfrac{u^n}{n!}Delta^na_i = e^{u}sum_{j=0}^inftyfrac{u^j}{j!}a_{i+j}.
So in particular,
f(a+t) = lim_{hto 0^+} e^{frac{h}}sum_{j=0}^infty f(a+jh) frac{left(frac{h}right)^j}{j!}.
The series on the right is the expectation value of {{mathf (a + X)}}, where {{mvarX}} is a Poissondistributed random variable that takes the value {{mathjh}} with probability {{matheâˆ’t/hÂ·{{sfrac(t/h){{isupj}}j!}}}}. Hence,
f(a+t) = lim_{hto 0^+} int_{infty}^infty f(a+x)dP_{frac{h},h}(x).
The law of large numbers implies that the identity holds.BOOK, William Feller, William, Feller, An introduction to probability theory and its applications, 2, 3, 231, 1970, List of Maclaurin series of some common functions
{{see alsoList of mathematical series}}Several important Maclaurin series expansions follow.Most of these can be found in {{harvAbramowitzStegun1970}}. All these expansions are valid for complex arguments {{mvarx}}.Exponential function
File:Exp series.gifrightthumbThe ex}} (in blue), and the sum of the first {{mathn + 1}} terms of its Taylor series at 0 (in red).The exponential function e^x (with base {{mvare}}) has Maclaurin series
e^{x} = sum^{infty}_{n=0} frac{x^n}{n!} = 1 + x + frac{x^2}{2!} + frac{x^3}{3!} + cdots .
It converges for all {{mvarx}}.Natural logarithm
The natural logarithm (with base {{mvare}}) has Maclaurin series
begin{align}
log(1x) &=  sum^{infty}_{n=1} frac{x^n}n = x  frac{x^2}2  frac{x^3}3  cdots , log(1+x) &= sum^infty_{n=1} (1)^{n+1}frac{x^n}n = x  frac{x^2}2 + frac{x^3}3  cdots .end{align}They converge for x < 1. Also log(1x) converges for x=1 and log(1+x) converges for x=1.Geometric series
The geometric series and its derivatives have Maclaurin series
begin{align}
frac{1}{1x} &= sum^infty_{n=0} x^n frac{1}{(1x)^2} &= sum^infty_{n=1} nx^{n1}frac{1}{(1x)^3} &= sum^infty_{n=2} frac{(n1)n}{2} x^{n2}.end{align}All are convergent for x < 1. These are special cases of the binomial series given in the next section.Binomial series
The binomial series is the power series
(1+x)^alpha = sum_{n=0}^infty binom{alpha}{n} x^n
whose coefficients are the generalized binomial coefficients
binom{alpha}{n} = prod_{k=1}^n frac{alphak+1}k = frac{alpha(alpha1)cdots(alphan+1)}{n!}.
(If {{math n {{=}} 0}}, this product is an empty product and has value 1.) It converges for x < 1 for any real or complex number {{mvarÎ±}}.When {{mathÎ± {{=}} âˆ’1}}, this is essentially the infinite geometric series mentioned in the previous section. The special cases {{mathÎ± {{=}} {{sfrac12}}}} and {{mathÎ± {{=}} âˆ’{{sfrac12}}}} give the square root function and its inverse:
begin{align}
(1+x)^frac12 &= 1 + tfrac{1}{2}x  tfrac{1}{8}x^2 + tfrac{1}{16}x^3  tfrac{5}{128}x^4 + tfrac{7}{256}x^5  ldots, (1+x)^{frac12} &= 1 tfrac{1}{2}x + tfrac{3}{8}x^2  tfrac{5}{16}x^3 + tfrac{35}{128}x^4  tfrac{63}{256}x^5 + ldots.end{align}When only the linear term is retained, this simplifies to the binomial approximation.Trigonometric functions
The usual trigonometric functions and their inverses have the following Maclaurin series:
begin{align}
sin x &= sum^{infty}_{n=0} frac{(1)^n}{(2n+1)!} x^{2n+1} &&= x  frac{x^3}{3!} + frac{x^5}{5!}  cdots && text{for all } x[6pt]cos x &= sum^{infty}_{n=0} frac{(1)^n}{(2n)!} x^{2n} &&= 1  frac{x^2}{2!} + frac{x^4}{4!}  cdots && text{for all } x[6pt]tan x &= sum^{infty}_{n=1} frac{B_{2n} (4)^n left(14^nright)}{(2n)!} x^{2n1} &&= x + frac{x^3}{3} + frac{2 x^5}{15} + cdots && text{for }x < frac{pi}{2}[6pt]sec x &= sum^{infty}_{n=0} frac{(1)^n E_{2n}}{(2n)!} x^{2n} &&=1+frac{x^2}{2}+frac{5x^4}{24}+cdots && text{for }x < frac{pi}{2}[6pt]arcsin x &= sum^{infty}_{n=0} frac{(2n)!}{4^n (n!)^2 (2n+1)} x^{2n+1} &&=x+frac{x^3}{6}+frac{3x^5}{40}+cdots && text{for }x le 1[6pt]arccos x &=frac{pi}{2}arcsin x&=frac{pi}{2} sum^{infty}_{n=0} frac{(2n)!}{4^n (n!)^2 (2n+1)} x^{2n+1}&&=frac{pi}{2}xfrac{x^3}{6}frac{3x^5}{40}cdots&& text{for }x le 1[6pt]arctan x &= sum^{infty}_{n=0} frac{(1)^n}{2n+1} x^{2n+1} &&=xfrac{x^3}{3} + frac{x^5}{5}cdots && text{for }x le 1, xneqpm iend{align}All angles are expressed in radians. The numbers {{mathBk}} appearing in the expansions of {{mathtan x}} are the Bernoulli numbers. The {{mathEk}} in the expansion of {{mathsec x}} are Euler numbers.Hyperbolic functions
The hyperbolic functions have Maclaurin series closely related to the series for the corresponding trigonometric functions:
begin{align}
sinh x &= sum^{infty}_{n=0} frac{x^{2n+1}}{(2n+1)!} &&= x + frac{x^3}{3!} + frac{x^5}{5!} + cdots && text{for all } x[6pt]cosh x &= sum^{infty}_{n=0} frac{x^{2n}}{(2n)!} &&= 1 + frac{x^2}{2!} + frac{x^4}{4!} + cdots && text{for all } x[6pt]tanh x &= sum^{infty}_{n=1} frac{B_{2n} 4^n left(4^n1right)}{(2n)!} x^{2n1} &&= xfrac{x^3}{3}+frac{2x^5}{15}frac{17x^7}{315}+cdots && text{for }x < frac{pi}{2}[6pt]operatorname{arsinh} x &= sum^{infty}_{n=0} frac{(1)^n (2n)!}{4^n (n!)^2 (2n+1)} x^{2n+1} && && text{for }x le 1[6pt]operatorname{artanh} x &= sum^{infty}_{n=0} frac{x^{2n+1}}{2n+1} && && text{for }x le 1, xneqpm 1end{align}The numbers {{mathBk}} appearing in the series for {{mathtanh x}} are the Bernoulli 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 definition of the Taylor series, though this often requires generalizing the form of the coefficients according to a readily apparent pattern. Alternatively, 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
In order to compute the 7th degree Maclaurin polynomial for the function
f(x)=log(cos x),quad xinleft(frac{pi}{2},frac{pi}{2}right) ,
one may first rewrite the function as
f(x)=logbigl(1+(cos x1)bigr)!.
The Taylor series for the natural logarithm is (using the big O notation)
log(1+x) = x  frac{x^2}2 + frac{x^3}3 + {O}left(x^4right)!
and for the cosine function
cos x  1 = frac{x^2}2 + frac{x^4}{24}  frac{x^6}{720} + {O}left(x^8right)!.
The latter series expansion has a zero constant term, which enables us to substitute the second series into the first one and to easily omit terms of higher order than the 7th degree by using the big {{mvarO}} notation:
begin{align}f(x)&=logbigl(1+(cos x1)bigr)
&=(cos x1)  tfrac12(cos x1)^2 + tfrac13(cos x1)^3+ {O}left((cos x1)^4right)&=left(frac{x^2}2 + frac{x^4}{24}  frac{x^6}{720} +{O}left(x^8right)right)frac12left(frac{x^2}2+frac{x^4}{24}+{O}left(x^6right)right)^2+frac13left(frac{x^2}2+Oleft(x^4right)right)^3 + {O}left(x^8right) & =frac{x^2}2 + frac{x^4}{24}frac{x^6}{720}  frac{x^4}8 + frac{x^6}{48}  frac{x^6}{24} +Oleft(x^8right)& = frac{x^2}2  frac{x^4}{12}  frac{x^6}{45}+Oleft(x^8right). end{align}!Since the cosine is an even function, the coefficients for all the odd powers {{mathx, x3, x5, x7, ...}} have to be zero.Second example
Suppose we want the Taylor series at 0 of the function
g(x)=frac{e^x}{cos x}.!
We have for the exponential function
e^x = sum^infty_{n=0} frac{x^n}{n!} =1 + x + frac{x^2}{2!} + frac{x^3}{3!} + frac{x^4}{4!}+cdots!
and, as in the first example,
cos x = 1  frac{x^2}{2!} + frac{x^4}{4!}  cdots!
Assume the power series is
frac{e^x}{cos x} = c_0 + c_1 x + c_2 x^2 + c_3 x^3 + cdots!
Then multiplication with the denominator and substitution of the series of the cosine yields
begin{align} e^x &= left(c_0 + c_1 x + c_2 x^2 + c_3 x^3 + cdotsright)cos x
&=left(c_0 + c_1 x + c_2 x^2 + c_3 x^3 + c_4x^4 + cdotsright)left(1  frac{x^2}{2!} + frac{x^4}{4!}  cdotsright)&=c_0  frac{c_0}{2}x^2 + frac{c_0}{4!}x^4 + c_1x  frac{c_1}{2}x^3 + frac{c_1}{4!}x^5 + c_2x^2  frac{c_2}{2}x^4 + frac{c_2}{4!}x^6 + c_3x^3  frac{c_3}{2}x^5 + frac{c_3}{4!}x^7 + c_4x^4 +cdots end{align}!Collecting the terms up to fourth order yields
e^x =c_0 + c_1x + left(c_2  frac{c_0}{2}right)x^2 + left(c_3  frac{c_1}{2}right)x^3+left(c_4frac{c_2}{2}+frac{c_0}{4!}right)x^4 + cdots!
The values of c_i can be found by comparison of coefficients with the top expression for e^x, yielding:
frac{e^x}{cos x}=1 + x + x^2 + frac{2x^3}{3} + frac{x^4}{2} + cdots.!
Third example
Here we employ a method called "indirect expansion" to expand the given function. This method uses the known Taylor expansion of the exponential function. In order to expand {{math(1 + x)ex}} as a Taylor series in {{mvarx}}, we use the known Taylor series of function {{mathex}}:
e^x = sum^infty_{n=0} frac{x^n}{n!} =1 + x + frac{x^2}{2!} + frac{x^3}{3!} + frac{x^4}{4!}+cdots.
Thus,
begin{align}(1+x)e^x &= e^x + xe^x = sum^infty_{n=0} frac{x^n}{n!} + sum^infty_{n=0} frac{x^{n+1}}{n!} = 1 + sum^infty_{n=1} frac{x^n}{n!} + sum^infty_{n=0} frac{x^{n+1}}{n!} &= 1 + sum^infty_{n=1} frac{x^n}{n!} + sum^infty_{n=1} frac{x^n}{(n1)!} =1 + sum^infty_{n=1}left(frac{1}{n!} + frac{1}{(n1)!}right)x^n &= 1 + sum^infty_{n=1}frac{n+1}{n!}x^n &= sum^infty_{n=0}frac{n+1}{n!}x^n.end{align}
Taylor series as definitions
Classically, algebraic functions are defined by an algebraic equation, and transcendental functions (including those discussed above) are defined by some property that holds for them, such as a differential equation. For example, the exponential function is the function which is equal to its own derivative everywhere, and assumes the value 1 at the origin. However, one may equally well define an analytic function by its Taylor series.Taylor series are used to define functions and "operators" in diverse areas of mathematics. In particular, this is true in areas where the classical definitions of functions break down. For example, using Taylor series, one may extend analytic functions to sets of matrices and operators, such as the matrix exponential or matrix logarithm.In other areas, such as formal analysis, it is more convenient to work directly with the power series themselves. Thus one may define a solution of a differential equation as a power series which, one hopes to prove, is the Taylor series of the desired solution.Taylor series in several variables
The Taylor series may also be generalized to functions of more than one variable with{{citationauthor=Lars HÃ¶rmandertitle=The analysis of partial differential operators, volume 1year=1990publisher=Springerat=Eqq. 1.1.7 and 1.1.7â€²}}{{citationauthor1=Duistermaatauthor2=Kolktitle=Distributions: Theory and applicationspublisher=Birkhauseryear=2010at=ch. 6}}
begin{align}
T(x_1,ldots,x_d) &= sum_{n_1=0}^infty cdots sum_{n_d = 0}^infty frac{(x_1a_1)^{n_1}cdots (x_da_d)^{n_d}}{n_1!cdots n_d!},left(frac{partial^{n_1 + cdots + n_d}f}{partial x_1^{n_1}cdots partial x_d^{n_d}}right)(a_1,ldots,a_d) &= f(a_1, ldots,a_d) + sum_{j=1}^d frac{partial f(a_1, ldots,a_d)}{partial x_j} (x_j  a_j) + frac{1}{2!} sum_{j=1}^d sum_{k=1}^d frac{partial^2 f(a_1, ldots,a_d)}{partial x_j partial x_k} (x_j  a_j)(x_k  a_k) + & qquad qquad + frac{1}{3!} sum_{j=1}^dsum_{k=1}^dsum_{l=1}^d frac{partial^3 f(a_1, ldots,a_d)}{partial x_j partial x_k partial x_l} (x_j  a_j)(x_k  a_k)(x_l  a_l) + cdotsend{align}For example, for a function f(x,y) that depends on two variables, {{mvarx}} and {{mvary}}, the Taylor series to second order about the point {{math(a, b)}} is
f(a,b) +(xa) f_x(a,b) +(yb) f_y(a,b) + frac{1}{2!}Big( (xa)^2 f_{xx}(a,b) + 2(xa)(yb) f_{xy}(a,b) +(yb)^2 f_{yy}(a,b) Big)
where the subscripts denote the respective partial derivatives.A secondorder Taylor series expansion of a scalarvalued function of more than one variable can be written compactly as
T(mathbf{x}) = f(mathbf{a}) + (mathbf{x}  mathbf{a})^mathsf{T} D f(mathbf{a}) + frac{1}{2!} (mathbf{x}  mathbf{a})^mathsf{T} left {D^2 f(mathbf{a}) right } (mathbf{x}  mathbf{a}) + cdots,
where {{mathD f (a)}} is the gradient of {{mvarf}} evaluated at {{mathx {{=}} a}} and {{mathD2 f (a)}} is the Hessian matrix. Applying the multiindex notation the Taylor series for several variables becomes
T(mathbf{x}) = sum_{alpha geq 0}frac{(mathbf{x}mathbf{a})^alpha}{alpha !} left({mathrm{partial}^{alpha}}fright)(mathbf{a}),
which is to be understood as a still more abbreviated multiindex version of the first equation of this paragraph, with a full analogy to the single variable case. Example
200pxthumbrightSecondorder Taylor series approximation (in orange) of a function {{mathf (x,y) {{=}} ex log(1 + y)}} around the origin.In order to compute a secondorder Taylor series expansion around point {{math(a, b) {{=}} (0, 0)}} of the function
f(x,y)=e^xlog(1+y),
one first computes all the necessary partial derivatives:
begin{align}
f_x &= e^xlog(1+y) [6pt]f_y &= frac{e^x}{1+y} [6pt]f_{xx} &= e^xlog(1+y) [6pt]f_{yy} &=  frac{e^x}{(1+y)^2} [6pt]f_{xy} &=f_{yx} = frac{e^x}{1+y} .end{align}Evaluating these derivatives at the origin gives the Taylor coefficients
begin{align}
f_x(0,0) &= 0 f_y(0,0) &=1 f_{xx}(0,0) &=0 f_{yy}(0,0) &=1 f_{xy}(0,0) &=f_{yx}(0,0)=1.end{align}Substituting these values in to the general formula
T(x,y) = f(a,b) +(xa) f_x(a,b) +(yb) f_y(a,b) +frac{1}{2!}Big( (xa)^2f_{xx}(a,b) + 2(xa)(yb)f_{xy}(a,b) +(yb)^2 f_{yy}(a,b) Big)+ cdots
produces
begin{align}
T(x,y) &= 0 + 0(x0) + 1(y0) + frac{1}{2}Big( 0(x0)^2 + 2(x0)(y0) + (1)(y0)^2 Big) + cdots &= y + xy  frac{y^2}{2} + cdots end{align}Since {{mathlog(1 + y)}} is analytic in {{math{{absy}} < 1}}, we have
e^xlog(1+y)= y + xy  frac{y^2}{2} + cdots, qquad y < 1.
Comparison with Fourier series
The trigonometric Fourier series enables one to express a periodic function (or a function defined on a closed interval {{math[a,b]}}) as an infinite sum of trigonometric functions (sines and cosines). In this sense, the Fourier series is analogous to Taylor series, since the latter allows one to express a function as an infinite sum of powers. Nevertheless, the two series differ from each other in several relevant issues: The finite truncations of the Taylor series of {{mathf (x)}} about the point {{mathx {{=}} a}} are all exactly equal to {{mathf}} at {{matha}}. In contrast, the Fourier series is computed by integrating over an entire interval, so there is generally no such point where all the finite truncations of the series are exact.
 The computation of Taylor series requires the knowledge of the function on an arbitrary small neighbourhood of a point, whereas the computation of the Fourier series requires knowing the function on its whole domain interval. In a certain sense one could say that the Taylor series is "local" and the Fourier series is "global".
 The Taylor series is defined for a function which has infinitely many derivatives at a single point, whereas the Fourier series is defined for any integrable function. In particular, the function could be nowhere differentiable. (For example, {{mathf (x)}} could be a Weierstrass function.)
 The convergence of both series has very different properties. Even if the Taylor series has positive convergence radius, the resulting series may not coincide with the function; but if the function is analytic then the series converges pointwise to the function, and uniformly on every compact subset of the convergence interval. Concerning the Fourier series, if the function is squareintegrable then the series converges in quadratic mean, but additional requirements are needed to ensure the pointwise or uniform convergence (for instance, if the function is periodic and of class C1 then the convergence is uniform).
 Finally, in practice one wants to approximate the function with a finite number of terms, say with a Taylor polynomial or a partial sum of the trigonometric series, respectively. In the case of the Taylor series the error is very small in a neighbourhood of the point where it is computed, while it may be very large at a distant point. In the case of the Fourier series the error is distributed along the domain of the function.
See also
 Asymptotic expansion
 Generating function
 Laurent series
 Madhava series
 Newton's divided difference interpolation
 PadÃ© approximant
 Puiseux series
 Shift operator
Notes
{{reflist30em}}References
 {{Citation last1=Abramowitz first1=Milton author1link=Milton Abramowitz last2=Stegun first2=Irene A. author2link=Irene Stegun title=Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables publisher=Dover Publications location=New York id=Ninth printing year=1970 postscript=}}
 {{citation last1=Thomasfirst1=George B., Jr.last2=Finneyfirst2=Ross L. title=Calculus and Analytic Geometry edition=9th  publisher=Addison Wesley year=1996 isbn=0201531747 postscript=}}
 {{citation last=Greenbergfirst=Michael title=Advanced Engineering Mathematics edition=2nd  publisher=Prentice Hall year=1998 isbn=0133214311 postscript=}}
External links
{{Sister project linkswikt=Taylor seriescommons=Category:Taylor seriesb=Calculus/Taylor seriesv=Taylor's seriesq=no  species=nod=Q131187}}

 content above as imported from Wikipedia
 "Taylor series" does not exist on GetWiki (yet)
 time: 10:57pm EDT  Tue, Aug 20 2019
 "Taylor series" does not exist on GetWiki (yet)
 time: 10:57pm EDT  Tue, Aug 20 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GetMeta:About
GetWiki
GetWiki
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
Biographies
GETWIKI 20 AUG 2014
GetMeta:News
GetWiki
GetWiki
GETWIKI 19 AUG 2014
© 2019 M.R.M. PARROTT  ALL RIGHTS RESERVED