Professional Documents
Culture Documents
Replace 7.38b by
n+1
1
(2n 1)
6
=
6
960
.
Solve Problem 14.4.1 (Integration) in Arfken.
8. Read through this following example for computing the Fourier coe-
cients c
n
in complex notation:
Let f(x) = 3x on x . Compute the Fourier coecients c
n
where
f(x) =
n=
c
n
e
nx
and
c
n
=
1
2
_
f(x)e
nx
dx.
Thus
c
n
=
3
2
_
xe
nx
dx.
From integral tables,
c
n
=
3
2
_
e
nx
n
2
(nx 1)
_
x=
x=
and
c
n
=
3(1)
n
n
, n = 0
from n = 0,
c
n
=
3
2
_
xdx = 0 .
Thus
f(x) = 3
(1)
n
n
e
nx
, n = 0 .
Of course, the Fourier coecients can can be found by computing a
n
and b
n
and then using the formulas in the Supplementary Notes to
calculate c
n
.
Problem: Compute the Fourier coecients c
n
using the method out-
lined in this procedure for these two cases:
i) f(x) = 1, x .
ii) f(x) = x
2
, x .
6
MISN-0-483 3
3. Supplementary Notes
3a. Complex notation and Fourier series. Suppose f(x) satised
Dirichlet conditions on (L, L). Then, at a point of continuity,
f(x) =
a
0
2
+
n=1
_
a
n
cos
nx
L
+b
n
sin
nx
L
_
where
a
n
=
1
L
_
L
L
f(x) cos
nx
L
dx, n 1
and
b
n
=
1
L
_
L
L
f(x) sin
nx
L
dx, n 1 .
By denition
cos =
e
+e
2
and
sin =
e
2
.
Then
f(x) =
a
0
2
+
n
_
1
2
(a
n
b
n
)e
nx
L
+
1
2
(a
n
+b
n
)e
nx
L
_
=
n=1
_
a
n
+b
n
2
_
e
nx
L
+
a
0
2
+
n=1
_
a
n
b
n
2
_
e
nx
L
.
Let n be replaced by n in the rst summation. So:
f(x) =
1
n=
_
a
n
+b
n
2
_
e
nx
L
+
a
0
2
+
n=1
_
a
n
b
n
2
_
e
nx
L
.
Dene
c
n
=
a
n
+b
n
2
if n < 0
c
0
=
a
0
2
and
c
n
=
a
n
b
n
2
if n > 0 .
7
MISN-0-483 4
Then
f(x) =
n=
c
n
e
nx
L
where
c
n
=
1
2L
_
L
L
f(x)e
nx
L
dx.
3b. Orthogonal functions. Equations (9), (10), (11), (12), (13), and
(15) of Chapter 7 in Spiegel are only true if the functions involved are
real. If the functions are complex as in Supplementary Problem 7.44,
then these equations need to be changed. The change to be made is
simply to include complex conjugation for one of the functions. So, the
more general equations are:
9:
_
b
a
A
(x)B(x) dx = 0
10:
_
b
a
A
(x)A(x) dx =
_
b
a
|A(x)|
2
dx = 1
11:
_
b
a
m
(x)
n
(x) dx = 0, m = n
12:
_
b
a
m
(x)
n
(x) dx =
_
b
a
|
m
(x)|
2
dx = 1
13:
_
b
a
m
(x)
n
(x) dx =
mn
and
15:
_
b
a
(x)
m
(x)
n
(x) dx =
mn
.
By denition, the process of complex conjugation is given as
(a +b)
= a b
where a and b are real and =
1 .
8
MISN-0-483 5
3c. Conditions for dierentiating term-by-term. As mentioned
in Procedure 5, the conditions for dierentiating a Fourier series term-
by-term and having the resultant series converge to the derivative of the
limit of the original series are listed in Theorem 1-11 on page 7 of Spiegel.
This theorem can be written in notation relevant to this Unit as follows:
Theorem 1-11. If f(x) satised Dirichlet conditions on (L, L) and
is continuous at x so that the series
a
0
2
+
n=0
_
a
n
cos
nx
L
+b
n
sin
nx
L
_
converges to f(x) while the series
n=0
n
_
a
n
sin
nx
L
b
n
cos
nx
L
_
is uniformly convergent in (L, L), then
df
dx
=
L
n=0
n
_
a
n
sin
nx
L
b
n
cos
nx
L
_
.
3d. Normalization coecient. Given a function (x) on a x b.
The constant C is called the normalization coecient of (x) on a x b
if
(x) = C(x)
_
b
a
|
(x)|
2
dx = 1 .
3e. Complete set of functions. Consider a set of functions
{
n
(x)}
N
n=1
dened on a x b such that the
n
(x) are an orthonormal
set with weight function (x). That is,
_
b
a
(x)
m
(x)
n
(x) dx =
mn
.
This set of functions is a complete set if no non-trivial function g(x) exists
such that
_
b
a
(x)
n
(x)g(x) dx = 0
9
MISN-0-483 6
for all n. Then, we can expand an arbitrary function f(x) dened on
a x b and satisfying certain continuity criterion as
f(x) =
n
c
n
n
(x)
where
c
n
=
_
b
a
(x)
n
(x)f(x) dx.
Examples:
(a)
_
_
1
2L
,
_
1
L
sin
nx
L
,
_
1
L
cos
nx
L
_
n=1
is an orthonormal and complete set on (L, L).
(b)
_
_
2
L
sin
nx
L
_
n=1
is an orthonormal and complete set on (0, L).
(c)
_
_
1
L
,
_
2
L
cos
nx
L
_
n=1
is an orthonormal and complete set on (0, L).
The weight function (x) = 1 in each case above.
Acknowledgments
The author would like to thank Illinois State University for support in
the construction of this lesson. Preparation of this module was supported
in part by the National Science Foundation, Division of Science Education
Development and Research, through Grant #SED 74-20088 to Michigan
State University.
10
11 12