Lecture 34. Fourier Transforms
|
|
- Dwain Brown
- 6 years ago
- Views:
Transcription
1 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 entire real line, i.e, f : R R. The Fourier transform involves integrals over such functions. In order for such integrals to be finite, it will be necessary that the functions f(x 0 as x ±. At first, this might seem to be a rather strict condition on f, but when you consider that in practice, all signals have a beginning and an end in other words, they have finite support it is not too strict at all. The relevant section of the AMATH 3 Course Notes is Section 5.4, The Fourier transform and Fourier integral. In this particular course, we shall have covered the following subsections from the Course Notes: Section 5.4.: The definition Section 5.4.: Calculating Fourier transforms using the definition Section 5.4.3: Properties of the Fourier transform Section 5.4.4: Parseval s formula for a non-periodic function Recall from earlier in this course, the idea of extending Fourier series associated with -periodic functions to functions which are τ-periodic, i.e., a function f(t such that f(t + τ = f(t, ( for some τ > 0. This was done rather efficiently by means of the following complex Fourier series, It where f(x = n= ω 0 = τ c n e inω 0x, ( (3
2 is the fundamental frequency. The complex Fourier coefficients, c n, n Z, are given by the formula, and satisfy c n = τ τ/ τ/ f(t e inω 0t dt, (4 c n = c n. (5 The complex-valued basis functions, e n (t = e inω 0t = e int/τ, (6 satisfy the orthogonality condition (complex inner product e n, e m = τ/ τ/ e n (t e m (t dt = τ δ mn. (7 Let us first make the following tiny modification of the above results. We shall let τ = L, (8 so that our functions are now L-periodic and are defined over the primary interval [ L, L]. This means that the following set of complex-valued functions, u n (t = e inπt/l, n {,,, 0,,, } (9 forms an orthogonal basis for the complex-valued space of L-periodic functions L [ L, L]. In the special case L = π, we have the standard Fourier series. The Fourier series expansion of a function f L [ L, L] is given by f(x = a n e inπx/l, (0 n= where the equality is understood in the L sense, i.e., convergence in the norm. The coefficients a n are given by a n = L f(te inπt/l dt. ( L L
3 We mention here that Eq. (0 essentially represents an expansion of the function f(x in terms of its frequency components, with the frequencies given by ω n = nπ L. ( Let us now substitute Eq. ( for the a n into Eq. (0: f(x = ( L f(te nπt/l dt L n= L ( L = L n= f(te n(x tπt/l dt L e inπx/l. (3 The idea is now to take the limit L so that the support, [ L, L], of our functions f, becomes the real line R. From Eq. ( one might think that this implies that all frequencies ω n 0. Letting n at the same time, however, will still produce frequencies of arbitrarily large magnitude. More important, however, is that the spacing between consecutive frequencies will go to zero as L. This spacing is given by ω = ω n+ ω n = π L. (4 From this relation, it follows that the factor /(L in Eq. (3 becomes L = ω Substitution of these expressions into (3 yields f(x = ( L f(te iωn(x t dt ω n= L = F(x, ω n, L ω. (6 n= The sum on the RHS may be interpreted as a Riemann sum involving the function F(x, ω, L = L L (5 f(t e iω(x t dt. (7 The sample points ω n are equally spaced over the entire real line. As such, the Riemann sum approximates the integration of the variable ω on R. In the limit L, ω 0, and we claim that the Riemann sum converges to the integral F(x, ω dω, (8 3
4 where F(x, ω = (Note that x is fixed. Substitution into Eq. (6 yields the following, f(x = = = A few comments regarding this result: F(x, ω dω f(t e iω(x t dt. (9 f(t e iω(x t dt dω ( f(t e iωt dt e iωx dω. (0. The term e iωx looks like a basis element - the summation over the index n, therefore over the discrete frequencies ω n, has been replaced by an integration over ω.. The term in brackets, f(te iωt dt, ( looks like a complex inner product, i.e., f, e iωt, ( which means that it could be interpreted as a a Fourier series coefficient. 3. From these two observations, the RHS has the form of a continuous expansion. The term in brackets, viewed as a Fourier coefficient, is called the Fourier transform of f and denoted as F(ω: We say that F(ω = f(te iωt dt. (3 F(ω is the Fourier transform (FT of f(t, or F = F(f. Eq. (0 may then be written as follows: f(t = F(ωe iωt dω. (4 The above equation defines the inverse Fourier transform (IFT of F(ω, i.e., f = F (F. We mention here that these definitions of the Fourier transform and its inverse are also adopted by the MAPLE and MATLAB programming languages. 4
5 Other definitions of the Fourier transform It turns out that there are a number of other definitions of the Fourier transform and associated inverse. For example, some books (including the book, Applied Partial Differential Equations by R. Haberman, which has been used in the AMATH 353 Course, Partial Differential Equations II, employ e iωt instead of e iωt in Eq. (78 and therefore e iωt instead of e iωt in Eq. (4. There is another definition of the FT in which the factor in Eq. (0 is divided symmetrically between the two integrals, leading to the following definition of the Fourier transform, F(ω = and its associated inverse Fourier transform, f(t = f(te iωt dt, (5 F(ωe iωt dω. (6 This symmetric formulation is adopted in many mathematical treatises. One reason is that in this formulation, the Fourier transform is norm preserving. And to complicate matters even further, it is convenient in the engineering literature not to use the angular frequency ω (radians/unit time, but rather the wavenumber k, the number of cycles per unit time. (For example, we normally think of the range of human hearing to be something like 0-0,000 cycles per second and not its equivalent in radians per second. These two frequencies are related as follows, ω = k, (7 since there are radians/cycle. Using the definition in Eq. (78, the resulting Fourier transform is F(k = f(te ikt dt. (8 From the change of variable ω = k, we have dω = dk, so that the inverse Fourier transform becomes f(t = F(ωe ikt dk. (9 Note that neither the FT nor the inverse FT have any factors in front of the integrals, which is most convenient. 5
6 Here is a summary of the formulas from Fourier series for τ-periodic functions and Fourier transforms of functions on R as employed in this course: τ-periodic functions (ω 0 = /τ square-integrable functions on R c n = τ Fourier coefficients τ/ f(te inω 0t dt F(ω = Fourier transform τ/ f(te iωt dt Fourier series f(t = c n e inω 0t f(t = Fourier integral F(ωe iωt dω. Two noteworthy comments:. In the Fourier series representation for a τ-periodic function f(t on [ τ/, τ/], the coefficient c n characterizes the component of f that oscillates at the frequency ω n = nω 0 = nπ τ. The Fourier series is a summation of these components over discrete frequencies ω n.. In the Fourier transform representation for a function f(t on (,, the coefficient F(ω measures the component of f that oscillates at the frequency ω. The Fourier transform is an integration of components over continuous frequencies ω. We now present a few simple examples to illustrate some basic points. Examples:. The rectangular window function (also known as the boxcar function in signal processing, defined as follows, A plot is given at the left in the figure below., t < W(t =, 0, t >. (30 6
7 We compute the Fourier transform as follows, F(ω = = = / / iω W(te iωt dt e iωt dt [ e iωt ] / / = iω [e iω/ e iω/ ] (3 = [(cos(ω/ i sin(ω/ (cos(ω/ + i sin(ω/] (3 iω = ( i sin(ω/ iω = ω sin(ω/ = sin(ω/ ω/ ( ω = sinc. (33 Here, we have used the mathematical definition of the sinc function, sin x sinc(x =, x 0, x, x = 0. (34 A plot is shown at the right in the figure below x x Left: Plot of the rectangular window function, W(t, Example. Right : Its Fourier transform F(ω. The boxcar function defined above is piecewise constant, with a nonzero constant value over ( /, /. (The constant value of zero outside ( /, / will not contribute to 7
8 F(ω. As such, one would expect that its largest frequency component is at ω = 0. That being said, one would also expect that the discontinuities at x = ±/ will have to be accomodated, accounting for the high-frequency components.. The function cos 3t, π t π, f(t = 0, otherwise. This may be viewed as a clipped audio signal, obtained by multiplying the function cos(3t, t R by a suitably scaled version of the rectangular window function of Example. We begin to compute its Fourier transform as follows, F(ω = = π π f(te iωt dt (35 cos 3t e iωt dt. (36 There are at least two possible paths to take to compute the above integral. We could either (i express the cosine term as a linear combination of complex exponentials or (ii express the complex exponential as a linear combination of cos ωt and sin ωt using Euler s formula. Here, we ll use Method (i: F(ω = π π π [e i3t + e i3t ] e iωt dt = e i(3 ωt + e i(3+ωt dt π = [ i 3 ω ei(3 ωt ] π 3 + ω e i(3+ωt π = [ i 3 ω [ei(3 ωπ e i(3 ωπ ] ] 3 + ω [e i(3+ωπ e i(3+ωπ ] = [ ] (i sin((3 ωπ + (i sin((3 + ωπ i 3 ω 3 + ω = sin((3 ωπ + 3 ω 3 + ω Now simplify the sin functions, sin((3 + ωπ. (37 sin((3 ωπ = sin(3π cos(ωπ cos(3π sin(ωπ = sin(ωπ sin((3 + ωπ = sin(3π cos(ωπ + cos(3π sin(ωπ = sin(ωπ, (38 8
9 so that [ F(ω = 3 ω ] sin(ωπ 3 + ω = ω sin(πω 9 ω. (39 Plots of the clipped audio signal, f(t, and its Fourier transform, F(ω, are shown in the figure below. The largest frequency components of F(ω are at ±3, as expected since the original function has a cos(3t component, at least over a finite time interval. (The fact that F(ω is finite at ω = ±3 is left as an exercise t t Left: Plot of f(t, Example. (The vertical lines at the discontinuities x = ±π are artifacts of the plotting routine. Right : Fourier transform F(ω. 3. The triangular peak function, f(t = π + t, π t π, π t, 0 < t π, 0, otherwise. (40 Its Fourier transform is given by (Exercise F(ω = cos(πω ω. (4 There are some other noteworthy observations to be made regarding the above examples:. The Fourier transform in Examples and decay as F(ω = O(/ω as ω. 9
10 t t Left: Plot of f(t, Example 3. Right : Fourier transform F(ω.. The Fourier transform in Example 3 decays as F(ω = O(/ω as ω. As in the case of Fourier series coefficients which represent a discrete Fourier transform the faster decay rate of Example 3 is due to the higher degree of regularity of the function f(t: it is continuous at all x R, whereas the function in Example is piecewise continuous. Here are some Fourier transforms F(ω of standard functions f(t (taken from Table 5. of AMATH 3 Course Notes. f(t W(t sinc(t F(ω ( ω sinc ( ω πw e t + ω + t πe ω e t / e ω / 0
11 Lecture 35 Fourier transforms (cont d Some properties of Fourier transforms Here we list some of the more important properties of Fourier transforms. In what follows, we assume that the functions f(t and g(t are differentiable as often as necessary, and that all necessary integrals exist. (This implies that f(t 0 as t. Regarding notation: f (n (t denotes the nth derivative of f w.r.t. t; F (n (ω denotes the nth derivative of F w.r.t. ω. The first few properties are those listed in the AMATH 3 Course Notes, pp Linearity of the FT operator and the inverse FT operator: F(f + g = F(f + F(g F(cf = c F(f, c C (or R, (4 F (f + g = F (f + F (g F (cf = c F (f, c C (or R, (43 These properties follow naturally from the integral definition of the FT.. Fourier transform of a scaled function ( Scaling Theorem : For a b 0, Proof: F(f(bt = = b = b F(f(bt = b F ( ω b f(bte iωt dt = b F ( ω b f(se iωs/b ds f(se i( ω bs ds. (44 (s = bt, dt = ds, etc. b. (45
12 The appearance of the absolute value in the denominator arises from the fact that the integration limits are switched in the case that b is negative. Switching them again in order to integrate from to produces a b in this case, which is equivalent to b. We ll examine this result in greater detail below. 3. Fourier transform of a modulation ( Frequency Shift Theorem : F(e iω0t f(t = F(ω ω 0. (46 Proof: F(e iω0t f(t = = e iω 0t f(te iωt dt f(te i(ω ω 0t dt = F(ω ω 0. (47 4. Fourier transform of a translation ( Spatial Shift Theorem : F(f(t a = e iωa F(ω. (48 Proof: F(f(t a = = f(t ae iωt dt f(se iω(s+a ds = e iωa f(se iωs ds (s = t a, dt = ds, etc. = e iωa F(ω. (49 The following properties are not listed in the AMATH 3 Course Notes, but are presented here for completeness. 5. Fourier transform of a product of f with t n : F(t n f(t = i n F (n (ω. (50
13 This is easily seen for the case n = by taking the derivative of F(ω in Eq. (78: F (ω = = = d dω = i f(te iωt dt f(t d dω [ e iωt ] dt (Leibniz Rule f(t( ite iωt dt tf(te iωt dt = if(tf(t. (5 Repeated applications of the differentiation operator produces the result, from which the property follows. 6. Inverse Fourier transform of a product of F with ω n : F (n (ω = F(t n f(t, (5 F (ω n F(ω = ( i n f (n (t. (53 Here, we start with the definition of the inverse FT in Eq. (4 and differentiate both sides repeatedly with respect to t. The reader will note a kind of reciprocity between this result and the previous one. 7. Fourier transform of an nth derivative: This is a consequence of 3. above. 8. Inverse Fourier transform of an nth derivative: This is a consequence of. above. F(f (n (t = (iω n F(ω. (54 F (F (n (ω = ( it n f(t. (55 3
14 Many, if not all, of the above properties are useful for the computation of more complicated Fourier transforms. Indeed, there are often several ways to compute a Fourier transform one method may be much easier than the others. Let us now return to examine a couple of these properties in more detail. Fourier transform of a modulation ( (Frequency Shift Theorem : F(e iω0t f(t = F(ω ω 0. (56 As mentioned in the Course Notes, multiplication of a given signal f(t by the oscillatory complex exponential e iω0t in the time domain produces a shift in the frequency domain. The following may help to understand this result. Suppose that the signal f(t contains the oscillatory frequency ω, which means that it will include the term Ae iωt (57 in its Fourier expansion. This means that the ω-content of f is A. Equivalently, the amplitude A will appear at frequency ω in the Fourier transform F(ω of f(t. This means that the modified signal g(t = e iω 0t (58 will have the modified term, e iω 0t Ae iωt = Ae i(ω+ω 0t, (59 in its Fourier expansion. The amplitude A will now appear at frequency ω + ω 0, which is equivalent to shifting the Fourier transform F(ω to the right by ω 0. There are two interesting consequences of this Shift Theorem. We may be interested in computing the FT of the product of either cosω 0 t or sin ω 0 t with a function f(t. In this case, we express these trigonometric functions in terms of appropriate complex exponentials and then employ the above Shift Theorem. First of all, we start with the relations cosω 0 t = [ e iω 0 t + e ] iω 0t sin ω 0 t = [ e iω 0 t e ] iω 0t. (60 i 4
15 From these results and the Frequency Shift Theorem, we have where F(ω denotes the FT of f(t. F(cosω 0 tf(t = [F(ω ω 0 + F(ω + ω 0 ] F(sin ω 0 tf(t = i [F(ω ω 0 + F(ω + ω 0 ], (6 To show how these results may be helpful in the computation of FTs, let us revisit Example presented in the previous lecture, namely the computation of the FT of the function f(t defined as the function cos 3t, but restricted to the interval [ π, π]. We may view f(t as a product of two functions, i.e., where f(t = cos 3t b(t, (6, t < π, b(t = 0, t > π. The boxcar function b(t is a scaled version of the rectangular window function W(t discussed in the previous Lecture. In fact, b(t = W (63 ( t, (64 As such, we could use the Scaling Theorem (next result to be examined to compute the FT of b(t. But here, we ll simply compute it from the definition: B(ω = From the Frequency Shift Theorem, =. π π W(te iωt dt e iωt dt = sinc(πω. (65 F(ω = F(f(t = [B(ω 3 + B(ω + 3], (66 where B(ω = sinc(πω = sin(πω πω. (67 5
16 is the FT of the boxcar function b(t. Substitution into the preceeding equation yields [ ] sin(π(ω 3 sin(π(ω + 3 F(ω = π ω 3 ω + 3 = ω sin(πω ω 9 = ω sin(πω 9 ω, (68 in agreement with the result obtained for Example earlier. That being said, it is probably easier now to understand the plot of the Fourier transform that was presented with Example. Instead of trying to decipher the structure of the plot of the function sin(πω divided by the polynomial 9 ω, one can more easily visualize a sum of two shifted sinc functions. Fourier transform of a scaled function ( Scaling Theorem : For a b 0, F(f(bt = ( ω b F. (69 b Proof: F(f(bt = = b = b f(bte iωt dt = b F ( ω b f(se iωs/b ds f(se i( ω bs ds (s = bt, dt = ds, etc. b. (70 The appearance of the absolute value in the denominator arises from the fact that the integration limits are switched in the case that b is negative. Switching them again in order to integrate from to produces a b in this case, which is equivalent to b. Let s try to get a picture of this result. Suppose that b >. Then the graph of the function g(t = f(bt is obtained from the graph of f(t by contracting the latter horizontally toward the y-axis by a factor of /b, as sketched in the plots below. On the other hand, the graph G(ω = F ( ω b is obtained from the graph of F(ω by stretching it outward away by a factor of b from the y-axis, as sketched in the next set of plots below. 6
17 y y y = f(t y = f(bt A A t t t t /b t /b t Left: Graph of f(t, with two points t and t, where f(t = A. Right: Graph of f(bt for b >. The two points at which f(t = A have now been contracted toward the origin and are at t /b and t /b, respectively. y y A y = F(ω A y = F(ω/b ω ω ω bω bω ω Left: Graph of Fourier transform F(ω, with two points ω and ω, where F(ω = A. Right: Graph of F(ω/b for b > 0. The two points at which F(ω = A have now been expanded away from the origin and are at bω and bω, respectively. The contraction of the graph of f(t along with an expansion of the graph of F(ω is an example of the complementarity of time (or space and frequency domains. We shall return to this point shortly. As in the case of discrete Fourier series, the magnitude F(ω of the Fourier transform of a function must go to zero as ω. Assume once again that b >. Suppose most of the energy of a Fourier transform F(ω of a function f(t is situated in the interval [ ω 0, ω 0 ]: For ω values outside this interval, F(ω is negligible. But the Fourier transform of the function f(bt is now F(ω/b, which means that it lies in the interval [ bω 0, bω 0 ], which represents an expansion of the interval [ ω 0, ω 0 ]. This implies that the FT of f(bt contains higher frequencies than the FT of f(t. Does this make sense? 7
18 The answer is, Yes, because the compression of the graph of f(t to produce f(bt will produce gradients of higher magnitude the function will have greater rates of decrease or increase. As a result, it must have higher frequencies in its FT representation. (We saw this in the case of Fourier series. Of course, in the case that 0 < b <, the situation is reversed. The graph of f(bt will be a horizontally-stretched version of the graph of f(t, and the corresponding FT, F(ω/b will be a horizontally-contracted version of the graph of F(ω. Let s now go back and compute the FT of the boxcar function b(t from the previous example using the Scaling Formula and our result for the FT of the window function W(t from the previous lecture. Recall that b(t = W Using the Scaling Theorem, with b = /(, we have ( t. (7 ( B(ω = sinc ω = sinc(πω, (7 which is in agreement with our previous calculation. 8
19 Parseval s Formula for a non-periodic function Here we recall the complex-valued Fourier series for a τ-periodic function f(t: where f(t = n= Also recall Parseval s formula associated with this expansion, τ τ/ τ/ c n e inω 0t, (73 ω 0 = τ. (74 f(t dt = n= c n. (75 There exists a Parseval formula between non-periodic functions f(t on R and their Fourier transforms F(ω. It is as follows, Derivation: The Fourier transform of f(t is defined as f(t dt = F(ω dω. (76 F(ω = and the inverse Fourier transform (reconstructing f from F is f(t = f(t e iωt dt (77 F(ω e iωt dω. (78 Multiply both sides of Eq. (78 by f(t and integrate from to : f(t dt = t= ( ω= f(tf(ω e iωt dω dt t= ω= = ω= ( t= F(ω f(t e iωt dt dω (see note below ω= t= = ω= F(ωF(ωdω ω= = F(ω dω. (79 Note: The interchange of order of integration is valid subject to suitable restrictions on f and F (Fubini s Theorem. 9
20 Note that we may express Parseval s formula as follows, f, f = F, F, (80 where, denotes the following complex-valued inner product on R, f, g = f(t g(tdt. (8 (Since f(t is normally assumed to be real-valued, the complex conjugate may be viewed as irrelevant, but the inner product must also apply to the complex-valued Fourier transform F(ω as well. Recalling that Parseval s formula may also be written as Appendix: Plancherel s formula f, f = f = f(t dt, (8 f = F, or f = F. (83 In fact, Parseval s formula may be generalized to the following result, known as Plancherel s formula: Let f and g be defined on R and let their Fourier transforms be denoted as F(ω and G(ω, respectively. Then where, denotes the complex inner product on R, i.e., f, g = F, G, (84 f(tg(t dt = F(ωG(ω dω. (85 In the special case that f = g, implying that F = G, Plancherel s formula reduces to Parseval s formula. Proof of Plancherel s formula Plancherel s formula is proved in much the same way as was Parseval s formula. We first express the function f(t in terms of the inverse Fourier transform, i.e., f(t = F(ωe iωt dω. (86 0
21 Now substitute for F(ω using the definition of the Fourier transform: f(t = Now take the inner product of f(t with g(t: f, g = f(se iωs ds e iωt dω. (87 f(xe iωs ds e iωt dω g(t dt. (88 We now assume that f and g are sufficiently nice so that Fubini s Theorem will allow us to rearrange the order of integration. The result is f, g = = and the theorem is proved. ( f(se iωs ds F(ωG(ω dω, ( g(te iωt dt = F, G, (89 dω
22 The Fourier transform of a Gaussian (in t-space is a Gaussian (in ω-space This is a fundamental result in Fourier analysis as well as a number of applications, including theoretical physics (quantum mechanics. To show it, consider the following function, f σ (t = σ t e σ. (90 You might recognize this function: It is the normalized Gaussian distribution function, or simply the normal distribution with zero-mean and standard deviation σ or variance σ. The factor in front of the integral normalizes it, since f σ (t dt = σ (The above result implies that the L norm of f is, i.e., f =. e t σ dt =. (9 y f(0 = (σ σ σ Sketch of normalized Gaussian function f σ (t = 0 t σ t e σ. Just in case you are not fully comfortable with this result, we mention that all of these results come from the following fundamental integral: e x dx = π. (9 From this result, we find that e Ax dx = π, (93 A by means of the change of variable y = Ax. For simplicity, let us compute the FT of the function g σ (t = e t σ. (94
23 Our desired FT for f σ (t will then be given by Then G σ (ω = = = F σ (ω = σ G σ(ω. (95 e t σ e iωt dt e t σ [cos(ωt i sin(ωt] dt e t σ cos(ωt dt. (96 The sin(ωt term will not contribute to the integration because it is an odd function: Its product with the even Gaussian function is an odd function which, when integrated over (,, yields a zero result. The resulting integral in (96 is not straightforward to evaluate because the antiderivative of the Gaussian does not exist in closed form. But we may perform a trick here. Let us differentiate both sides of the equation with respect to the parameter ω. The differentiation of the integrand is permitted by Leibniz Rule, so that G σ (ω = te t σ sin(ωt dt. The appearance of the t in the integrand now permits an antidifferentiation using integration by parts: Let u = sin(ωt and dv = t exp( t /(σ, so that v = σ exp( t /(σ and du = ω cos(ωt. Then G σ(ω = [ ] sin(ωte t σ σ ω e t σ cos(ωt dt. The first term is zero, because the Gaussian function e t σ 0 as t ±. And the integral on the right, which once again involves the cos(ωt function, along with the / factor, is our original G σ (ω function. Therefore, we have derived the result, G σ(ω = σ ωg σ (ω. (97 This is a first order DE in the function G(ω. It is also a separable DE and may be easily solved to yield the general solution (details left for reader: G σ (ω = De σ ω, (98 3
24 where D is the arbitrary constant. From the fact that G σ (0 = we have that D = σ, implying that e t σ dt = σ, (99 G σ (ω = σe σ ω. (00 From (95, we arrive at our goal, F σ (ω, the Fourier transform of the Gaussian function f σ (t, F σ (ω = e σ ω. (0 In summary, the Fourier transform F σ (ω of the Gaussian function f σ (t is a Gaussian in the variable ω. There is one fundamental difference, however, between the two Gaussians, F σ (ω and f σ (t. The standard deviation of f σ (t is σ. But the standard deviation of F σ (ω, i.e., the value of ω at which F σ (ω assumes the value e / F(0, is σ. In other words, if σ is small, so that the Gaussian f σ (t is a thin peak, then F σ (ω is broad. This relationship, which is a consequence of the complementarity of the time (or space and frequency domains, is sketched below. y y f(0 = (σ σ 0 σ t /σ 0 F σ(0 = ( Generic sketch of normalized Gaussian function f σ (t = σ t e σ, with standard deviation σ (left, and its Fourier transform F σ (ω = e σ ω with standard deviation /σ (right. /σ ω 4
Fourier 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 informationLecture 4: Fourier Transforms.
1 Definition. Lecture 4: Fourier Transforms. We now come to Fourier transforms, which we give in the form of a definition. First we define the spaces L 1 () and L 2 (). Definition 1.1 The space L 1 ()
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 informationf(x) cos dx L L f(x) sin L + b n sin a n cos
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
More information23.6. The Complex Form. Introduction. Prerequisites. Learning Outcomes
he Complex Form 3.6 Introduction In this Section we show how a Fourier series can be expressed more concisely if we introduce the complex number i where i =. By utilising the Euler relation: e iθ cos θ
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 informationTime-Dependent Statistical Mechanics A1. The Fourier transform
Time-Dependent Statistical Mechanics A1. The Fourier transform c Hans C. Andersen November 5, 2009 1 Definition of the Fourier transform and its inverse. Suppose F (t) is some function of time. Then its
More informationFourier Series Example
Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)
More informationnatural frequency of the spring/mass system is ω = k/m, and dividing the equation through by m gives
77 6. More on Fourier series 6.. Harmonic response. One of the main uses of Fourier series is to express periodic system responses to general periodic signals. For example, if we drive an undamped spring
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 information1 From Fourier Series to Fourier transform
Differential Equations 2 Fall 206 The Fourier Transform From Fourier Series to Fourier transform Recall: If fx is defined and piecewise smooth in the interval [, ] then we can write where fx = a n = b
More information3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series
Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2
More informationSeries FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis
Series FOURIER SERIES Graham S McDonald A self-contained Tutorial Module for learning the technique of Fourier series analysis Table of contents Begin Tutorial c 24 g.s.mcdonald@salford.ac.uk 1. Theory
More informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationHeisenberg's inequality for Fourier transform
Heisenberg's inequality for Fourier transform Riccardo Pascuzzo Abstract In this paper, we prove the Heisenberg's inequality using the Fourier transform. Then we show that the equality holds for the Gaussian
More informationFourier Series and Fourier Transforms
Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic
More informationA sufficient condition for the existence of the Fourier transform of f : R C is. f(t) dt <. f(t) = 0 otherwise. dt =
Fourier transform Definition.. Let f : R C. F [ft)] = ˆf : R C defined by The Fourier transform of f is the function F [ft)]ω) = ˆfω) := ft)e iωt dt. The inverse Fourier transform of f is the function
More informationWave Phenomena Physics 15c. Lecture 11 Dispersion
Wave Phenomena Physics 15c Lecture 11 Dispersion What We Did Last Time Defined Fourier transform f (t) = F(ω)e iωt dω F(ω) = 1 2π f(t) and F(w) represent a function in time and frequency domains Analyzed
More informationFourier transforms. R. C. Daileda. Partial Differential Equations April 17, Trinity University
The Fourier Transform R. C. Trinity University Partial Differential Equations April 17, 214 The Fourier series representation For periodic functions Recall: If f is a 2p-periodic (piecewise smooth) function,
More informationFourier series. Complex Fourier series. Positive and negative frequencies. Fourier series demonstration. Notes. Notes. Notes.
Fourier series Fourier series of a periodic function f (t) with period T and corresponding angular frequency ω /T : f (t) a 0 + (a n cos(nωt) + b n sin(nωt)), n1 Fourier series is a linear sum of cosine
More informationPhysics 351 Monday, January 22, 2018
Physics 351 Monday, January 22, 2018 Phys 351 Work on this while you wait for your classmates to arrive: Show that the moment of inertia of a uniform solid sphere rotating about a diameter is I = 2 5 MR2.
More informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More information2.3 Oscillation. The harmonic oscillator equation is the differential equation. d 2 y dt 2 r y (r > 0). Its solutions have the form
2. Oscillation So far, we have used differential equations to describe functions that grow or decay over time. The next most common behavior for a function is to oscillate, meaning that it increases and
More informationThis is the number of cycles per unit time, and its units are, for example,
16 4. Sinusoidal solutions Many things in nature are periodic, even sinusoidal. We will begin by reviewing terms surrounding periodic functions. If an LTI system is fed a periodic input signal, we have
More informatione iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that
Phys 531 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 14, 1/11). I won t reintroduce the concepts though, so you ll want to refer
More information4. Complex Oscillations
4. Complex Oscillations The most common use of complex numbers in physics is for analyzing oscillations and waves. We will illustrate this with a simple but crucially important model, the damped harmonic
More information4. Sinusoidal solutions
16 4. Sinusoidal solutions Many things in nature are periodic, even sinusoidal. We will begin by reviewing terms surrounding periodic functions. If an LTI system is fed a periodic input signal, we have
More informationMath 312 Lecture Notes Linear Two-dimensional Systems of Differential Equations
Math 2 Lecture Notes Linear Two-dimensional Systems of Differential Equations Warren Weckesser Department of Mathematics Colgate University February 2005 In these notes, we consider the linear system of
More informationSprings: Part I Modeling the Action The Mass/Spring System
17 Springs: Part I Second-order differential equations arise in a number of applications We saw one involving a falling object at the beginning of this text (the falling frozen duck example in section
More informationChapter 3. Periodic functions
Chapter 3. Periodic functions Why do lights flicker? For that matter, why do they give off light at all? They are fed by an alternating current which turns into heat because of the electrical resistance
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 informationRelevant sections from AMATH 351 Course Notes (Wainwright): 1.3 Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls): 1.1.
Lecture 8 Qualitative Behaviour of Solutions to ODEs Relevant sections from AMATH 351 Course Notes (Wainwright): 1.3 Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls): 1.1.1 The last few
More informationHow many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation?
How many initial conditions are required to fully determine the general solution to a 2nd order linear differential equation? (A) 0 (B) 1 (C) 2 (D) more than 2 (E) it depends or don t know How many of
More informationEECS 20N: Midterm 2 Solutions
EECS 0N: Midterm Solutions (a) The LTI system is not causal because its impulse response isn t zero for all time less than zero. See Figure. Figure : The system s impulse response in (a). (b) Recall that
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
More informationMath 353 Lecture Notes Week 6 Laplace Transform: Fundamentals
Math 353 Lecture Notes Week 6 Laplace Transform: Fundamentals J. Wong (Fall 217) October 7, 217 What did we cover this week? Introduction to the Laplace transform Basic theory Domain and range of L Key
More informationFourier Series & The Fourier Transform
Fourier Series & The Fourier Transform What is the Fourier Transform? Anharmonic Waves Fourier Cosine Series for even functions Fourier Sine Series for odd functions The continuous limit: the Fourier transform
More informationWave Phenomena Physics 15c. Lecture 10 Fourier Transform
Wave Phenomena Physics 15c Lecture 10 Fourier ransform What We Did Last ime Reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical impedance is defined by For transverse/longitudinal
More informationLecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationWave Phenomena Physics 15c
Wave Phenomena Physics 5c Lecture Fourier Analysis (H&L Sections 3. 4) (Georgi Chapter ) What We Did Last ime Studied reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical
More information3 + 4i 2 + 3i. 3 4i Fig 1b
The introduction of complex numbers in the 16th century was a natural step in a sequence of extensions of the positive integers, starting with the introduction of negative numbers (to solve equations of
More informationλ n = L φ n = π L eınπx/l, for n Z
Chapter 32 The Fourier Transform 32. Derivation from a Fourier Series Consider the eigenvalue problem y + λy =, y( L = y(l, y ( L = y (L. The eigenvalues and eigenfunctions are ( nπ λ n = L 2 for n Z +
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 informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More informationThe Harmonic Oscillator
The Harmonic Oscillator Math 4: Ordinary Differential Equations Chris Meyer May 3, 008 Introduction The harmonic oscillator is a common model used in physics because of the wide range of problems it can
More informationOutline. Math Partial Differential Equations. Fourier Transforms for PDEs. Joseph M. Mahaffy,
Outline Math 53 - Partial Differential Equations s for PDEs Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationc2 2 x2. (1) t = c2 2 u, (2) 2 = 2 x x 2, (3)
ecture 13 The wave equation - final comments Sections 4.2-4.6 of text by Haberman u(x,t), In the previous lecture, we studied the so-called wave equation in one-dimension, i.e., for a function It was derived
More informationa 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)
Note Fourier. 30 January 2007 (as 23.II..tex) and 20 October 2009 in this form. Fourier Analysis The Fourier series First some terminology: a function f(t) is periodic if f(t + ) = f(t) for all t for some,
More informationLinearization of Differential Equation Models
Linearization of Differential Equation Models 1 Motivation We cannot solve most nonlinear models, so we often instead try to get an overall feel for the way the model behaves: we sometimes talk about looking
More informationNotes on the Periodically Forced Harmonic Oscillator
Notes on the Periodically orced Harmonic Oscillator Warren Weckesser Math 38 - Differential Equations 1 The Periodically orced Harmonic Oscillator. By periodically forced harmonic oscillator, we mean the
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 informatione iωt dt and explained why δ(ω) = 0 for ω 0 but δ(0) =. A crucial property of the delta function, however, is that
Phys 53 Fourier Transforms In this handout, I will go through the derivations of some of the results I gave in class (Lecture 4, /). I won t reintroduce the concepts though, so if you haven t seen the
More information1. Fourier Transform (Continuous time) A finite energy signal is a signal f(t) for which. f(t) 2 dt < Scalar product: f(t)g(t)dt
1. Fourier Transform (Continuous time) 1.1. Signals with finite energy A finite energy signal is a signal f(t) for which Scalar product: f(t) 2 dt < f(t), g(t) = 1 2π f(t)g(t)dt The Hilbert space of all
More information2.2 The derivative as a Function
2.2 The derivative as a Function Recall: The derivative of a function f at a fixed number a: f a f a+h f(a) = lim h 0 h Definition (Derivative of f) For any number x, the derivative of f is f x f x+h f(x)
More informationE2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)
E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,
More informationMATH 135: COMPLEX NUMBERS
MATH 135: COMPLEX NUMBERS (WINTER, 010) The complex numbers C are important in just about every branch of mathematics. These notes 1 present some basic facts about them. 1. The Complex Plane A complex
More informationDamped harmonic motion
Damped harmonic motion March 3, 016 Harmonic motion is studied in the presence of a damping force proportional to the velocity. The complex method is introduced, and the different cases of under-damping,
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 informationDiscrete Fourier Transform
Last lecture I introduced the idea that any function defined on x 0,..., N 1 could be written a sum of sines and cosines. There are two different reasons why this is useful. The first is a general one,
More informationLecture 1 January 5, 2016
MATH 262/CME 372: Applied Fourier Analysis and Winter 26 Elements of Modern Signal Processing Lecture January 5, 26 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long; Edited by E. Candes & E. Bates Outline
More informationa k cos kω 0 t + b k sin kω 0 t (1) k=1
MOAC worksheet Fourier series, Fourier transform, & Sampling Working through the following exercises you will glean a quick overview/review of a few essential ideas that you will need in the moac course.
More informationTopic Subtopics Essential Knowledge (EK)
Unit/ Unit 1 Limits [BEAN] 1.1 Limits Graphically Define a limit (y value a function approaches) One sided limits. Easy if it s continuous. Tricky if there s a discontinuity. EK 1.1A1: Given a function,
More informationMATH 4330/5330, Fourier Analysis Section 8, The Fourier Transform on the Line
MATH 4330/5330, Fourier Analysis Section 8, The Fourier Transform on the Line What makes the Fourier transform on the circle work? What is it about the functions φ n (x) e 2πinx that underlies their importance
More informationUNIVERSITY OF SOUTHAMPTON. A foreign language dictionary (paper version) is permitted provided it contains no notes, additions or annotations.
UNIVERSITY OF SOUTHAMPTON MATH055W SEMESTER EXAMINATION 03/4 MATHEMATICS FOR ELECTRONIC & ELECTRICAL ENGINEERING Duration: 0 min Solutions Only University approved calculators may be used. A foreign language
More information2 Fourier Transforms and Sampling
2 Fourier ransforms and Sampling 2.1 he Fourier ransform he Fourier ransform is an integral operator that transforms a continuous function into a continuous function H(ω) =F t ω [h(t)] := h(t)e iωt dt
More informationEE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions
EE 6 The Fourier Transform and its Applications Fall 006 Midterm Exam Solutions There are six questions for a total of 00 points. Please write your answers in the exam booklet provided, and make sure that
More information, a x a 0, otherwise, F a (ω) = 1
Lecture 21 The Uncertainty Principle Recall, from a couple of lectures ago, that the Fourier transform of a Gaussian function (in t-space) is a Gaussian function (in ω-space). The particular Fourier pair
More informationMAE 200B Homework #3 Solutions University of California, Irvine Winter 2005
Problem 1 (Haberman 5.3.2): Consider this equation: MAE 200B Homework #3 Solutions University of California, Irvine Winter 2005 a) ρ 2 u t = T 2 u u 2 0 + αu + β x2 t The term αu describes a force that
More information= k, (2) p = h λ. x o = f1/2 o a. +vt (4)
Traveling Functions, Traveling Waves, and the Uncertainty Principle R.M. Suter Department of Physics, Carnegie Mellon University Experimental observations have indicated that all quanta have a wave-like
More information7.1. Calculus of inverse functions. Text Section 7.1 Exercise:
Contents 7. Inverse functions 1 7.1. Calculus of inverse functions 2 7.2. Derivatives of exponential function 4 7.3. Logarithmic function 6 7.4. Derivatives of logarithmic functions 7 7.5. Exponential
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 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 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 informationCMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is
More informationDamped Oscillation Solution
Lecture 19 (Chapter 7): Energy Damping, s 1 OverDamped Oscillation Solution Damped Oscillation Solution The last case has β 2 ω 2 0 > 0. In this case we define another real frequency ω 2 = β 2 ω 2 0. In
More informationChapter 2: Complex numbers
Chapter 2: Complex numbers Complex numbers are commonplace in physics and engineering. In particular, complex numbers enable us to simplify equations and/or more easily find solutions to equations. We
More informationRelevant sections from AMATH 351 Course Notes (Wainwright): Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls):
Lecture 5 Series solutions to DEs Relevant sections from AMATH 35 Course Notes (Wainwright):.4. Relevant sections from AMATH 35 Course Notes (Poulin and Ingalls): 2.-2.3 As mentioned earlier in this course,
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter VIII: The Fast Fourier Transform Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2008 Outline 1 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 informationSignal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5
Signal and systems p. 1/5 Signal and systems Linear Systems Luigi Palopoli palopoli@dit.unitn.it Wrap-Up Signal and systems p. 2/5 Signal and systems p. 3/5 Fourier Series We have see that is a signal
More information1 Introduction. or equivalently f(z) =
Introduction In this unit on elliptic functions, we ll see how two very natural lines of questions interact. The first, as we have met several times in Berndt s book, involves elliptic integrals. In particular,
More informationCopyright (c) 2006 Warren Weckesser
2.2. PLANAR LINEAR SYSTEMS 3 2.2. Planar Linear Systems We consider the linear system of two first order differential equations or equivalently, = ax + by (2.7) dy = cx + dy [ d x x = A x, where x =, and
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 2: Fourier Series S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 1 Fourier Series Revision of Basics
More information93 Analytical solution of differential equations
1 93 Analytical solution of differential equations 1. Nonlinear differential equation The only kind of nonlinear differential equations that we solve analytically is the so-called separable differential
More informationReview of Linear System Theory
Review of Linear System Theory The following is a (very) brief review of linear system theory and Fourier analysis. I work primarily with discrete signals. I assume the reader is familiar with linear algebra
More informationFourier Analysis Fourier Series C H A P T E R 1 1
C H A P T E R Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4, more general orthonormal series called Sturm iouville epansions in Secs..5 and.6
More informationAPPM 2360: Midterm 3 July 12, 2013.
APPM 2360: Midterm 3 July 12, 2013. ON THE FRONT OF YOUR BLUEBOOK write: (1) your name, (2) your instructor s name, (3) your recitation section number and (4) a grading table. Text books, class notes,
More informationReview of Linear Time-Invariant Network Analysis
D1 APPENDIX D Review of Linear Time-Invariant Network Analysis Consider a network with input x(t) and output y(t) as shown in Figure D-1. If an input x 1 (t) produces an output y 1 (t), and an input x
More informationCHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L
CHAPTER 4 FOURIER SERIES 1 S A B A R I N A I S M A I L Outline Introduction of the Fourier series. The properties of the Fourier series. Symmetry consideration Application of the Fourier series to circuit
More informationChapter 2: Functions, Limits and Continuity
Chapter 2: Functions, Limits and Continuity Functions Limits Continuity Chapter 2: Functions, Limits and Continuity 1 Functions Functions are the major tools for describing the real world in mathematical
More informationProblem Sheet 1 Examples of Random Processes
RANDOM'PROCESSES'AND'TIME'SERIES'ANALYSIS.'PART'II:'RANDOM'PROCESSES' '''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''Problem'Sheets' Problem Sheet 1 Examples of Random Processes 1. Give
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 informationMath 2025, Quiz #2. Name: 1) Find the average value of the numbers 1, 3, 1, 2. Answere:
Math 5, Quiz # Name: ) Find the average value of the numbers, 3,,. Answere: ) Find the Haar wavelet transform of the initial data s (3,,, 6). Answere: 3) Assume that the Haar wavelet transform of the initial
More informationMath53: Ordinary Differential Equations Autumn 2004
Math53: Ordinary Differential Equations Autumn 2004 Unit 2 Summary Second- and Higher-Order Ordinary Differential Equations Extremely Important: Euler s formula Very Important: finding solutions to linear
More informationMATH 251 Week 6 Not collected, however you are encouraged to approach all problems to prepare for exam
MATH 51 Week 6 Not collected, however you are encouraged to approach all problems to prepare for exam A collection of previous exams could be found at the coordinator s web: http://www.math.psu.edu/tseng/class/m51samples.html
More informationResonance and response
Chapter 2 Resonance and response Last updated September 20, 2008 In this section of the course we begin with a very simple system a mass hanging from a spring and see how some remarkable ideas emerge.
More informationMath 216 Second Midterm 19 March, 2018
Math 26 Second Midterm 9 March, 28 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that
More informationCHEE 319 Tutorial 3 Solutions. 1. Using partial fraction expansions, find the causal function f whose Laplace transform. F (s) F (s) = C 1 s + C 2
CHEE 39 Tutorial 3 Solutions. Using partial fraction expansions, find the causal function f whose Laplace transform is given by: F (s) 0 f(t)e st dt (.) F (s) = s(s+) ; Solution: Note that the polynomial
More informationLinear and Nonlinear Oscillators (Lecture 2)
Linear and Nonlinear Oscillators (Lecture 2) January 25, 2016 7/441 Lecture outline A simple model of a linear oscillator lies in the foundation of many physical phenomena in accelerator dynamics. A typical
More informationFourier transforms. Definition F(ω) = - should know these! f(t).e -jωt.dt. ω = 2πf. other definitions exist. f(t) = - F(ω).e jωt.
Fourier transforms This is intended to be a practical exposition, not fully mathematically rigorous ref The Fourier Transform and its Applications R. Bracewell (McGraw Hill) Definition F(ω) = - f(t).e
More information