Taylor Series
From Math Images
Line 50:  Line 50:  
So our approximating value agrees with the actual value to the fourth digit, which is good accuracy for a 3termlong approximation. Of course, better accuracy can be achieved by using more terms in the Taylor series.  So our approximating value agrees with the actual value to the fourth digit, which is good accuracy for a 3termlong approximation. Of course, better accuracy can be achieved by using more terms in the Taylor series.  
<br><br>  <br><br>  
  We can get the same conclusion if we graph the original cosine function and its approximation together as shown in [[#Figure1bFigure 1b]]. We can see that the original function and the approximating Taylor series are almost identical when x is small. In particular, the line ''x'' =  +  We can get the same conclusion if we graph the original cosine function and its approximation together as shown in [[#Figure1bFigure 1b]]. We can see that the original function and the approximating Taylor series are almost identical when x is small. In particular, the line ''x'' = π/6 cuts the two graphs almost simultaneously, so there is not much difference between the exact value and the approximating value. However, this doesn't mean that these two functions are exactly the same. For example, when ''x'' grows larger, they start to deviate significantly from each other. What's more, if we zoom in the graph at the intersection point, as shown in [[#Figure1cFigure 1c]], we can see that there is indeed a tiny difference between these two functions, which we cannot see in a graph of normal scale. 
<br><br>  <br><br>  
The calculator's algorithm is an improved version of this method. It may be more efficient, more accurate, and more general, but it still evaluates the numerical value of a polynomial series. This algorithm is built in the permanent memory (ROM) of electronic calculators, and is triggered every time we enter the function<ref name = ref2>[http://en.wikipedia.org/wiki/Calculator Calculator], from Wikipedia. This article explains the structure of an electronic calculator.</ref>.  The calculator's algorithm is an improved version of this method. It may be more efficient, more accurate, and more general, but it still evaluates the numerical value of a polynomial series. This algorithm is built in the permanent memory (ROM) of electronic calculators, and is triggered every time we enter the function<ref name = ref2>[http://en.wikipedia.org/wiki/Calculator Calculator], from Wikipedia. This article explains the structure of an electronic calculator.</ref>. 
Revision as of 15:21, 17 July 2012
Taylor Series 

Taylor Series
A Taylor series, or Taylor polynomial, is a function's polynomial expansion that approximates the value of this function around a certain point. For example, the animation at right shows the function y = sin(x) and its expanded Taylor series around the origin:
 with n varying from 0 to 36. As we can see, the larger n is, the more terms we will have in the Taylor polynomial, and the more it looks like the original function. If n goes to infinity, then our approximating polynomial will be identical to the original function y = sin(x).
 For the math behind this, please go to the More Mathematical Explanation section.
Contents 
Basic Description
Have you ever wondered how calculators work? How do they calculate square roots, sines, cosines, and exponentials? For example, if we type the sine of an angle into our calculator, then it will magically spit out a number. We know this number must be related to our input in some way, but what exactly is this relationship? Is the calculator just reading off of a list created from people who used rulers to physically measure the distance on a graph, or is there a more mathematical relationship?
The answer to the last question above is yes. There are algorithms that give an approximate value of sine, using only the four basic operations (+, , x, /)^{[1]}. Mathematicians studied these algorithms in order to calculate these functions manually before the age of electronic calculators. One such algorithm is given by the Taylor series, named after English mathematician Brook Taylor. Basically, Taylor said that there is a way to expand any infinitely differentiable function into a polynomial series around a certain point. This process uses a fair amount of single variable calculus, which will be explained in the More Mathematical Explanation section. Here we will only give some examples of Taylor series without explanation:
 , expanded around the origin. x is in radians.
 , expanded around the origin. x is in radians.
 , expanded around the origin. e is Euler's number, approximately equal to 2.71828···
 , expanded around the point x = 1.
With Taylor polynomials in hand, we can easily calculate the numerical value of these functions. For example, if we want to calculate:
first we need to convert degrees to radians in order to use the Taylor series:
then, substitute into the Taylor series of cosine above:
Here we only used 3 terms, since this should be enough to tell us something. Notice that the right side of the equation above involves only the four simple operations, so we can easily calculate its value:
On the other hand, trigonometry tells us the exact numerical value of this particular cosine:
So our approximating value agrees with the actual value to the fourth digit, which is good accuracy for a 3termlong approximation. Of course, better accuracy can be achieved by using more terms in the Taylor series.
We can get the same conclusion if we graph the original cosine function and its approximation together as shown in Figure 1b. We can see that the original function and the approximating Taylor series are almost identical when x is small. In particular, the line x = π/6 cuts the two graphs almost simultaneously, so there is not much difference between the exact value and the approximating value. However, this doesn't mean that these two functions are exactly the same. For example, when x grows larger, they start to deviate significantly from each other. What's more, if we zoom in the graph at the intersection point, as shown in Figure 1c, we can see that there is indeed a tiny difference between these two functions, which we cannot see in a graph of normal scale.
The calculator's algorithm is an improved version of this method. It may be more efficient, more accurate, and more general, but it still evaluates the numerical value of a polynomial series. This algorithm is built in the permanent memory (ROM) of electronic calculators, and is triggered every time we enter the function^{[2]}.
A More Mathematical Explanation
 Note: understanding of this explanation requires: *Calculus
How to derive Taylor Series from a given function
In this subsection, we are going to derive an explicit and general expression of a function's Taylor series, using only the derivatives of the given function f(x).
Mathematically, Taylor polynomials and Taylor series can be defined in the following way:
 The Taylor polynomial of degree n for f at a, written as , is the polynomial that has the same 0^{th} to n^{th} order derivatives as function f(x) at point a. In other words, the n^{th} degree Taylor polynomial must satisfy:
 (the 0^{th} order derivative of a function is just itself)
 in which is the k^{th} order derivative of at a.
 The Taylor series is just with infinitely large degree n. Notice the f must be infinitely differentiable in order to have a Taylor series.
The following set of images show some examples of Taylor polynomials, from 0^{th} order to 2^{nd} order:



From the definition above, the function f and its 0^{th} order Taylor polynomial must have the same 0^{th} order derivatives at a. Since the 0^{th} order derivative of a function is just itself by definition, we have:
which gives us the horizontal line shown in Figure 2a. This is certainly not a very close approximation. So we need to add more terms.
The first order Taylor polynomial must satisfy:
which gives us the linear approximation shown in Figure 2b. This approximation is much better than the 0^{th} order one.
Similarly, the second degree Taylor polynomial must satisfy:
which gives us the quadratic approximation shown in Figure 2c. This is the best approximation so far.
As we can see, the quality of our approximation increases as we add more terms to the Taylor polynomial. Since Taylor series is the Taylor polynomial of infinitely large degree, it should be a perfect approximation  identical to the original function.
Taylor proved that such a series must exist for every infinitely differentiable function f. In fact, without loss of generality, we can write the Taylor series of a function f around a as
in which a_{0}, a_{1}, a_{2} ... are unknown coefficients. What's more, from the definition of Taylor polynomials, we know that function f and Taylor series must have same derivatives of all degrees:
 , , ,
Using the constraints above, we can determine the value of all unknown coefficients in Eq. 1. Just substitute into Eq. 1 and we can get:
in which the terms before a_{n} vanished because their associated power of (x  a ) didn't survive taking derivatives for n times. The terms after a_{n} vanished because there are still (x  a ) terms left, which make them equal to 0 when x = a. So we are left with this simple equation, from which we can directly get:
If we agree to define 0! = 1, then this formula holds for all nonnegative integers n from 0 to infinity. So we have determined the value of all unknown coefficients using derivatives of the given function f. Substitute them back into Eq. 1 to get an explicit expression of Taylor series:
or in summation notation,
This is the standard formula of Taylor series that we are going to use in the rest of this article. In most cases we would like to let a = 0 to get a neater expression:
Eq. 3 is also called Maclaurin series, named after Scottish mathematician Colin Maclaurin, who made extensive use of these series in the 18th century.
We have given some examples of Taylor series in the Basic Description section. They are easy to derive using Eq. 2  just substitute f and a into it, then compute the derivatives. Here we are going to do this in detail for only one function: the natural log. Other elementary functions, such as sin(x), cos(x), and e ^{x}, can be treated in a similar manner.
Our natural log function is:
Its derivatives are:
 , ,
Since this function and its derivatives are not defined at x = 0, we cannot use Maclaurin series for it. Instead we can let a = 1 and compute the derivatives at this point:
 , , ,
Substitute these derivatives into Eq. 2, and we can get the Taylor series for centered at x = 1:
What's more, we can avoid the cumbersome (x  1)^{k} notation by introducing a new function g(x) = log (1 + x). Now we can expand it around x = 0:
The animation to the right shows this Taylor polynomial with degree n varying from 0 to 25. As we can see, the left part of this polynomial soon approximates the original function as we have expected. However, the right part demonstrates some strange behavior: it seems to diverge farther away from the function as n grows larger. This tells us that Taylor series is not always a reliable approximation of the original function. Just the fact that they have same derivatives doesn't guarantee they are the same thing. There are more requirements needed.
This leads us to the discussion of convergent and divergent sequences in the next subsection.
To converge or not to converge, this is the question
From the last example of natural log, we can see that sometimes Taylor series fail to approximate their original functions. This happens because the Taylor series for natural log is divergent when , while a valid polynomial approximation needs to be convergent. Here are the definitions of convergence and divergence:
 Let our infinite sequence be:
 ,
 and define its sum series to be:
 The sequence is said to be convergent if the following limit exists:
 If this limit doesn't exist, then the series is said to be divergent.
As we can see in the definition, whether a sequence is convergent or not depends on its sum series. If the sequence is "summable" when n goes to infinity, then its convergent. If it's not, then it's divergent. Following are some examples of convergent and divergent sequences:
 , convergent.
 , convergent.
 , divergent. Vibrates above and below 0 with increasing magnitudes.
 , divergent. Adds up to infinity.
Seq. 1 comes directly from the summation formula of geometric sequences. Seq. 2 is a famous summable sequence discovered by Leibniz. We are going to briefly explain these sequences in the following sections.
Seq. 3 and Seq. 4 are divergent because both of them add up to infinity. However, there is one important difference between them. On one hand, Seq. 3 has terms going to infinity, so it's not surprising that this one is not summable. On the other hand, Seq. 4 has terms going to zero, but they still have an infinitely large sum! This counterintuitive result was first proved by Johann Bernoulli and Jacob Bernoulli in 17th century. In fact, this sequence is so epic in the history of math that mathematicians gave it a special name: the harmonic series. Click here for a proof of the divergence of harmonic series^{[3]}.
By definition, divergent series are not summable. So if we talk about the "sum" of these series, we may get ridiculous results. For example, look at the summation formula of geometric series:
This formula could be easily derived with a little manipulation of algebra, or by expanding the Maclaurin series of the left side. Click here for a simple proof^{[4]}. However, what we want to show here is that this formula doesn't work for all values of r. For values less than 1, such as 1/2, we can get reasonable results like:
However, if the value of r is larger than 1, such as 2, things start to get weird:
How can we get a negative number by adding a bunch of positive integers? Well, if this case makes mathematicians uncomfortable, then they are going to be even more puzzled by the following one, in which r = 2:
This is ridiculous: the sum of integers can not possibly be a fraction. In fact, we are getting all these funny results because the last two series are divergent, so their sums are not defined. See the following images for a graphic representation of these series:



In the images above, the blue lines trace the geometric sequences, and the red lines trace their sum series. As we can see, the first sequence with r = 1/2 does have a limited sum, since its sum series converge to a finite value as n increases. However, the sum series of the other two sequences don't converge to anything. They never settle around a finite value. Thus the second and third sequences diverge, and their sums don't exist. Although we can still write down the summation formula in principle, this formula is meaningless. So no wonder we have got those weird results.
Same thing happens in the Taylor series of natural log:
Let's look at an arbitrary term in this series: ±x^{n} / n. As n increases, the denominator is experiencing a linear growth, and the numerator is experiencing an exponential growth. It is a known fact that exponential growth will eventually override linear growth, as long as the absolute value of x is larger than one. So if x > 1, then the terms x^{n} / n will go to infinity, and this Taylor series will be divergent. This is why we saw the abnormal behavior of the right side of Figure 2d. In this "divergent zone", although we can still write down the polynomial, it's no longer a valid approximation of the function. For example, if we want to calculate the value of log 4, instead of writing:
 (divergent)
we have to write:
 (convergent)
in which we saved it from the "divergent zone" to the "convergent zone" by using the identity log(a ·b ) = log (a ) + log (b ).
Why It's Interesting
As we have stated before, Taylor series can be used to derive many interesting sequences, which helped mathematicians to determine the values of important math constants such as and .
Approximating Pi
, or the ratio of a circle's circumference to its diameter, is one of the oldest, most important, and most interesting mathematical constants. The earliest documentation of can be traced back to ancient Egypt and Babylon, in which people used empirical values of such as 25/8 = 3.1250, or (16/9)^{2} ≈ 3.1605^{[5]}.
The first recorded algorithm for rigorously calculating the value of was a geometrical approach using polygons, devised around 250 BC by the Greek mathematician Archimedes. Archimedes computed upper and lower bounds of by drawing regular polygons inside and outside a circle, and calculating the perimeters of the outer and inner polygons. He proved that 223/71 < < 22/7 by using a 96sided polygon, which gives us 2 accurate decimal digits: π ≈ 3.14^{[6]}.
Mathematicians continued to use this polygon method for the next 1,800 years. The more sides their polygons have, the more accurate their approximations would be. This approach peaked at around 1600, when the Dutch mathematician Ludolph van Ceulen used a 2^{60}  sided polygon to obtain the first 35 digits of ^{[7]}. He spent a major part of his life on this calculation. In memory of his contribution, sometimes is still called "the Ludolphine number".
However, mathematicians have had enough of trillionsided polygons. Starting from the 17^{th} century, they devised much better approaches for computing , using calculus rather than geometry. Mathematicians discovered numerous infinite series associated with , and the most famous one among them is the Leibniz series:
We have seen the Leibniz series as an example of convergent series in the More Mathematical Explanation section. Here we are going to briefly explain how Leibniz got this result. This amazing sequence comes directly from the Taylor series of arctan(x):
We can get Eq. 4a by directly computing the derivatives of all orders for arctan(x) at x = 0, but the calculation involved is rather complicated. There is a much easier way to do this if we notice the following fact:
Recall that we gave the summation formula of geometric series in the More Mathematical Explanation section :
 ,
If we substitute r =  x^{2} into the summation formula above, we can expand the right side of Eq. 4b into an infinite sequence:
So Eq. 4b changes into:
Integrating both sides gives us:
Let x = 0, this equation changes into 0 = C . So the integrating constant C vanishes, and we get Eq. 4a.
One may notice that, like Taylor series of many other functions, this series is not convergent for all values of x. It only converges for 1 ≤ x ≤ 1. Fortunately, this is just enough for us to proceed. Substituting x = 1 into it, we can get the Leibniz series:
The Leibniz series gives us a radically improved way to approximate : no polygons, no square roots, just the four basic operations. However, this particular series is not suitable for computing , since it converges too slowly. The first 1,000 terms of Leibniz series give us only two accurate digits: π ≈ 3.14. This is horribly inefficient, and no mathematicians will ever want to use this algorithm.
Fortunately, we can get series that converge much faster if we substitute smaller values of x , such as , into Eq. 4a:
which gives us:
This series is much more efficient than the Leibniz series, since there are powers of 3 in the denominators. The first 10 terms of it give us 5 accurate digits, and the first 100 terms give us 50. Leibniz himself used the first 22 terms to compute an approximation of pi correct to 11 decimal places as 3.14159265358.
However, mathematicians are still not satisfied with this efficiency. They kept substituting smaller x values into Eq. 4a to get more convergent series. Among them is Leonhard Euler, one of the greatest mathematicians in the 18^{th} century. In his attempt to approximate , Euler discovered the following nonintuitive formula:
Although Eq. 4c looks really weird, it is indeed an equality, not an approximation. The following hidden section shows how it is derived in detail:
The next step is to expand Eq. 4c using Taylor series, which allows us to do the numeric calculations:
This series converges so fast that each term of it gives more than 1 digit of . Using this algorithm, it will not take more several days to calculate the first 35 digits of with pencil and paper, which Ludolph spent most of his life on.
Although Euler himself has never undertaken the calculation, this idea was developed and used by many other mathematicians at his time. In 1789, the Slovene mathematician Jurij Vega calculated the first 140 decimal places for of which the first 126 were correct. This record was broken in 1841, when William Rutherford calculated 208 decimal places with 152 correct ones. By the time of the invention of electronic digital computers, had been expanded to more than 500 digits. And we shouldn't forget that all of these started from the Taylor series of trigonometric functions.
Acknowledgement: Most of the historical information in this section comes from these this article: click here^{[8]}.
Approximating e
The mathematical constant , approximately equal to 2.71828, is also called Euler's Number. This important constant appears in calculus, differential equations, complex numbers, and many other branches of mathematics. What's more, it's also widely used other subjects such as physics and engineering. So we would really like to know its exact value.
Mathematically, is defined as:
In principle, we could have approximated using this definition. However, this method is so slow and inefficient that we are forced to find another one. For example, set n to 100 in the definition, and we can get:
which gives us only 2 accurate digits. This is really, really horrible accuracy for an approximating algorithm. So we have to find another way to do this.
One possible way is to use the Taylor series of function e^{x}, which has a very nice property:
The proof of this property can be found in almost every calculus textbook. It tells us that all derivatives of the exponential function are equal:
, and:
Substitute these derivatives into Eq. 2, the general formula of Taylor Series, we can get:
Let x = 1, and we can get another way to approximate :
This sequence is strongly convergent, since there are factorials in the denominators, and factorials grow really fast as n increases. Just take the first 10 terms and we can get:
The real value of is 2.718281828··· , so we have got 7 accurate digits! Compared to the approximation by definition, which gives us only two digits at order 100, this algorithm is incredibly fast and efficient.
In fact, we can get the same conclusion if we plot the function e^{x} and its two approximations together, and see which one converges faster. We already have the Taylor series approximation:
We can also find the powers of using the definition:
in which n' = n·x . We can switch between n' and n because both of the go to infinity, and which one we use doesn't matter.
In Figure 5b, these two approximations are graphed together to approximate the original function e^{x}. As we can see in the animation, Taylor series approximates the original function much faster than the definition does.
Teaching Materials
 There are currently no teaching materials for this page. Add teaching materials.
References
 ↑ How does the calculator find values of sine, from homeschoolmath. This is an article about calculator programs for approximating functions.
 ↑ Calculator, from Wikipedia. This article explains the structure of an electronic calculator.
 ↑ The Harmonic Series Diverges Again and Again, by Steven J. Kifowit and Terra A. Stamps. This article explains why harmonic series is divergent.
 ↑ Harmonic Series, from Wolfram MathWorld. This is a simple proof that harmonic series diverges
 ↑ Pi, from Wolfram MathWorld. This article contains some history of Pi.
 ↑ Archimedes' Approximation of Pi. This is a thorough explanation of Archimedes' method.
 ↑ Digits of Pi, by Barry Cipra. Documentation of Ludolph's work is included here.
 ↑ How Euler Did It, by Ed Sandifer. This articles talks about Euler's algorithm for estimating π.
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.