f(x) cos dx L L f(x) sin L + b n sin a n cos

Similar documents
Notes on Fourier Series and Integrals Fourier Series

Heisenberg's inequality for Fourier transform

Lecture 34. Fourier Transforms

More on Fourier Series

Fourier Series and Integrals

FOURIER ANALYSIS. (a) Fourier Series

Lecture 4: Fourier Transforms.

1 From Fourier Series to Fourier transform

Mathematical Methods: Fourier Series. Fourier Series: The Basics

Fourier Series Example

Fourier Series. Fourier Transform

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space

Fourier Series. Now we need to take a theoretical excursion to build up the mathematics that makes separation of variables possible.

10.2-3: Fourier Series.

Mathematics for Engineers II. lectures. Power series, Fourier series

Fourier Series & The Fourier Transform

CS711008Z Algorithm Design and Analysis

Time-Frequency Analysis

MA 201: Differentiation and Integration of Fourier Series Applications of Fourier Series Lecture - 10

PHYSICS DEPARTMENT, PRINCETON UNIVERSITY PHYSICS 505 MIDTERM EXAMINATION. October 25, 2012, 11:00am 12:20pm, Jadwin Hall A06 SOLUTIONS

Quantum Mechanics in One Dimension. Solutions of Selected Problems

How many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation?

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series

Time-Dependent Statistical Mechanics A1. The Fourier transform

Math 5440 Problem Set 7 Solutions

Fiber Optics. Equivalently θ < θ max = cos 1 (n 0 /n 1 ). This is geometrical optics. Needs λ a. Two kinds of fibers:

22. Periodic Functions and Fourier Series

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes

λ n = L φ n = π L eınπx/l, for n Z

Final Examination Linear Partial Differential Equations. Matthew J. Hancock. Feb. 3, 2006

Fourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University

Examination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N

Fourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.

multiply both sides of eq. by a and projection overlap

The Fourier series for a 2π-periodic function

Math 3150 HW 3 Solutions

Math Assignment 14

MATHS & STATISTICS OF MEASUREMENT

Fourier Series. Department of Mathematical and Statistical Sciences University of Alberta

Signals, Systems, and Society. By: Carlos E. Davila

Overview of Fourier Series (Sect. 6.2). Origins of the Fourier Series.

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

Domain and range of exponential and logarithmic function *

Solving the Heat Equation (Sect. 10.5).

14 Fourier analysis. Read: Boas Ch. 7.

PHYS 391 Fourier Transform Primer Eric Torrence with modifications by Dean Livelybrooks, March 2014

1 The Complex Fourier Series

Physics 443, Solutions to PS 2

MATH 18.01, FALL PROBLEM SET # 6 SOLUTIONS

Math 260: Solving the heat equation

Section 6: Summary Section 7

M412 Assignment 9 Solutions

Fourier transforms. Up to now, we ve been expressing functions on finite intervals (usually the interval 0 x L or L x L) as Fourier series: a n cos L

Exercise 11. Isao Sasano

MAT 372 K.T.D.D. Final Sınavın Çözümleri N. Course. Question 1 (Canonical Forms). Consider the second order partial differential equation

Fourier Series. Suppose f : [0, 2π] C and: f(x) = n=0. a n cos nx. How could we find the a n if we know f? Having a look at cos :

G: Uniform Convergence of Fourier Series

Boundary value problems for partial differential equations

0 3 x < x < 5. By continuing in this fashion, and drawing a graph, it can be seen that T = 2.

CSE 421 Algorithms. T(n) = at(n/b) + n c. Closest Pair Problem. Divide and Conquer Algorithms. What you really need to know about recurrences

Math 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv

Math 337, Summer 2010 Assignment 5

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

Denition and some Properties of Generalized Elementary Functions of a Real Variable

Fast Convolution; Strassen s Method

23.6. The Complex Form. Introduction. Prerequisites. Learning Outcomes

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm

MATH The Derivative as a Function - Section 3.2. The derivative of f is the function. f x h f x. f x lim

Jim Lambers ENERGY 281 Spring Quarter Lecture 5 Notes

Entrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems

Analysis of Functions

Introduction and preliminaries

SBS Chapter 2: Limits & continuity

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

Chapter 17. Fourier series

Examination paper for TMA4125 Matematikk 4N

PHYS 502 Lecture 3: Fourier Series

Partial Differential Equations

About the primer To review concepts in functional analysis that Goal briey used throughout the course. The following be will concepts will be describe

Connection to Laplacian in spherical coordinates (Chapter 13)

The Discrete Fourier Transform (DFT) Properties of the DFT DFT-Specic Properties Power spectrum estimate. Alex Sheremet.

Fourier and Partial Differential Equations

The 1-D Heat Equation

a n cos 2πnt L n=1 {1/2, cos2π/l, cos 4π/L, cos6π/l,...,sin 2π/L, sin 4π/L, sin 6π/L,...,} (2)

1. Solve the boundary-value problems or else show that no solutions exist. y (x) = c 1 e 2x + c 2 e 3x. (3)

Linear second-order differential equations with constant coefficients and nonzero right-hand side

Fourier Analysis Linear transformations and lters. 3. Fourier Analysis. Alex Sheremet. April 11, 2007

Exponential Functions and Graphs - Grade 11 *

QM1 - Tutorial 1 The Bohr Atom and Mathematical Introduction

Wave Equation With Homogeneous Boundary Conditions

MATH 251 Final Examination August 14, 2015 FORM A. Name: Student Number: Section:

Mathematical Methods for Computer Science

Linear Algebra, 3rd day, Wednesday 6/30/04 REU Info:

27. The Fourier Transform in optics, II

The Fourier Transform Method

Course 2BA1, Section 11: Periodic Functions and Fourier Series

18.06 Problem Set 10 - Solutions Due Thursday, 29 November 2007 at 4 pm in

MATH 4330/5330, Fourier Analysis Section 8, The Fourier Transform on the Line

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

MATH 205C: STATIONARY PHASE LEMMA

Transcription:

Chapter Fourier Series and Transforms. Fourier Series et f(x be an integrable functin on [, ]. Then the fourier co-ecients are dened as a n b n f(x cos f(x sin The claim is that the function f then can be written as f(x a 0 + n [ a n cos dx n 0, dx n > 0. (. + b n sin ]. The rhs is called the fourier series of f. Using fourier trick, one can obtain the expressions for a n and b n. Multiplying both sides of the expression by cos ( mπx for some m>0 and integrating one gets ( mπx f(x cos dx a ( 0 mπx ( mπx ( mπx ] cos dx + [a n cos cos dx + b n cos sin dx n 0+ [a n δ m,n +0]a m n This proves the formula given by Equation.. Example. et f(x x on [ π, π]. Find fourier series. 8

The function is odd, hence for all n and Thus the fourier series is b n π a n π π π π π x cos(nxdx 0 x sin(nxdx n ( n+ f(x [sin (x sin (x+ ] Figure.: Fourier series with term, 3 terms and 00 terms Two points can be noted from the example. The convergence is not uniform, some points converge faster than other points.. At x ±π the fourier series does not converge to f. Example 3. et f(x x / where x [, ]. This is a trianglular function. The function is even, thus fourier series will contain onlycos terms. b n f(x sin dx 0. and for n>0, a n f(x cos dx 0 ( + x cos dx + ( x cos dx 0 n π ( ( n 4 n π odd n 0 even n 9

Simillarly, a 0. The fourier series is f(x + 4 π [cos ( πx + ( ] 3πx 9 cos +. Dirichlet Condition Denition 4. A function f on [, ] is said to be satisfy Dirichlet conditions if f has nite number of extrema, f has nite number of discontinuities, f is abosultely integrable, f is bounded. Theorem 5. Suppose a function f satises Dirichlet conditions. Then the fourier series of f converges to f at points where f is continuous. The fourier series converges to the midpoint of discontinuity at points where f is discontinuous. Example 6. A square function f is dened as { 0 x [, 0] f(x x [0,] The fourier coecients are a 0, a n 0 { b n nπ odd n 0 even n The fourier series is + ( πx π sin + ( 3πx 3π sin + Clearly, at x 0series has a value 0.5 which is equal to [f(0+ + f(0 ] /. Theorem 7. If a function f on [, ] is square integrable, that is f(x dx exists, then the fourier series of f converges to f almost everywhere. 0

Exponential Fourier Series Substituting cos x [e x + e x ] / and sin x [e x e x ] /i, the fourier series of a function f can be rewritten as [ a n cos f(x a 0 + n n ( c n exp i nπx + b n sin ] where (a n ib n n>0 c n (a n + ib n n<0 a 0 n 0 Or, c n ( f(x exp i nπx Typically, if the argument of f is a time variable, then ω n nπ/ are called frequencies. The fourier coecients are usually labelled by frequencies, that is c n is written as c ωn. Example 8. Exponential fourier coecients for triangular function are given by c 0 c n 0 c n (n π The following graph shows the fourier coecients as a function of frequencies. 0.5 CΩ 5 Π 3 Π Π Π 3 Π 5 Π Ω. Fourier Transform For an interval [, ], the fourier frequencies are given by ω n nπ/. When, the fourier frequencies become a continuous variable. To get this idea, redene the fourier coecients c ωn f(x exp ( iω n x

Then the fourier series becomes Now, let ω π/, then f(x n c ωn exp (iω n x f(x n c ωn exp (iω n x ω c(ω exp (iωx dω as The last step is just the denition of Riemann integral. The function c(ω is called as fourier transform of f(x. It is denoted as c F (f. Dierent text books dene fourier transform dierently by placing the constat factor dierently. In this note, fourier transform is dened as c(ω f(x f(x exp ( iωx dx c (ω exp (iωx dω. Example 9. et f(x for x a, and is 0 otherwise. If g is the FT of f, then g(ω a a a sin (ωa ωa f(x exp ( iωx dx exp ( iωx dx f x g Ω a a x 4 Π Π Π 4 Π Ω Here is another expample that illustrates the uncertainty principle.

Example 30. et f(x a/π exp[ ax ]. Ifg is the FT of f, then g(ω a π f(x exp ( iωx dx a π e ω /4a exp ( ω 4a exp ( ax iωx dx ( exp a ( x + iω dx a The width of the gaussian function is dened by parameter a. Thusf(x is broad if a is small. And g(ω is narrow and sharp for small a. Here is a very useful theorem called Parseval theorem. Theorem 3. If g is the fourier transform of a square integrable function f then f (x dx g(ω dω. Uncertainty Relation The uncertainty relation is built into the fourier transform. It may be interpreted dierently depending on the situation in which it is applied. Here we state the theorem without proof. Theorem 3. Suppose g is a fourier transform of a square integrable function f that is normalized to unity, that is. et µ f σf µ g σg then σ f σ g. f(x dx x f(x dx (x µ f f(x dx ω f(ω dω (ω µ ω f(ω dω The quantities σ are called uncertainties. 3

Example 33. et f(x (a/π /4 exp[ ax /]. Then f(x dx Clearly, µ f 0and If g is the FT of f, then Note that Now µ g 0. Then Then, σ f g(ω σ g x f(x dx a ( /4 exp ( ω. πa a g(ω dω ω g(ω dω a σ f σ g 4