0% found this document useful (0 votes)
46 views5 pages

Infinite - and Truncated Series

In mathematics, a series is, roughly speaking, the operation of adding infinitely many quantities, one after the other, to a given starting quantity.[1] The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures (such as in combinatorics) through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative discipli

Uploaded by

NIKHIL SHARMA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
46 views5 pages

Infinite - and Truncated Series

In mathematics, a series is, roughly speaking, the operation of adding infinitely many quantities, one after the other, to a given starting quantity.[1] The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures (such as in combinatorics) through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative discipli

Uploaded by

NIKHIL SHARMA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ME 352 Supplemental Notes:

Infinite and Truncated Series

1 Learning objectives
After studying these notes you should. . .
• Be able to define an infinite series
• Be able to distinguish geometric series from a power series
• Be able to write the generic formula for a Taylor series
• Be able to write the first three terms of the series representations of ex ,
sin(x), and cos(x).

2 Infinite Series: A Review


2.1 Definitions
Sequence: a function whose domain is a set of positive integers
(n, f (n)) : n = 1, 2, 3, ...
Example: f (n) = 1/n
Example: (Fibonacci)
f (1) = 1 (n = 1)
f (2) = 1 (n = 2)
f (n) = f (n − 2) + f (n − 1) n = 3, 4, . . .
Exercise: Write out the first ten terms of the Fibonacci series

2.2 Limit of a Sequence


• limn→∞ f (n) = L
• Limit of f (n) exists only if its graph has an asymptote
• Limit may or may not exist

Example:
f (n) = 1/n has the limit 0
1 1 1 1
1, , , , , ...
2 3 4 5
2.3 Sequence of Partial Sums 2

Example:
f (n) = n/(n + 1) has the limit 1
1 2 3 4
, , , , ...
2 3 4 5

2.3 Sequence of Partial Sums

s1 = u1
s2 = u1 + u2
s3 = u1 + u2 + u3
...
n
X
sn = u1 + u2 + u3 + . . . + un = uk
k=1

Each member of the sequence is a sum of n terms. The sequence can be defined
recursively

s1 = u1
sn = sn−1 + un n>1

where un is the nth term.

2.4 Infinite Series


A series (usually partial sums) with an infinite number of terms

Example:
1 + 2 + 3 + 4 + ...

Example:
1 + 1/2 + 1/3 + 1/4 + . . .

Copyright c 2008, Gerald Recktenwald. All rights reserved.


2.5 Convergence of Infinite Series 3

2.5 Convergence of Infinite Series


If a series converges, it has a limit. However, the existence of a limit is a
necessary condition, not a sufficient condition

Example
f (n) = 1 + 2 + 3 + 4 + . . . n does not converge.
1400

1200

1000
Sum of 1, 2, 3, ..., n

800

600

400

200

0
0 10 20 30 40 50
n

Example
f (n) = 1 + 1/2 + 1/3 + 1/4 + . . . + 1/n does not converge.
4.5

3.5
Sum of 1, 1/2, 1/3, ..., 1/n

2.5

1.5

1
0 10 20 30 40 50
n

A series
u1 + u2 + . . . + un + . . .
will not converge unless limn→∞ un = 0. This is a necessary, not sufficient
condition

Copyright c 2008, Gerald Recktenwald. All rights reserved.


2.6 Geometric Series 4

2.6 Geometric Series


An infinite series of the form

a + ax + ax2 + ax3 + . . . + axn + . . .

is called a Geometric Series. If a 6= 0, then the ratio of successive terms is x,


i.e.
axn
=x
axn−1
Consider the sum of the first n terms of the geometric series

sn = a + ax + ax2 + ax3 + . . . + axn−1 (1)

Multiply both sides by x

xsn = ax + ax2 + ax3 + ax4 + . . . + axn (2)

Subtract Equation (2) from Equation (1)

(1 − x)sn = a − axn
= a(1 − xn )

If x 6= 1 divide both sides by 1 − x to get

a(1 − xn )
sn = (x 6= 1) (3)
1−x
Now, assume that |x| < 1 and take the limit as n → ∞

a(1 − xn ) a
lim sn = lim = |x| < 1
n→∞ n→∞ 1−x 1−x

Summary If |x| < 1, then


a
a + ax + ax2 + ax3 + . . . + axn + . . . =
1−x

2.7 Power series expansions


An power series is an expression of the form

X
ak xk = a0 + a1 x + a2 x2 + . . . + ak xk + . . .
k=0

The geometric series is a power series with all ak = a, where a is a constant.


Note that a truncated power series is just a polynomial.

Copyright c 2008, Gerald Recktenwald. All rights reserved.


2.8 Taylor series expansions 5

2.8 Taylor series expansions


Taylor series expansions are special power series designed to approximate a
function.
Given y = f (x), we seek polynomials of the form
fn (x) = a0 + a1 x + a2 x2 + . . . + an xn
such that fn (x) is a good approximation to f (x).
Consider the constant approximation to f (x)
f0 (x) = a0
The best choice of a0 is the value of the function at some point. Designate x̃ as
the point where f0 (x) and f (x) are supposed to agree. Hence, a0 = f (x̃)
Next consider the linear approximation to f (x)
f1 (x) = a0 + a1 x
We want the good agreement at x̃ so rewrite this as
f1 (x − x̃) = a0 + a1 (x − x̃)
The best choice of a0 is once again f (x̃). Geometric reasoning shows that the
best choice of a1 is the slope of the function f (x) at x = x̃. Therefore, the linear
approximation to f (x) near x̃ is
df
f1 (x = x̃) = f (x̃) + (x − x̃)
dx x=x̃

Repeating this argument gives the Taylor series with remainder


df (x − x̃)2 d2 f
f (x) = f (x̃) + (x − x̃) +
dx x=x̃ 2 dx2 x=x̃

(x − x̃)3 d3 f
+ + . . . + Rn (x, x̃)
3! dx3 x=x̃

2.9 Series Expansions for ex , sin(x) and cos(x)


The following series converge for all −∞ < x < ∞. However, it is not practical
to evaluate these series for large x
x2 xk
ex = 1 + x + + ··· + + ···
2! k!

x3 x5 x7 (−1)k−1 x2k−1
sin(x) = x − + − + ... + + ...
3! 5! 7! (2k − 1)!

x2 x4 x6 (−1)k x2k
cos(x) = 1 − + − + ... + + ....
2 4! 6! (2k)!

Copyright c 2008, Gerald Recktenwald. All rights reserved.

You might also like