Chapter 6: Fast Fourier Transform and Applications
|
|
- Leona Long
- 6 years ago
- Views:
Transcription
1 Chapter 6: Fast Fourier Transform and Applications Michael Hanke Mathematical Models, Analysis and Simulation, Part I Read: Strang, Ch. 4. Fourier Sine Series In the following, every function f : [,π] C will be identified with the periodic continuation onto R. A function f : [,π] C is called odd if f(x) f( x) for all x [π,π]. A function f is called even if f(x) f( x) for all x [π,π]. If f is even, f is odd. Similarly, if f is odd, f is even. Most important odd functions: sin(nx). Fourier sine series: S(x) b n sinnx Q: Which functions f can be represented by a sine series? A: Very many (if representation is understood in the correct way). Michael Hanke, NADA, November 6, 28 Michael Hanke, NADA, November 6, 28 Computation of the Coefficients A First Example: Square Wave From sinnxsinkx /2cos(n k)x /2cos(n+k)x it follows {, if n k, sinnxsinkxdx π, if n k. The functions sinnx are orthogonal to each other in L 2 (,π). Assume that f(x) b n sinnx. Multiply through by sinkx and integrate: So f(x)sinkxdx b n b k π sinnxsinkxdx b k f(x) sinkxdx. sin 2 kxdx πb k. Assumptions: The series must converge in such a sense that integration is possible after multiplication by sinkx. Summation and integration must be exchangable., if x (,), SW(x), if x (,π),, if x,,π. Fourier sine series: SW(x) 4 [ sinx π + sin3x + sin5x + sin7x ] Michael Hanke, NADA, November 6, 28 2 Michael Hanke, NADA, November 6, 28 3
2 Gibbs Phenomenon Fourier Cosine Series In the case of even functions, the prototypes are cosines, cosnx. Fourier cosine series: C(x) a + a n cosnx. Again, we have orthogonality:, if n k, cosnxcoskxdx, if n k, π, if n k > Let f : [,π] C be an even function. Assume f(x) a + a n cosnx..2 SW N9 N5 N Gibbs phenomenon: Partial sums overshoot near jumps. Then: a k { R π R π π f(x)dx, if k, f(x)coskxdx, if k >. Michael Hanke, NADA, November 6, 28 4 Michael Hanke, NADA, November 6, 28 5 Examples An Observation: Decay of Coefficients Repeating Ramp RR is obtained by integrating SW: RR(x) x. Fourier cosine series: RR(x) π 2 π [ cosx + cos3x + cos5x + cos7x ] Note: The coefficients are equal to those obtained by termwise intergration of the sine series for SW. Up-Down UD is obtained as the derivative of SW: coefficients functions no decay Delta functions /k decay Step functions (with jumps) /k 2 decay Ramp functions (with corners) /k 4 decay Spline functions (jumps in f ) r k decay (r < ) Analytic functions The partial sums for analytical functions converge exponentially fast! This is the basis for fast solution methods for certain partial differential equations. Details will follow later. Fourier cosine series: UD(x) 2δ(x) 2δ(x π). UD(x) 4 [cosx+cos3x+cos5x+cos7x+ ].?? π Q: What about convergence? The terms are not a zero sequence! Michael Hanke, NADA, November 6, 28 6 Michael Hanke, NADA, November 6, 28 7
3 Fourier Series For Dirac s Delta Functional Dirac s Delta Functional (cont) Definition: For every continuous function f on [, π], δ(x) f(x)dx f(). δ is not a usual function. It is a functional: δ : C[,π] C. A simple calculation gives: Partial sums: δ(x) + π [cosx+cos2x+cos3x+ ]. δ N [+2cosx+ +2cosNx] Q: In which sense converges δ N against δ? A: For every continuous function f C[,π], it holds δ N (x) f(x)dx δ(x) f(x)dx f(). Notation: Weak convergence. Michael Hanke, NADA, November 6, 28 8 Michael Hanke, NADA, November 6, 28 9 Fourier Series: General Periodic Functions Fouries Series: The Complex Version Let f : [,π] C be any (nice) function. Then f f even + f odd f even /2( f(x)+ f( x)) f odd /2( f(x) f( x)) Hence, f can be written as a sum of sine and cosine series: f f even + f odd a + a n cosnx+ b n sinnx Moivre s theorem: e iα cosα+isinα. Define c k (a k ib k )/2, c k (a k + ib k )/2. Then: c k e ikx + c k e ikx c k (coskx+isinkx)+c k (coskx isinkx) (c k + c k )coskx+i(c k c k )sinkx a k coskx+b k sinkx. The Fourier series can be equivalently written as f(x) n c n e inx. In what follows we will always use the complex notation! Michael Hanke, NADA, November 6, 28 Michael Hanke, NADA, November 6, 28
4 Properties Further Useful Properties Orthogonality in L 2 (,π): Let φ k (x) exp(ikx) for k..., 2,,,,2,... Every f L 2 (,π) (complex!) has a representation f(x) + k ˆf k e ikx, with ˆf k f 2( f,φ k) f(x)e ikx dx in the sense of L 2 (,π). (The partial sums converge towards f in the means square norm.) Since SW L 2 (,π), we conclude that pointwise convergence cannot always be expected. Since e ikx coskx+isinkx, the convergence will be the better the more periodic u is. Parseval s identity: Consequently, (φ k,φ j ) e ikx e i jx dx e i(k j)x dx δ k j For the derivatives, we have f(x) 2 dx f 2 + ˆf k 2 k f L 2 + (,π) ˆf k 2 <. k f (p) + (x) (ik) p ˆf k e ikx k Let H p per {v H p (,π) v is -periodic}. f Hper p + k 2p ˆf k 2 <. k This is the generalization of the decay property for Fourier coefficients. (Strang, p. 32, 327) Michael Hanke, NADA, November 6, 28 2 Michael Hanke, NADA, November 6, 28 3 The Discrete Fourier Transform (DFT) Read: Strang, Ch. 4.3 Without loss of generality assume the basic interval to be [,]. Let [, ] be subdivided into N equidistant intervals, h N, x j jh. For a periodic function, f() f() f(x N ) such that the trapezoidal rule reads Z Here, we used f(x)e ikx dx h w e ih f j e ikx j N N ( f ) j e ih jk f j w jk : c k The discrete version of the inverse transformation is, Theorem. f j k c k e ikx j k c k w k j One transformation is the inverse of the other, f j f j Proof. Compute: The Proof f j k k N c k w k j N l f l w lk w k j l f l w ( j l)k k Since { w ( j l)n w ( j l)k w, if j l, k N, if j l, the result follows. Some common notation: w w 2 w F w 2 w 4 w 2() w w 2() w ()2 Then it holds: f Fc, c N Ff, F N F Note: F is symmetric, but not Hermitian. Michael Hanke, NADA, November 6, 28 4 Michael Hanke, NADA, November 6, 28 5
5 The Fast Discrete Fourier Transform (FFT) FFT (cont.) The naive application of the discrete Fourier transform has complexity O(N 2 ). (matrix-vector multiplication) Example: N 2 2. The naive approach requires complex multiplications. The FFT requires only multiplications. The basic idea: Let N be a power of 2 and M N/2. f j k M k c k w k j c k w k j + c k w k j k even k odd c 2k (w 2 ) k j } {{ } : f j c 2k +(w 2 ) k j k } {{ } : f j +w j M f j and f j are discrete Fourier transform of half the original size M! This formula can be simplified: For j,...,m : Take it as it stands. For j M,...,N : Let j j M. It holds w M and w N : This gives the identities w M+ j w M w j, (w 2 ) k j (w 2 ) k j. f j f j + w j f j f j+m f j w j f j } j,...,m This recursion gives rise to a divide-and-conquer strategy. Computational complexity: O(N logn) Michael Hanke, NADA, November 6, 28 6 Michael Hanke, NADA, November 6, 28 7 Assumptions: FFT: Computational Complexity The exponentials w j are precomputed. Let W(N) be the number of complex operations for a FFT of length N. W(2M) 2W(M)+4M,W(). Denote w j W(2 j ) and N 2 n : w,w j 2w j j. Multiply the equation by 2 N j and sum up: Consequently, n j 2 n j w j 2 n j 2 n j( w j + 2 j) 2n2 n n + 2 n j w j W(N) w n 2n2 n 2N ld N Shifted DFT Using the base interval [,] leads to the standard DFT. What happens if we use [,π] instead? (Let N be even.) c k N N N N N ik jh f j e f j e ik jh + e i ik jh N f j e jn/2 f j e ik jh + ik( j N)h N f j e jn/2 l N/2 f j e ik jh + N f l e iklh l N/2 Similarly, for the inverse DFT it holds, f l Order of coefficients: f l e iklh c k e iklh, l N/2,...,N/2. DFT: (c,c,...,c ) shifted DFT: (c N/2,c N/2+,...,c,c,...,c ) This is what matlab s fftshift does. Michael Hanke, NADA, November 6, 28 8 Michael Hanke, NADA, November 6, 28 9
6 Fourier Integrals Fourier Integrals: The Key Rules Read: Strang, p Fourier series are convenient to describe periodic functions. Equivalently, f must be defined on a finite interval. Q: What happens if the function is not periodic? Consider f : R C. The Fourier transform ˆf F ( f) is given by Z ˆf(k) f(x)e ikx dx, k R. Examples: d f/dx ik ˆf(k) Z f(x)dx ˆf(k)/(ik) f( d) e ikd ˆf(k) ê ic f ˆf(k c) Here, f should be in L (R). Inverse transformation: f(x) Z ˆf(k)e ikx dk Note: Often, you will se a more symmetric version by using a different scaling. Theorem of Plancherel: f L 2 (R) ˆf L 2 (R) and Z f(x) 2 dx Z ˆf(k) 2 dk. Delta functional ˆδ(k) for all k R. Centred square pulse Let {, if L x L, f(x), if x > L. Then ˆf(k) 2 sinkl 2LsinckL, k where sinct sint/t is the Sinus cardinalis function. Michael Hanke, NADA, November 6, 28 2 Michael Hanke, NADA, November 6, 28 2 Sampling The Sampling Theorem Read: Strang, p By using the Fourier transform F and its inverse, any function can be reconstructed. Q: Can a function be reconstructed by using only discrete samples? Obviously, no. The questions becomes the general interpolation problem which does not have a unique solution. Often, an interpolation problem gets a unique solution if the class of possible interpolants is restricted. Q: What is the correct class if we stick to Fourier transforms? Consider one period of a simple harmonic f(t) ae i(ωt+φ). Obviously, one needs (at least) two samples in [, ω/()) for determining the two parameters. Using an a-priori bound on the Fourier transform ˆf of a function f, this function can be reconstructed by discrete sampling. Theorem: (Shannon-Nyquist) Assume that f is band-limited by W, i.e., ˆf(k) for all k W. Let T π/w be the Nyquist rate. Then it holds f(x) f(nt)sincπ(x/t n) where sinct sint/t is the Sinus cardinalis function. Note: The sinc function is band-limited: {, if k π, ŝinc(k), elsewhere. Use now equidistant sampling with step size T. Definition: Nyquist sampling rate: T π/ω. For a given sampling rate T, frequencies higher than the Nyquist frequency ω N π/t cannot be detected. A higher frequency harmonic is mapped to a lower frequency one. This effect is called aliasing. Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, 28 23
7 Sampling Theorem: Proof Proof (cont) Assume for simplicity W π. By the inverse Fourier transform, Define f(x) f(k) Z ˆf(k)e ikx dk ˆf(k)e ikx dk. { ˆf(k), if < x < π, periodic continuation, if k π. f can be represented as a Fourier series: where ˆ f n Hence, for < x < π, f(k) n f(k)e ink dk ˆf(k) f(k) n ˆ f n e ink, ˆf(k)e ink dk f( n). f( n)e ink. Therefore, f(x) n n n ˆf(k)e ikx dk ( f( n)e )e ink ikx dk n f( n) e ik(x+n) dk f( n) sinπ(x+n) π(x+n) sinπ(x n) f(n) π(x n) Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, Spectral Interpolation Spectral Interpolation (cont.) Read: Strang, p For the DFT (on [,]) we know f(x j ) k Consider the function Π f, Π f(x) c k e ikx j, j,...,n. k c k e ikx, x R. This is an interpolating trigonometric polynomial, the so-called spectral interpolant. Note: Even for real f, Π f is in general complex (with the exception of the grid points x j, of course). Q: How can one obtain a real interpolant for a real-valued function?. Replace Π f by the shifted interpolant, Π c f(x) c k e ikx, x R. Note: Π f Π c f with the exception of the grid points. 2. Replace Π c f by its symmetrized variant, P f(x) N/2 c k e ikx, x R. Here, N km 2 c M + c M+ + + c + 2 c N. This interpolation can be explicitely written down, P f(x) p(x) psinc is the periodic sinc function, f j psinc(x jh). psinc(x) N N/2 e ikx sin(πx/h) (/h) tan(x/2) Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, 28 27
8 Spectral Methods: Differentiation Idea: Given a function u at discrete points, interpolate by a suitable smooth function p(x) and set u (x j ) p (x). Examples:. Piecewise linear interpolation: u (x j ) u j+ u j h 2. Piecewise quadratic interpolation: u (x j ) u j+ u j 2h Let s now use spectral interpolation: Remarks: p(x) u j psinc(x jh) u (x j ) p (x j ) u j d dx psinc(x j jh) Repeat: The Finite Element Method Start with a differential equation. Derive the weak formulation a(u,v) L(v) for all v V and, if possible, the minimization formulation P(u) a(u,u) L(u) min! 2 (M) Find an approximating (finite dimensional) space V h V and solve V and M, respectively: Galerkin and Ritz methods. The method yields up to a constant the best approximation of u in V h. (V) Piecewise polynomial interpolation uses only local informations. Spectral differentiation uses all gridpoints for evaluating one derivative. Spectral differentiation leads to full matrices DP while standard differences give rise to sparse matrices. Computational complexity: Polynomial: O(N) Spectral via FFT: O(N logn) Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, FEM: Pros and Cons Possible Alternatives Advantages with finite elements: Very flexible, easy to adapt to complex domains and/or solutions; Fast algorithms for its implementation, fast solvable by, e.g., multigrid methods; In principle, good convergence: With Pp elements, e h O(h p+ ). Drawbacks with finite elements: Many degrees of freedom necessary for obtaining a good approximation (especially in 3D); Very hard to construct Pp elements in higher dimensions. Q: Are there alternatives? Q: Are there alternatives? A: Use basis functions which are closely adapted to the problem at hand. Advantages: We will obtain exponential convergence, that is, faster than any power of h. Only very few degrees of freedom needed for high accuracy. Drawbacks: The stiffness matrix will be full. Every problem needs its own set of ansatz functions. Q: May it be efficient in practice? A: Fast transformation algorithms. Michael Hanke, NADA, November 6, 28 3 Michael Hanke, NADA, November 6, 28 3
9 An Example Example: The Analytical Solution Find the -periodic solutions of with a constant r >. u + ru f(x),x (,) Weak formulation, with V H per(,): Z a(u,v) (u v + ru v)dx, L(v) Z f vdx. Insert the Fourier expansion and test against all basis functions φ j e ikx : Z a(u,φ j ) ( + k + Z û k k û j ( j 2 + r). ikû k e ikx i je i jx + + k (ik ( i j)+r)e i(k j)x dx û k e ikx e i jx )dx Analogously, Hence, a(u,φ j ) û j ( j 2 + r). Z L(v) f e i jx dx ˆf j. û j j 2 + r ˆf j, j,±,±2,... The solution seems even ok if r is not a negative square of an integer. If even f H p per(,), then u H p+2 per (,): + k k 2p+4 û k 2 + k k 2p+4 ˆf k 2 + (k 2 + r) < k 2p ˆf 2 k 2 < k Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, Example: Galerkin s Method Applied Apply now Galerkin s method with V N {v v +N/2 ˆv k e ikx }: Since R e ikx e i jx dx for i j, the solution is easily seen to be: Error estimation: Theorem u N N/2 û hk e ikx with û hk û k. e N (x) u(x) u N (x) û k e ikx For all square integrable functions f, e N 6 N 2 f For f L 2 (,), Galerkin s Method: Proofs e N 2 If even f H p per(,): e N 2 û k 2 (N 2 /4+r) 2 f 2 6 N4 f 2 ˆf k 2 (k 2 + r) 2 (N/2) 2p (N 2 /4+r) 2 ˆf k 2 (k 2 + r) 2 k 2p ˆf k 2 k 2p (k 2 + r) 2 k 2p ˆf k 2 C(p)2 N 2p+2 (quadratic convergence). If even f H p per(,): O ( N (p+)) If f is infinitely often differentiable, we have exponential convergence. Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, 28 35
10 What Is Behind It? Q: Why on earth does this method work that good?? A: The exponentials e ikx are eigenfunctions of the differential operator. (Here: u + ru) Later on, we will see that the discrete versions of the exponentials are eigenfunctions of the finite difference discretizations of certain differential equations. This makes it clear why they will be important for analyzing numerical schemes. (Pseudo-)Spectral Methods Read: Strang, p Consider again the equation u + ru f. Ansatz as before u N c k e ikx. Collocation: Use test functions v j (x) δ(x x j ) for x j jh π, h /N. Equivalently, u N(x j )+ru N (x j ) f(x j ), j N/2,...,N/2. Some computations: The solution becomes c k ( (ik) 2 e ikx j + re ikx j ) [c k (k 2 + r) ˆf k ]e ikx j, all j c k (k 2 + r) ˆf k, all k c k ˆf k k 2 + r. ˆf k e ikx j This is the same solution as obtained by the Galerkin method. Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, Pseudo-Spectral Methods Other Applications Of FFT Fourier series are only well-suited for periodic boundary conditions. In case of Dirichlet boundary conditions, Chebyshev polynomials T k (x) are a viable alternative. (Strang, p ) Chebyshev polynomials are eigenfunctions of the equation d ( ) dt λwt, < x < dx w dx Digital signal processing Digital image processing (encoding [JPEG, MPEG, DVB], denoising, reconstruction,...) Analysis of random processes Stability analysis of numerical schemes with w(x) x 2. The corresponding scalar product is ( f,g) w R w(x) f(x)g(x)dx. Michael Hanke, NADA, November 6, Michael Hanke, NADA, November 6, 28 39
Chapter 1: The Finite Element Method
Chapter 1: The Finite Element Method Michael Hanke Read: Strang, p 428 436 A Model Problem Mathematical Models, Analysis and Simulation, Part Applications: u = fx), < x < 1 u) = u1) = D) axial deformation
More informationMath 489AB A Very Brief Intro to Fourier Series Fall 2008
Math 489AB A Very Brief Intro to Fourier Series Fall 8 Contents Fourier Series. The coefficients........................................ Convergence......................................... 4.3 Convergence
More informationThe Pseudospectral Method
The Pseudospectral Method Heiner Igel Department of Earth and Environmental Sciences Ludwig-Maximilians-University Munich Heiner Igel Computational Seismology 1 / 43 Outline 1 Introduction Motivation History
More informationNumerical Methods I Orthogonal Polynomials
Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)
More informationMathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT
Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering
More informationNotes on Fourier Series and Integrals Fourier Series
Notes on Fourier Series and Integrals Fourier Series et f(x) be a piecewise linear function on [, ] (This means that f(x) may possess a finite number of finite discontinuities on the interval). Then f(x)
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationTopics in Fourier analysis - Lecture 2.
Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationComputer Problems for Fourier Series and Transforms
Computer Problems for Fourier Series and Transforms 1. Square waves are frequently used in electronics and signal processing. An example is shown below. 1 π < x < 0 1 0 < x < π y(x) = 1 π < x < 2π... and
More informationFourier Series. Department of Mathematical and Statistical Sciences University of Alberta
1 Lecture Notes on Partial Differential Equations Chapter IV Fourier Series Ilyasse Aksikas Department of Mathematical and Statistical Sciences University of Alberta aksikas@ualberta.ca DEFINITIONS 2 Before
More informationFourier Series. (Com S 477/577 Notes) Yan-Bin Jia. Nov 29, 2016
Fourier Series (Com S 477/577 otes) Yan-Bin Jia ov 9, 016 1 Introduction Many functions in nature are periodic, that is, f(x+τ) = f(x), for some fixed τ, which is called the period of f. Though function
More informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationFOURIER SERIES AND INTEGRALS
CHAPTER 4 FOURIER SERIES AND INTEGRALS 4. FOURIER SERIES FOR PERIODIC FUNCTIONS This section explains three Fourier series: sines, cosines, and exponentials e ikx. Square waves ( or 0 or ) are great examples,
More informationSpectral Methods and Inverse Problems
Spectral Methods and Inverse Problems Omid Khanmohamadi Department of Mathematics Florida State University Outline Outline 1 Fourier Spectral Methods Fourier Transforms Trigonometric Polynomial Interpolants
More informationMa 221 Eigenvalues and Fourier Series
Ma Eigenvalues and Fourier Series Eigenvalue and Eigenfunction Examples Example Find the eigenvalues and eigenfunctions for y y 47 y y y5 Solution: The characteristic equation is r r 47 so r 44 447 6 Thus
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationMath 118, Handout 4: Hermite functions and the Fourier transform. n! where D = d/dx, are a basis of eigenfunctions for the Fourier transform
The Hermite functions defined by h n (x) = ( )n e x2 /2 D n e x2 where D = d/dx, are a basis of eigenfunctions for the Fourier transform f(k) = f(x)e ikx dx on L 2 (R). Since h 0 (x) = e x2 /2 h (x) =
More informationFourier Series and Integrals
Fourier Series and Integrals Fourier Series et f(x) beapiece-wiselinearfunctionon[, ] (Thismeansthatf(x) maypossessa finite number of finite discontinuities on the interval). Then f(x) canbeexpandedina
More informationFourier and Partial Differential Equations
Chapter 5 Fourier and Partial Differential Equations 5.1 Fourier MATH 294 SPRING 1982 FINAL # 5 5.1.1 Consider the function 2x, 0 x 1. a) Sketch the odd extension of this function on 1 x 1. b) Expand the
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationThe discrete and fast Fourier transforms
The discrete and fast Fourier transforms Marcel Oliver Revised April 7, 1 1 Fourier series We begin by recalling the familiar definition of the Fourier series. For a periodic function u: [, π] C, we define
More informationMath 5440 Problem Set 7 Solutions
Math 544 Math 544 Problem Set 7 Solutions Aaron Fogelson Fall, 13 1: (Logan, 3. # 1) Verify that the set of functions {1, cos(x), cos(x),...} form an orthogonal set on the interval [, π]. Next verify that
More informationMathematics for Engineers II. lectures. Power series, Fourier series
Power series, Fourier series Power series, Taylor series It is a well-known fact, that 1 + x + x 2 + x 3 + = n=0 x n = 1 1 x if 1 < x < 1. On the left hand side of the equation there is sum containing
More informationNumerical Approximation Methods for Non-Uniform Fourier Data
Numerical Approximation Methods for Non-Uniform Fourier Data Aditya Viswanathan aditya@math.msu.edu 2014 Joint Mathematics Meetings January 18 2014 0 / 16 Joint work with Anne Gelb (Arizona State) Guohui
More informationIntroduction to the FFT
Introduction to the FFT 1 Introduction Assume that we have a signal fx where x denotes time. We would like to represent fx as a linear combination of functions e πiax or, equivalently, sinπax and cosπax
More informationJim Lambers ENERGY 281 Spring Quarter Lecture 5 Notes
Jim ambers ENERGY 28 Spring Quarter 27-8 ecture 5 Notes These notes are based on Rosalind Archer s PE28 lecture notes, with some revisions by Jim ambers. Fourier Series Recall that in ecture 2, when we
More informationThe Pseudospectral Method
The Pseudospectral Method Heiner Igel Department of Earth and Environmental Sciences Ludwig-Maximilians-University Munich Heiner Igel Computational Seismology 1 / 34 Outline 1 Infinite Order Finite Differences
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationLES of Turbulent Flows: Lecture 3
LES of Turbulent Flows: Lecture 3 Dr. Jeremy A. Gibbs Department of Mechanical Engineering University of Utah Fall 2016 1 / 53 Overview 1 Website for those auditing 2 Turbulence Scales 3 Fourier transforms
More informationSPECTRAL METHODS: ORTHOGONAL POLYNOMIALS
SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration
More informationLecture 6 January 21, 2016
MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationMATH 220 solution to homework 4
MATH 22 solution to homework 4 Problem. Define v(t, x) = u(t, x + bt), then v t (t, x) a(x + u bt) 2 (t, x) =, t >, x R, x2 v(, x) = f(x). It suffices to show that v(t, x) F = max y R f(y). We consider
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 3
MATH 167: APPLIED LINEAR ALGEBRA Chapter 3 Jesús De Loera, UC Davis February 18, 2012 Orthogonal Vectors and Subspaces (3.1). In real life vector spaces come with additional METRIC properties!! We have
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationExamples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.
s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:
More informationmultiply both sides of eq. by a and projection overlap
Fourier Series n x n x f xa ancos bncos n n periodic with period x consider n, sin x x x March. 3, 7 Any function with period can be represented with a Fourier series Examples (sawtooth) (square wave)
More informationPHYS 502 Lecture 3: Fourier Series
PHYS 52 Lecture 3: Fourier Series Fourier Series Introduction In mathematics, a Fourier series decomposes periodic functions or periodic signals into the sum of a (possibly infinite) set of simple oscillating
More informationMath 121A: Homework 6 solutions
Math A: Homework 6 solutions. (a) The coefficients of the Fourier sine series are given by b n = π f (x) sin nx dx = x(π x) sin nx dx π = (π x) cos nx dx nπ nπ [x(π x) cos nx]π = n ( )(sin nx) dx + π n
More informationPolynomial Approximation: The Fourier System
Polynomial Approximation: The Fourier System Charles B. I. Chilaka CASA Seminar 17th October, 2007 Outline 1 Introduction and problem formulation 2 The continuous Fourier expansion 3 The discrete Fourier
More informationComputational Science and Engineering I Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 18.085 Computational Science and Engineering I Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.085
More informationFourier Series and Fourier Transform
Fourier Series and Fourier Transform An Introduction Michael Figl Center for Medical Physics and Biomedical Engineering Medical University of Vienna 1 / 36 Introduction 2 / 36 Introduction We want to recall
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More information1 Distributions (due January 22, 2009)
Distributions (due January 22, 29). The distribution derivative of the locally integrable function ln( x ) is the principal value distribution /x. We know that, φ = lim φ(x) dx. x ɛ x Show that x, φ =
More informationswapneel/207
Partial differential equations Swapneel Mahajan www.math.iitb.ac.in/ swapneel/207 1 1 Power series For a real number x 0 and a sequence (a n ) of real numbers, consider the expression a n (x x 0 ) n =
More informationFourier Series. Fourier Transform
Math Methods I Lia Vas Fourier Series. Fourier ransform Fourier Series. Recall that a function differentiable any number of times at x = a can be represented as a power series n= a n (x a) n where the
More information14 Fourier analysis. Read: Boas Ch. 7.
14 Fourier analysis Read: Boas Ch. 7. 14.1 Function spaces A function can be thought of as an element of a kind of vector space. After all, a function f(x) is merely a set of numbers, one for each point
More information7: FOURIER SERIES STEVEN HEILMAN
7: FOURIER SERIES STEVE HEILMA Contents 1. Review 1 2. Introduction 1 3. Periodic Functions 2 4. Inner Products on Periodic Functions 3 5. Trigonometric Polynomials 5 6. Periodic Convolutions 7 7. Fourier
More informationLast Update: April 4, 2011
Math ES Winter Last Update: April 4, Introduction to Partial Differential Equations Disclaimer: his lecture note tries to provide an alternative approach to the material in Sections..6 in the textbook.
More informationMaths 381 The First Midterm Solutions
Maths 38 The First Midterm Solutions As Given by Peter Denton October 8, 8 # From class, we have that If we make the substitution y = x 3/, we get # Once again, we use the fact that and substitute into
More informationConvergence of Fourier Series
MATH 454: Analysis Two James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April, 8 MATH 454: Analysis Two Outline The Cos Family MATH 454: Analysis
More informationThe Fourier series for a 2π-periodic function
The Fourier series for a 2π-periodic function Let f : ( π, π] R be a bounded piecewise continuous function which we continue to be a 2π-periodic function defined on R, i.e. f (x + 2π) = f (x), x R. The
More informationFourier Series and the Discrete Fourier Expansion
2 2.5.5 Fourier Series and the Discrete Fourier Expansion Matthew Lincoln Adrienne Carter sillyajc@yahoo.com December 5, 2 Abstract This article is intended to introduce the Fourier series and the Discrete
More informationConstructing Approximation Kernels for Non-Harmonic Fourier Data
Constructing Approximation Kernels for Non-Harmonic Fourier Data Aditya Viswanathan aditya.v@caltech.edu California Institute of Technology SIAM Annual Meeting 2013 July 10 2013 0 / 19 Joint work with
More informationFast Fourier Transform
Fast Fourier Transform December 8, 2016 FFT JPEG RGB Y C B C R (luma (brightness), chroma 2 (color)) chroma resolution is reduced image is split in blocks 8 8 pixels JPEG RGB Y C B C R (luma (brightness),
More informationOutline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs
Boundary Value Problems Numerical Methods for BVPs Outline Boundary Value Problems 2 Numerical Methods for BVPs Michael T. Heath Scientific Computing 2 / 45 Boundary Value Problems Numerical Methods for
More informationPhysics 250 Green s functions for ordinary differential equations
Physics 25 Green s functions for ordinary differential equations Peter Young November 25, 27 Homogeneous Equations We have already discussed second order linear homogeneous differential equations, which
More informationA glimpse of Fourier analysis
Chapter 7 A glimpse of Fourier analysis 7.1 Fourier series In the middle of the 18th century, mathematicians and physicists started to study the motion of a vibrating string (think of the strings of a
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 12 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial,
More informationThe moral of the story regarding discontinuities: They affect the rate of convergence of Fourier series
Lecture 7 Inner product spaces cont d The moral of the story regarding discontinuities: They affect the rate of convergence of Fourier series As suggested by the previous example, discontinuities of a
More informationMA 201: Differentiation and Integration of Fourier Series Applications of Fourier Series Lecture - 10
MA 201: Differentiation and Integration of Fourier Series Applications of Fourier Series ecture - 10 Fourier Series: Orthogonal Sets We begin our treatment with some observations: For m,n = 1,2,3,... cos
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More informationAPPLIED MATHEMATICS Part 4: Fourier Analysis
APPLIED MATHEMATICS Part 4: Fourier Analysis Contents 1 Fourier Series, Integrals and Transforms 2 1.1 Periodic Functions. Trigonometric Series........... 3 1.2 Fourier Series..........................
More informationChapter 4 Sequences and Series
Chapter 4 Sequences and Series 4.1 Sequence Review Sequence: a set of elements (numbers or letters or a combination of both). The elements of the set all follow the same rule (logical progression). The
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationFourier transforms. c n e inπx. f (x) = Write same thing in an equivalent form, using n = 1, f (x) = l π
Fourier transforms We can imagine our periodic function having periodicity taken to the limits ± In this case, the function f (x) is not necessarily periodic, but we can still use Fourier transforms (related
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) Solutions For Problem Sheet 9 In this problem sheet, we derived a new result about orthogonal projections and used them to find least squares approximations
More informationSolutions to the Sample Problems for the Final Exam UCLA Math 135, Winter 2015, Professor David Levermore
Solutions to the Sample Problems for the Final Exam UCLA Math 135, Winter 15, Professor David Levermore Every sample problem for the Midterm exam and every problem on the Midterm exam should be considered
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationPeriodic functions: simple harmonic oscillator
Periodic functions: simple harmonic oscillator Recall the simple harmonic oscillator (e.g. mass-spring system) d 2 y dt 2 + ω2 0y = 0 Solution can be written in various ways: y(t) = Ae iω 0t y(t) = A cos
More informationFourier Transform Chapter 10 Sampling and Series
Fourier Transform Chapter 0 Sampling and Series Sampling Theorem Sampling Theorem states that, under a certain condition, it is in fact possible to recover with full accuracy the values intervening between
More informationLecture 34. Fourier Transforms
Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the
More informationa k cos(kx) + b k sin(kx), (1.1)
FOURIER SERIES. INTRODUCTION In this chapter, we examine the trigonometric expansion of a function f(x) defined on an interval such as x π. A trigonometric expansion is a sum of the form a 0 + k a k cos(kx)
More informationMath 54: Mock Final. December 11, y y 2y = cos(x) sin(2x). The auxiliary equation for the corresponding homogeneous problem is
Name: Solutions Math 54: Mock Final December, 25 Find the general solution of y y 2y = cos(x) sin(2x) The auxiliary equation for the corresponding homogeneous problem is r 2 r 2 = (r 2)(r + ) = r = 2,
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationProblem Set 8 - Solution
Problem Set 8 - Solution Jonasz Słomka Unless otherwise specified, you may use MATLAB to assist with computations. provide a print-out of the code used and its output with your assignment. Please 1. More
More informationLinear Algebra. Paul Yiu. Department of Mathematics Florida Atlantic University. Fall A: Inner products
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6A: Inner products In this chapter, the field F = R or C. We regard F equipped with a conjugation χ : F F. If F =
More informationFinal Examination Solutions
Math. 42 Fulling) 4 December 25 Final Examination Solutions Calculators may be used for simple arithmetic operations only! Laplacian operator in polar coordinates: Some possibly useful information 2 u
More informationMath 115 ( ) Yum-Tong Siu 1. Derivation of the Poisson Kernel by Fourier Series and Convolution
Math 5 (006-007 Yum-Tong Siu. Derivation of the Poisson Kernel by Fourier Series and Convolution We are going to give a second derivation of the Poisson kernel by using Fourier series and convolution.
More informationMath 3150 HW 3 Solutions
Math 315 HW 3 Solutions June 5, 18 3.8, 3.9, 3.1, 3.13, 3.16, 3.1 1. 3.8 Make graphs of the periodic extensions on the region x [ 3, 3] of the following functions f defined on x [, ]. Be sure to indicate
More informationFrom Fourier to Wavelets in 60 Slides
From Fourier to Wavelets in 60 Slides Bernhard G. Bodmann Math Department, UH September 20, 2008 B. G. Bodmann (UH Math) From Fourier to Wavelets in 60 Slides September 20, 2008 1 / 62 Outline 1 From Fourier
More informationON THE CONVERGENCE OF THE FOURIER APPROXIMATION FOR EIGENVALUES AND EIGENFUNCTIONS OF DISCONTINUOUS PROBLEMS
SIAM J. UMER. AAL. Vol. 40, o. 6, pp. 54 69 c 003 Society for Industrial and Applied Mathematics O THE COVERGECE OF THE FOURIER APPROXIMATIO FOR EIGEVALUES AD EIGEFUCTIOS OF DISCOTIUOUS PROBLEMS M. S.
More informationChapter 5: Bases in Hilbert Spaces
Orthogonal bases, general theory The Fourier basis in L 2 (T) Applications of Fourier series Chapter 5: Bases in Hilbert Spaces I-Liang Chern Department of Applied Mathematics National Chiao Tung University
More informationMath 5587 Midterm II Solutions
Math 5587 Midterm II Solutions Prof. Jeff Calder November 3, 2016 Name: Instructions: 1. I recommend looking over the problems first and starting with those you feel most comfortable with. 2. Unless otherwise
More informationPartial Differential Equations for Engineering Math 312, Fall 2012
Partial Differential Equations for Engineering Math 312, Fall 2012 Jens Lorenz July 17, 2012 Contents Department of Mathematics and Statistics, UNM, Albuquerque, NM 87131 1 Second Order ODEs with Constant
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More information8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone
Patrice Koehl Department of Biological Sciences National University of Singapore http://www.cs.ucdavis.edu/~koehl/teaching/bl5229 koehl@cs.ucdavis.edu Fourier analysis: the dial tone phone We use Fourier
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationFFT-based Galerkin method for homogenization of periodic media
FFT-based Galerkin method for homogenization of periodic media Jaroslav Vondřejc 1,2 Jan Zeman 2,3 Ivo Marek 2 Nachiketa Mishra 4 1 University of West Bohemia in Pilsen, Faculty of Applied Sciences Czech
More informationLectures notes. Rheology and Fluid Dynamics
ÉC O L E P O L Y T E C H N IQ U E FÉ DÉR A L E D E L A U S A N N E Christophe Ancey Laboratoire hydraulique environnementale (LHE) École Polytechnique Fédérale de Lausanne Écublens CH-05 Lausanne Lectures
More informationAppendix C: Recapitulation of Numerical schemes
Appendix C: Recapitulation of Numerical schemes August 31, 2009) SUMMARY: Certain numerical schemes of general use are regrouped here in order to facilitate implementations of simple models C1 The tridiagonal
More information17 Source Problems for Heat and Wave IB- VPs
17 Source Problems for Heat and Wave IB- VPs We have mostly dealt with homogeneous equations, homogeneous b.c.s in this course so far. Recall that if we have non-homogeneous b.c.s, then we want to first
More informationSeparation of Variables in Linear PDE: One-Dimensional Problems
Separation of Variables in Linear PDE: One-Dimensional Problems Now we apply the theory of Hilbert spaces to linear differential equations with partial derivatives (PDE). We start with a particular example,
More information