FOURIER ANALYSIS MATH 4100.001 SPRING 2012 Instructor: Dr. J.

Iaia Time: MW 12:00-1:20 Oce: GAB 420 Place: CURY 110 Oce Hours: TTH 11-1, or by appt. email: iaia@unt.edu Webpage: http://www.math.unt.edu/iaia Text: G. Folland, Fourier Analysis and its Applications, 1992. Prerequisites: Math 1720, Math 2700, Math 2730, Math 3410 GRADING POLICY Exam 1 - Feb. 15 - 20% Exam 2 - Mar. 14 - 20% Exam 3 - Apr. 18 - 20% Final - May 11 - 20% - 10:30am-12:30pm Homework - weekly 20% Exams: Exams must be taken on the dates listed above. Exceptions will be considered only if one has written documentation certifying ones absence. Homework: Homework will be assigned each class and collected weekly. Five problems will be chosen at random and graded. Homework is extremely important and students are highly encouraged to spend a lot of time working on the homework problems. Attendance: Students are responsible for all work assigned and announcements made during any absence. Code of Conduct: Students are expected to be respectful of others at all times. This includes keeping talk and other noise to a minimum while a lecture is in progress or an exam is being taken. Any student being disruptive may be dismissed from the class meeting. Cheating will not be tolerated and anyone found guilty of cheating may receive an F for the semester. The Student Evaluation of Teaching Eectiveness (SETE) is a requirement for all organized classes at UNT. This short survey will be made available to you at the end of the semester, providing you a chance to comment on how this class is taught. I am very interested in feedback from students, as I work to continually improve my teaching. I consider the SETE to be an important part of your participation in this class. Students with disabilities: It is the responsibility of students with disabilities to provide the instructor with appropriate documentation from the Dean of Students Oce. Semester grades are determined by averaging the grades on the 3 exams, the nal exam, and the homework. Letter grades will be based on this average and will follow this scheme: A 90- ;B 80-89; C 70-79; D 60-69; F -59

Course Description In this course we will determine under what conditions it is possible to express a given function on [, ] as a trigonometric series- i.e. one of the form a0 + [an cos(nx) + bn sin(nx)]. 2 n=1 This will be related to solving some important partial dierential equations including the heat equation, wave equation, and the Laplace equation. This will be generalized to an arbitrary interval [a, b] and will lead to a discussion of the Fourier transform which is a limit of Fourier series on larger and larger intervals. Applications will be chosen from among dierential equations, signal processing, and probability. If time permits we may discuss discrete Fourier transforms and the Fast Fourier Transform (FFT) algorithm. Course Objectives After taking this course the student should be able to calculate the Fourier series of standard functions like f (x) = x, x2 , ex and use Fourier series to solve linear partial dierential equations. The student should also know at which points the Fourier series of a function is actually equal to the function. The student should also be able to calculate the Fourier transform and the inverse Fourier transform of a function. The student should be able to calculate the convolution of two functions and the Fourier transform of a convolution. Also, the student should be able to use the Fourier transform to solve linear partial dierential equations on the whole real line.

Course Outline Meeting 1 - some important dierential equations Meeting 2 - separation of variables Meeting 3 - the Fourier series of a periodic function Meeting 4 - calculation of some Fourier series Meeting 5 - statement and proof that if f is 2 -periodic and piecewise smooth then the Fourier series of f converges to f absolutely and uniformly Meeting 6 - continuation of the proof in the previous lecture Meeting 7 - applications of Fourier series Meeting 8 - review for exam 1 Meeting 9 - exam 1 Meeting 10 - convolution of functions Meeting 11 - the Fourier transform and the inverse Fourier transform Meeting 12 - calculation of some Fourier transforms Meeting 13 - statement and proof that the Fourier transform of a convolution is the product of the Fourier transforms

Meeting 14 - one dimensional heat ow Meeting 15 - one dimensional wave motion Meeting 16 - review for exam 2 Meeting 17 - exam 2 Meeting 18 - the Dirichlet problem Meeting 19 - inner products Meeting 20 - convergence and completeness Meeting 21 - best approximation in L2 Meeting 22 - the dominated convergence theorem Meeting 23 - Bessels equation Meeting 24 - review for exam 3 Meeting 25 - exam 3 Meeting 26 - asymptotics and zeros of Bessel functions Meeting 27 - orthogonal sets of Bessel functions Meeting 28 - applications of Bessel functions Meeting 29 - review for nal exam Meeting 30 - nal exam