Examination paper for Solutions to Matematikk 4M and 4N


 Mercy Preston
 2 years ago
 Views:
Transcription
1 Department of Mathematical Sciences Examination paper for Solutions to Matematikk 4M and 4N Academic contact during examination: Trygve K. Karper Phone: Examination date:. mai 04 Examination time (from to): 5:009:00 Permitted examination support material: Kode C/Basic calculator. Rottmann: Mathematical formulas Other information: All answers must be argued. It should be made clear how the answers are obtained. Language: English Number of pages: 3 Number pages enclosed: 3 Checked by: Date Signature
2
3 Matematikk 4M and 4N  Solutions Page of 3 Problem Consider the following function: f(x) = sin(πx) x +, a) Find a polynomial p(x), of lowest possible degree, that interpolates f at the points (0, f(0)), (0.5, f(0.5)), (, f()). Solution: Three points may be interpolated with a quadratic polynomial p(x). Using Lagrange interpolation p(x) = (x )(x ) (x 0)(x ) x(x ) 0 = 8 x( x). 3 ) π sin( ( ) + b) Use p(x) to estimate the integral I = 0 f(x) dx. Solution: Since p(x) is a good approximation to f(x), we have that I 0 p(x) dx = x( x) dx = = 4 9. c) By using p(x), determine a polynomial q(x) that interpolates f at the point (.5, f(.5)) in addition to the points given in a). Solution: We want to determine the polynomial q(x) using p(x). Hence, we write q(x) as a sum of p(x) and a polynomial which is zero in the points given in a: q(x) = p(x) + x(x )(x ) C, 3 where C is to be determined such that q(.5) = f(.5). Hence, C = f(.5) p(.5) = sin ( ) 3π ( 3 ) = 8 5, and consequently, q(x) = 8 3 x( x) + (x 3 5 x ) (x ).
4 Page of 3 Matematikk 4M and 4N  Solutions Problem The following function x f(x) =, 0 x < π, π π (π x), x π, () π is to be extended to an odd function g defined on R with period π. a) Sketch the graph of g on the interval [ 3π, 3π] and show that g may be written ( ) n 8 g(x) = sin ((n + )x). π (n + ) Solution: The graph of g takes the following form: From the theory developed in the course, we know that g(x) has the Fourierseries representation g(x) = a 0 + a n cos(nx) + b n sin(nx), n= where a 0, {a n } n>, and {b n } n> are determined by the Euler formulas a 0 = π a n = π b n = π π π π π π π g(x) dx, g(x) cos(nx) dx, g(x) sin(nx) dx. Since g(x) and g(x) cos(nx) are odd functions, we know that a 0 = 0 and a n = 0,
5 Matematikk 4M and 4N  Solutions Page 3 of 3 for all n. Moreover, since g(x) sin(nx) is an even function b n = π = π π π π 0 = 4 π π 0 g(x) sin(nx) dx f(x) sin(nx) dx x sin(nx) dx + 4 π (π x) sin(nx) dx π = 4 x cos(nx) x= π π cos(nx) π + dx n x=0 0 n + 4 (π x) cos(nx) x=π π π n x= π π = 4 [ π ( ) π π n cos n + π ( )] π cos n = 8 π n sin (n π We can further write this as ). Hence, b n is totally described by 8, n =, 5, 9,..., π n b n = 0, n =, 4, 6, 8,...,, 8 n = 3, 7,,..., π n π cos(nx) n dx + 8 π n sin (n π b n+ = ( ) n 8 π (n + ), n = 0,,,..., b n = 0, n =,, 3,.... The Fourier series of g(x) is thus given by g(x) = which concludes the answer. ( ) n 8 sin((n + )x), π (n + ) ) b) Using the Fourier series of g, prove that = π 8.
6 Page 4 of 3 Matematikk 4M and 4N  Solutions Solution: By setting x = π in the Fourierseries of g(x), we find that ( ) π ( ) n 8 g = ((n π (n + ) sin + ) π ) ( ) n 8 = (nπ π (n + ) sin + π ) ( ) n 8 8 = π (n + ) ( )n = π (n + ). Since g( π ) =, we see that which is what we were asked to show. (n + ) = π 8, c) An approximation of f using N Fourier components is given by S N (x) = Prove that the L error: satisfies the bound N E = π ( ) n 8 sin ((n + )x). π (n + ) π 0 E < S N (x) f(x) 8 π (N + ). Solution: From Parseval s identity, we have that E = π S N (x) f(x) dx π 0 = π S N (x) g(x) dx π π = = b n n=n n=n ( 64 π 4 < 64 π 4 64 π 4 (n + ) 4 ) (N + ) n=n ( ) (N + ) dx, (n + ) (n + ).
7 Matematikk 4M and 4N  Solutions Page 5 of 3 From the previous exercise, we know the value of the sum on the righthand side and hence we may conclude that E < 64 ( π 4 (N + ) ) π 8 = 8 π (N + ). Problem 3 By using Fourier transform, determine the function u(t, x) that satisfies the following partial differential equation: u t u xx + u = 0, x R, t > 0, u t=0 = u 0, x R, where u 0 (x) is a given function. Solution: Let û(t, ω) denote the Fouriertransform of u(t, x) in x. That is, û(t, ω) = π u(t, x)e ixω dx. By applying Fouriertransform to the partial differential equation and using that û xx = (iω) û = ω û, we obtain the first order separable ordinary differential equation: The solution of this ODE is û t + ω û + û = 0. û(t, ω) = û 0 (ω) e ω t t. From the Formulas given at the end of the exam, we see that ê ax = e ω 4a a With a =, we see that 4t x e 4t = e ω t t
8 Page 6 of 3 Matematikk 4M and 4N  Solutions Hence, we can take the inverse transform to obtain that u(t, x) = u 0 (x) ( ) e x 4t e t, 4πt where we have used that f g = π fĝ, which is also given in the formulas at the end of the exam. Problem 4 Consider the following partial differential equation: u t tu xx = 0, x (0, ), t > 0, u = 0, x = 0 og x =. a) Find all nontrivial solutions of the form u(t, x) = G(t)F (x). Solution: We begin by inserting the assertion u(t, x) = G(t)F (x) in the PDE to obtain that G (t)f (x) tg(t)f (x) = 0. By dividing by tg(t)f (x), we obtain that Hence, we have the following two ODEs: G (t) tg(t) = F (x) F (x) = k constant. G (t) ktg(t) = 0, F (x) kf (x) = 0. The second ODE will have two different types of solutions according to the sign of k. If k > 0, then F will be of the form F (x) = Ae kx + Be kx. However, this cannot satisfy the boundary conditions. That is, F (0) = 0 and F () = 0 can only happen if F (x) 0 when k > 0. Hence, we must have that k < 0. For convenience, let us now write k = λ. Then, the solutions to the above ODEs are G(t) = Ce λ t, F (x) = A cos(λx) + B sin(λx).
9 Matematikk 4M and 4N  Solutions Page 7 of 3 To satisfy boundary conditions, we need that F (0) = 0 and F () = 0. For the first requirement, we see that For the second requirement, we see that F (0) = A A = 0. F () = B sin(λ) λ = nπ. Hence, for any choice of constants C and B and any integer n, we have found that G(t)F (x) = CBe n π t sin(nx), solves the PDE with the given boundary conditions. Hence, all nontrivial solution can be obtained by summing over all possible choices of constants C, B, and frequencies n yielding u(t, x) = B n e (nπ) t sin(nx). (Since C and B only appear as CB this only provides one degree of freedom which we denote by B n ). b) Determine the unique solution u(t, x) satisfying the initial condition: u t=0 = sin(πx) sin(30πx) + 7 sin(πx). Solution: We are now to determine the coefficients B n in u(t, x) to satisfy the given initial value. That is, find B n such that u(0, x) = B n sin(nx) = sin(πx) sin(30πx) + 7 sin(πx). We readily see that, B =, B 30 = 5 3, B = 7, B n = 0, n,, 30. Hence, the solution u(t, x) is given by u(t, x) = e π t sin(πx) + 7 e () π t sin(πx) e (30) π t sin(30πx).
10 Page 8 of 3 Matematikk 4M and 4N  Solutions Problem 5 Formulate Jacobi s method for solving the linear system 3 x 0 3 y = z 0 5 and perform two iterations with starting vector of your own choice. Prove that the iteration will converge. Solution: Jacobi s method for the given linear system is x k+ = 3 6 yk 3 zk, y k+ = 6 xk, z k+ = 5 yk x k. Starting with (x 0, y 0, z 0 ) = (0, 0, 0), we obtain x = 3, y =, z = 0. and x = = 7 y = 6 3 = 7 8 z = 5 3 = 3 30 Next, we turn to the issue of proving convergence of the method. This was by far the most difficult question in the exam and you should not despair if you could not do it. The primary difficulty lies in the matrix not being diagonal dominant. We begin by defining the following matrix A = () 0 5
11 Matematikk 4M and 4N  Solutions Page 9 of 3 and the vectors x k = [ x k, y k, z k] T [ and b =,, 3 0] T. Then, the Jacobi method may be written x k+ = b A x k. Let us then estimate x k+ x k. Using the method, we see that x k+ x k = A ( x k x k ). By iteratively applying the previous identity, we find that x k+ x k = A ( x k x k ) = A ( x k x k ) = ( ) k A k ( x x 0 ). Hence, we have that x k+ x k A k x x 0, k, where A denotes the maximal eigenvalue (in absolute value) of A. As a consequence, we can conclude that the method converges provided the spectral radius A <. The eigenvalues of A is given as the zeros of the polynomial p(λ) = det(a λi) = λ λ Hence, it remains to prove that any λ satisfying p( λ) = 0, also satisfies λ <. By differentiating with respect to λ, we see that p (λ) = 3λ , and hence the local minima and maxima of p(λ) is located at 3 λ = ± 08 <. Moreover, since p (λ) = 6λ, λ = 3 is a local maxima and λ = 08 3 is a 08 local minima. This means that p(λ) is strictly decreasing for λ > 3 and strictly 08 increasing for λ < So are the zeros of p(λ) in absolute value less than? To check this, we first calculate p() = = < 0.
12 Page 0 of 3 Matematikk 4M and 4N  Solutions and p( ) = = > 0. Since p(λ) is strictly decreasing on the interval λ > and p() < 0, all zeros of p(λ) satisfies λ <. On the other hand, we know that p(λ) is strictly increasing as λ becomes more negative than λ =. Since p( ) > 0, this means that there can be no zeros of p(λ) with λ. Hence, all three zeros of p(λ) must be strictly in the interval (, ) which means that all eigenvalues of A have absolute value strictly less than and hence the method converges. Problem 6 In this assignment, we want to determine a numerical approximation to the solution of the following wave equation: u tt u xx = sin(t), x (0, ), t > 0, u(t, 0) = 0, t > 0, u(t, ) = 0, t > 0, u t=0 = 0, x (0, ), u t t=0 =, x (0, ). (3) Formulate a method that provides a numerical approximation to the solution u. What is the order of your method? Solution: We discretize the domain (0, ) into N points with spacing h. That is, through the points x i = ih, i = 0,..., N, h = N. Next, we discretize time through the points t n = n t, n = 0,,, 3,... where t is an undetermined stepsize. Next, we will approximate u(t, x) at these points using the notation u(t n, x i ) u n i, i = 0,..., N, n = 0,,, 3,....
13 Matematikk 4M and 4N  Solutions Page of 3 To approximate the derivatives in the PDE, we shall use the central differences u tt (t n, x i ) un+ i u n i + u n i t, u xx (t n, x i ) un i+ u n i + u n i h. In this way, we obtain the following method to determine the approximation u n i u: of. Set the initial u 0 i and u i as follows: u 0 i = 0, i = 0,..., N, u i = t, i = 0,..., N.. Determine sequentially u n+ i, i = 0,..., N, as follows:  For i =,..., N, u n+ i = u n i u n i + ( t) (u n h i+ u n i + u n i ) + ( t) sin(n t),  At the boundary, set u n+ 0 = 0, u n+ N = 0. This method is secondorder in t and h. Problem 7 Use Laplacetransform to determine the function y(t) satisfying the following ordinary differential equations: a) y y 6y = 0, y(0) = 6, y (0) = 3. Solution: By taking the Laplace transform, we obtain (s s 6)Y (s) = (s )6 + 3 = 6s + 7. A simple division and factorization then provides Y (s) = 6s + 7 (s 3)(s + ) = 5 s 3 + s +.
14 Page of 3 Matematikk 4M and 4N  Solutions Hence, we see that solves the ODE. y(t) = 5e 3t + e t, b) y + 3y 4y = δ(t ), y (0) = y(0) = 0. Solution: By taking the Laplace transform, we obtain Dividing and factorizing provides Y (s) = This, we recognize as the inverse of (s + 3s 4)Y (s) = e s e s (s )(s + 4) = e s 5(s ) e s 5(s + 4). y(t) = 5 where H is the heaviside function. ( e t e 4(t )) H(t ), Problem 8 A signal is stored in the vector y = [y 0, y,..., y N ], where y i are real numbers. ŷ = fft(y) is such that where x k = πk N. y k = N N ŷne inx k, a) The signal represents a sound signal that is T seconds long. What is the frequency of the component described by ŷne inx k N? You do not have to consider aliasing in this task. Solution: The component N ŷne inx k is an interpolant for the function N ŷne inx. This function completes n periods when x goes from 0 to N. Thus, the frequency is f n = n T.
15 Matematikk 4M and 4N  Solutions Page 3 of 3 b) The following matlabfunction takes a vector y and a positive integer k(< N/) as input, and returns a vector ynew. Given that y represents a sound signal that is T seconds long, describe ynew. function ynew = mystery(y,k) N = numel(y); % number of elements in y. z = fft(y); znew = zeros(n,); for i = :k znew(i) = z(i); end znew(n::floor(n/)+) = conj(znew(:ceil(n/))); % ensures that ynew is real ynew = ifft(znew); end Solution: The function computes the Fourier transform z = fft(y). Then it copies the first k components of z to znew, enforces the symmetry and calculates ynew = fft (znew) This corresponds to copying the k lowest frequencies from y to ynew. (This operation is known as a highpass filter.) ynew is a sound signal of the same length as y and consists of the frequency components with f < f k = k T.
16 Matematikk 4M and 4N  Solutions Page i of iii Numerical formulas Let p(x) be a polynomial of degree n interpolating a function f(x) at the points x i [a, b], i = 0,,..., n. For any x [a, b], f(x) p(x) = n (n + )! f (n+) (ξ) (x x i ). i=0 Newton s divided differences interpolation p(x) of degree n: p(x) = f[x 0 ] + (x x 0 )f[x 0, x ] + (x x 0 )(x x )f[x 0, x, x ] + + (x x 0 )(x x )... (x x n )f[x 0,..., x n ] Numerical differentiation: f (x) = [ ] f(x + h) f(x) + h hf (ξ) f (x) = [ ] f(x + h) f(x h) h 6 h f (ξ) f (x) = [ ] f(x + h) f(x) + f(x h) h h f (4) (ξ) Simpson s integration rule: x x 0 f(x) dx h 3 (f 0 + 4f + f ) Iterative techniques for solving linear systems: n a ij x j = b i, i =,,..., n j= Jacobi: x (k+) i = ( b i i a ij x (k) j n a ii j= j=i+ Gauss Seidel: x (k+) i = ( b i i a ij x (k+) j n a ii j= j=i+ Heun s method for solving y = f(t, y) k = hf(t n, y n ) k = hf(t n + h, y n + k ) y n+ = y n + (k + k ) ) a ij x (k) j ) a ij x (k) j
17 Page ii of iii Matematikk 4M and 4N  Solutions Some Laplace transforms f(t) F (s) = L{f(t)} = t t n (n = 0,,,...) s s n! s n+ e at s a cos ωt sin ωt cosh at sinh at e at cos ωt e at sin ωt 0 s s + ω ω s + ω s s a a s a s a (s a) + ω ω (s a) + ω e st f(t) dt Some Fourier transforms
18 Matematikk 4M and 4N  Solutions Page iii of iii f(x) ˆf(w) = F(f) = π g(x) = f(ax) u(x) u(x a) ĝ(w) = a ˆf ( sin aw π w ( ) w a f(x)e iwx dx i cos aw w ( ) u(x)e x π + w i w + w e ax e w 4a a ) e a x π a w + a
Solutions to Linear Algebra Practice Problems
Solutions to Linear Algebra Practice Problems. Find all solutions to the following systems of linear equations. (a) x x + x 5 x x x + x + x 5 (b) x + x + x x + x + x x + x + 8x Answer: (a) We create the
More informationFourier series. Jan Philip Solovej. English summary of notes for Analysis 1. May 8, 2012
Fourier series Jan Philip Solovej English summary of notes for Analysis 1 May 8, 2012 1 JPS, Fourier series 2 Contents 1 Introduction 2 2 Fourier series 3 2.1 Periodic functions, trigonometric polynomials
More informationSolutions to Sample Midterm 2 Math 121, Fall 2004
Solutions to Sample Midterm Math, Fall 4. Use Fourier series to find the solution u(x, y) of the following boundary value problem for Laplace s equation in the semiinfinite strip < x : u x + u
More informationTMA4213/4215 Matematikk 4M/N Vår 2013
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA43/45 Matematikk 4M/N Vår 3 Løsningsforslag Øving a) The Fourier series of the signal is f(x) =.4 cos ( 4 L x) +cos ( 5 L
More informationMATH 461: Fourier Series and Boundary Value Problems
MATH 461: Fourier Series and Boundary Value Problems Chapter III: Fourier Series Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2015 fasshauer@iit.edu MATH 461 Chapter
More informationLecture VI. Review of even and odd functions Definition 1 A function f(x) is called an even function if. f( x) = f(x)
ecture VI Abstract Before learning to solve partial differential equations, it is necessary to know how to approximate arbitrary functions by infinite series, using special families of functions This process
More informationProblems for Quiz 14
Problems for Quiz 14 Math 3. Spring, 7. 1. Consider the initial value problem (IVP defined by the partial differential equation (PDE u t = u xx u x + u, < x < 1, t > (1 with boundary conditions and initial
More information20 Applications of Fourier transform to differential equations
20 Applications of Fourier transform to differential equations Now I did all the preparatory work to be able to apply the Fourier transform to differential equations. The key property that is at use here
More informationTMA4120 Matematikk 4K Eksamen sommer 2016
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA40 Matematikk 4K Eksamen sommer 06 Løsningsforslag We apply the Laplace transform to the differential equation y + y = sint
More informationLecture 11 Fast Fourier Transform (FFT)
Lecture 11 Fast Fourier Transform (FFT) Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationCHAPTER 4. Test Bank Exercises in. Exercise Set 4.1
Test Bank Exercises in CHAPTER 4 Exercise Set 4.1 1. Graph the quadratic function f(x) = x 2 2x 3. Indicate the vertex, axis of symmetry, minimum 2. Graph the quadratic function f(x) = x 2 2x. Indicate
More informationM344  ADVANCED ENGINEERING MATHEMATICS Lecture 9: Orthogonal Functions and Trigonometric Fourier Series
M344  ADVANCED ENGINEERING MATHEMATICS ecture 9: Orthogonal Functions and Trigonometric Fourier Series Before learning to solve partial differential equations, it is necessary to know how to approximate
More informationFourier Series. Chapter Some Properties of Functions Goal Preliminary Remarks
Chapter 3 Fourier Series 3.1 Some Properties of Functions 3.1.1 Goal We review some results about functions which play an important role in the development of the theory of Fourier series. These results
More informationHOMEWORK 4 SOLUTIONS. All questions are from Vector Calculus, by Marsden and Tromba
HOMEWORK SOLUTIONS All questions are from Vector Calculus, by Marsden and Tromba Question :..6 Let w = f(x, y) be a function of two variables, and let x = u + v, y = u v. Show that Solution. By the chain
More informationsince by using a computer we are limited to the use of elementary arithmetic operations
> 4. Interpolation and Approximation Most functions cannot be evaluated exactly: x, e x, ln x, trigonometric functions since by using a computer we are limited to the use of elementary arithmetic operations
More informationSECONDORDER LINEAR HOMOGENEOUS DIFFERENTIAL EQUATIONS
L SECONDORDER LINEAR HOOGENEOUS DIFFERENTIAL EQUATIONS SECONDORDER LINEAR HOOGENEOUS DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS A secondorder linear differential equation is one of the form d
More informationFourier Series, Integrals, and Transforms
Chap. Sec.. Fourier Series, Integrals, and Transforms Fourier Series Content: Fourier series (5) and their coefficients (6) Calculation of Fourier coefficients by integration (Example ) Reason hy (6) gives
More informationChapter 14: Fourier Transforms and Boundary Value Problems in an Unbounded Region
Chapter 14: Fourier Transforms and Boundary Value Problems in an Unbounded Region 王奕翔 Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 25, 213 1 / 27 王奕翔 DE Lecture
More informationIterative Techniques in Matrix Algebra. Jacobi & GaussSeidel Iterative Techniques II
Iterative Techniques in Matrix Algebra Jacobi & GaussSeidel Iterative Techniques II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin
More informationECON Mathematical Economics  ANSWERS FINAL EXAM. 1. (a) The consumer's utility maximization problem is written as:
ECON 331  Mathematical Economics  ANSWERS FINAL EXAM 1. a The consumer's utility maximization problem is written as: max x,y [xy + y2 + 2x + 2y] s.t. 6x + 10y = m, x 0, y 0  The associated Lagrangian
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7 Linear AlgebraLab 2
Linear AlgebraLab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4) 2x + 3y + 6z = 10
More informationFourier Series Representations
Fourier Series Representations Introduction Before we discuss the technical aspects of Fourier series representations, it might be well to discuss the broader question of why they are needed We ll begin
More information1. Periodic Fourier series. The Fourier expansion of a 2πperiodic function f is:
CONVERGENCE OF FOURIER SERIES 1. Periodic Fourier series. The Fourier expansion of a 2πperiodic function f is: with coefficients given by: a n = 1 π f(x) a 0 2 + a n cos(nx) + b n sin(nx), n 1 f(x) cos(nx)dx
More informationMaximum and Minimum Values
Jim Lambers MAT 280 Spring Semester 200910 Lecture 8 Notes These notes correspond to Section 11.7 in Stewart and Section 3.3 in Marsden and Tromba. Maximum and Minimum Values In singlevariable calculus,
More informationFourier Series and SturmLiouville Eigenvalue Problems
Fourier Series and SturmLiouville Eigenvalue Problems 2009 Outline Functions Fourier Series Representation Halfrange Expansion Convergence of Fourier Series Parseval s Theorem and Mean Square Error Complex
More information5 Indefinite integral
5 Indefinite integral The most of the mathematical operations have inverse operations: the inverse operation of addition is subtraction, the inverse operation of multiplication is division, the inverse
More informationMATHEMATICAL METHODS FOURIER SERIES
MATHEMATICAL METHODS FOURIER SERIES I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL METHODS (as
More informationIntroduction to Fourier Series
Introduction to Fourier Series A function f(x) is called periodic with period T if f(x+t)=f(x) for all numbers x. The most familiar examples of periodic functions are the trigonometric functions sin and
More information, < x < Using separation of variables, u(x, t) = Φ(x)h(t) (4) we obtain the differential equations. d 2 Φ = λφ (6) Φ(± ) < (7)
Chapter1: Fourier Transform Solutions of PDEs In this chapter we show how the method of separation of variables may be extended to solve PDEs defined on an infinite or semiinfinite spatial domain. Several
More information1. the function must be periodic; 3. it must have only a finite number of maxima and minima within one periodic;
Fourier Series 1 Dirichlet conditions The particular conditions that a function f(x must fulfil in order that it may be expanded as a Fourier series are known as the Dirichlet conditions, and may be summarized
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationChapter 11 Fourier Analysis
Chapter 11 Fourier Analysis Advanced Engineering Mathematics WeiTa Chu National Chung Cheng University wtchu@cs.ccu.edu.tw 1 2 11.1 Fourier Series Fourier Series Fourier series are infinite series that
More informationIntroduction to Green s Functions: Lecture notes 1
October 18, 26 Introduction to Green s Functions: Lecture notes 1 Edwin Langmann Mathematical Physics, KTH Physics, AlbaNova, SE16 91 Stockholm, Sweden Abstract In the present notes I try to give a better
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationFourier Series. 1. Fullrange Fourier Series. ) + b n sin L. [ a n cos L )
Fourier Series These summary notes should be used in conjunction with, and should not be a replacement for, your lecture notes. You should be familiar with the following definitions. A function f is periodic
More informationFourier Transform and its Applications
Fourier Transform and its Applications Karl Rupp karlirupp@hotmail.com Fourier Transform p.1/22 Content Motivation Fourier series Fourier transform DFT Applications Functional Analysis View Extensions
More informationIntroduction to Fourier Series
Introduction to Fourier Series MA 16021 October 15, 2014 Even and odd functions Definition A function f(x) is said to be even if f( x) = f(x). The function f(x) is said to be odd if f( x) = f(x). Graphically,
More informationInterpolating Polynomials Handout March 7, 2012
Interpolating Polynomials Handout March 7, 212 Again we work over our favorite field F (such as R, Q, C or F p ) We wish to find a polynomial y = f(x) passing through n specified data points (x 1,y 1 ),
More informationAB2.14: Heat Equation: Solution by Fourier Series
AB2.14: Heat Equation: Solution by Fourier Series Consider the boundary value problem for the onedimensional heat equation describing the temperature variation in a bar with the zerotemperature ends:
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More informationProblem 1 (10 pts) Find the radius of convergence and interval of convergence of the series
1 Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series a n n=1 n(x + 2) n 5 n 1. n(x + 2)n Solution: Do the ratio test for the absolute convergence. Let a n =. Then,
More informationAbsolute Maxima and Minima
Absolute Maxima and Minima Definition. A function f is said to have an absolute maximum on an interval I at the point x 0 if it is the largest value of f on that interval; that is if f( x ) f() x for all
More informationIntroduction to SturmLiouville Theory
Introduction to Ryan C. Trinity University Partial Differential Equations April 10, 2012 Inner products with weight functions Suppose that w(x) is a nonnegative function on [a,b]. If f (x) and g(x) are
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationSome Notes on Taylor Polynomials and Taylor Series
Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited
More informationModule 3: SecondOrder Partial Differential Equations
Module 3: SecondOrder Partial Differential Equations In Module 3, we shall discuss some general concepts associated with secondorder linear PDEs. These types of PDEs arise in connection with various
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationCHAPTER III  MARKOV CHAINS
CHAPTER III  MARKOV CHAINS JOSEPH G. CONLON 1. General Theory of Markov Chains We have already discussed the standard random walk on the integers Z. A Markov Chain can be viewed as a generalization of
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationApplications of Fourier series
Chapter Applications of Fourier series One of the applications of Fourier series is the evaluation of certain infinite sums. For example, n= n,, are computed in Chapter (see for example, Remark.4.). n=
More informationFourier Series. A Fourier series is an infinite series of the form. a + b n cos(nωx) +
Fourier Series A Fourier series is an infinite series of the form a b n cos(nωx) c n sin(nωx). Virtually any periodic function that arises in applications can be represented as the sum of a Fourier series.
More informationMA107 Precalculus Algebra Exam 2 Review Solutions
MA107 Precalculus Algebra Exam 2 Review Solutions February 24, 2008 1. The following demand equation models the number of units sold, x, of a product as a function of price, p. x = 4p + 200 a. Please write
More informationArea Between Curves. The idea: the area between curves y = f(x) and y = g(x) (if the graph of f(x) is above that of g(x)) for a x b is given by
MATH 42, Fall 29 Examples from Section, Tue, 27 Oct 29 1 The First Hour Area Between Curves. The idea: the area between curves y = f(x) and y = g(x) (if the graph of f(x) is above that of g(x)) for a x
More informationRecap on Fourier series
Civil Engineering Mathematics Autumn 11 J. Mestel, M. Ottobre, A. Walton Recap on Fourier series A function f(x is called periodic if f(x = f(x + for all x. A continuous periodic function can be represented
More informationTangent and normal lines to conics
4.B. Tangent and normal lines to conics Apollonius work on conics includes a study of tangent and normal lines to these curves. The purpose of this document is to relate his approaches to the modern viewpoints
More informationFrom Fourier Series to Fourier Integral
From Fourier Series to Fourier Integral Fourier series for periodic functions Consider the space of doubly differentiable functions of one variable x defined within the interval x [ L/2, L/2]. In this
More informationSection 4.7. More on Area
Difference Equations to Differential Equations Section 4.7 More on Area In Section 4. we motivated the definition of the definite integral with the idea of finding the area of a region in the plane. However,
More informationMath 150, Fall 2009 Solutions to Practice Final Exam [1] The equation of the tangent line to the curve. cosh y = x + sin y + cos y
Math 150, Fall 2009 Solutions to Practice Final Exam [1] The equation of the tangent line to the curve at the point (0, 0) is cosh y = x + sin y + cos y Answer : y = x Justification: The equation of the
More informationHarvard College. Math 21b: Linear Algebra and Differential Equations Formula and Theorem Review
Harvard College Math 21b: Linear Algebra and Differential Equations Formula and Theorem Review Tommy MacWilliam, 13 tmacwilliam@college.harvard.edu May 5, 2010 1 Contents Table of Contents 4 1 Linear Equations
More informationPURE MATHEMATICS AM 27
AM SYLLABUS (013) PURE MATHEMATICS AM 7 SYLLABUS 1 Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs) 1. AIMS To prepare students for further studies in Mathematics and
More informationQuadratic Polynomials
Math 210 Quadratic Polynomials Jerry L. Kazdan Polynomials in One Variable. After studying linear functions y = ax + b, the next step is to study quadratic polynomials, y = ax 2 + bx + c, whose graphs
More informationPURE MATHEMATICS AM 27
AM Syllabus (015): Pure Mathematics AM SYLLABUS (015) PURE MATHEMATICS AM 7 SYLLABUS 1 AM Syllabus (015): Pure Mathematics Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs)
More informationQuadratic Equations and Inequalities
MA 134 Lecture Notes August 20, 2012 Introduction The purpose of this lecture is to... Introduction The purpose of this lecture is to... Learn about different types of equations Introduction The purpose
More informationCALCULUS 2. 0 Repetition. tutorials 2015/ Find limits of the following sequences or prove that they are divergent.
CALCULUS tutorials 5/6 Repetition. Find limits of the following sequences or prove that they are divergent. a n = n( ) n, a n = n 3 7 n 5 n +, a n = ( n n 4n + 7 ), a n = n3 5n + 3 4n 7 3n, 3 ( ) 3n 6n
More informationNotes from FE Review for mathematics, University of Kentucky
Notes from FE Review for mathematics, University of Kentucky Dr. Alan Demlow March 19, 2012 Introduction These notes are based on reviews for the mathematics portion of the Fundamentals of Engineering
More informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More informationCAN WE INTEGRATE x 2 e x2 /2? 1. THE PROBLEM. xe x2 /2 dx
CAN WE INTEGRATE x 2 e x2 /2? MICHAEL ANSHELEVICH ABSTRACT. Not every nice function has an integral given by a formula. The standard example is e x 2 /2 dx which is not an elementary function. On the other
More informationMATH SOLUTIONS TO PRACTICE FINAL EXAM. (x 2)(x + 2) (x 2)(x 3) = x + 2. x 2 x 2 5x + 6 = = 4.
MATH 55 SOLUTIONS TO PRACTICE FINAL EXAM x 2 4.Compute x 2 x 2 5x + 6. When x 2, So x 2 4 x 2 5x + 6 = (x 2)(x + 2) (x 2)(x 3) = x + 2 x 3. x 2 4 x 2 x 2 5x + 6 = 2 + 2 2 3 = 4. x 2 9 2. Compute x + sin
More informationMath Spring Review Material  Exam 3
Math 85  Spring 01  Review Material  Exam 3 Section 9.  Fourier Series and Convergence State the definition of a Piecewise Continuous function. Answer: f is Piecewise Continuous if the following to
More informationx + 5 x 2 + x 2 dx Answer: ln x ln x 1 + c
. Evaluate the given integral (a) 3xe x2 dx 3 2 e x2 + c (b) 3 x ln xdx 2x 3/2 ln x 4 3 x3/2 + c (c) x + 5 x 2 + x 2 dx ln x + 2 + 2 ln x + c (d) x sin (πx) dx x π cos (πx) + sin (πx) + c π2 (e) 3x ( +
More informationSine and Cosine Series; Odd and Even Functions
Sine and Cosine Series; Odd and Even Functions A sine series on the interval [, ] is a trigonometric series of the form k = 1 b k sin πkx. All of the terms in a series of this type have values vanishing
More informationSection 3.2 Polynomial Functions and Their Graphs
Section 3.2 Polynomial Functions and Their Graphs EXAMPLES: P(x) = 3, Q(x) = 4x 7, R(x) = x 2 +x, S(x) = 2x 3 6x 2 10 QUESTION: Which of the following are polynomial functions? (a) f(x) = x 3 +2x+4 (b)
More informationCHAPTER 2 FOURIER SERIES
CHAPTER 2 FOURIER SERIES PERIODIC FUNCTIONS A function is said to have a period T if for all x,, where T is a positive constant. The least value of T>0 is called the period of. EXAMPLES We know that =
More informationDifferentiation of vectors
Chapter 4 Differentiation of vectors 4.1 Vectorvalued functions In the previous chapters we have considered real functions of several (usually two) variables f : D R, where D is a subset of R n, where
More informationSolving the heat equation, wave equation, Poisson equation using separation of variables and eigenfunctions
Solving the heat equation, wave equation, Poisson equation using separation of variables and eigenfunctions 1 Review: Interval in one space dimension Our domain G = (0,L) is an interval of length L. The
More informationFree Response Questions Compiled by Kaye Autrey for facetoface student instruction in the AP Calculus classroom
Free Response Questions 1969005 Compiled by Kaye Autrey for facetoface student instruction in the AP Calculus classroom 1 AP Calculus FreeResponse Questions 1969 AB 1 Consider the following functions
More informationMarkov Chains, part I
Markov Chains, part I December 8, 2010 1 Introduction A Markov Chain is a sequence of random variables X 0, X 1,, where each X i S, such that P(X i+1 = s i+1 X i = s i, X i 1 = s i 1,, X 0 = s 0 ) = P(X
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationTHE DIFFUSION EQUATION
THE DIFFUSION EQUATION R. E. SHOWALTER 1. Heat Conduction in an Interval We shall describe the diffusion of heat energy through a long thin rod G with uniform cross section S. As before, we identify G
More informationGRA6035 Mathematics. Eivind Eriksen and Trond S. Gustavsen. Department of Economics
GRA635 Mathematics Eivind Eriksen and Trond S. Gustavsen Department of Economics c Eivind Eriksen, Trond S. Gustavsen. Edition. Edition Students enrolled in the course GRA635 Mathematics for the academic
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2016 LECTURE NOTES Series
ANALYTICAL MATHEMATICS FOR APPLICATIONS 206 LECTURE NOTES 8 ISSUED 24 APRIL 206 A series is a formal sum. Series a + a 2 + a 3 + + + where { } is a sequence of real numbers. Here formal means that we don
More informationFourier Transforms The Fourier Transform Properties of the Fourier Transform Some Special Fourier Transform Pairs 27
24 Contents Fourier Transforms 24.1 The Fourier Transform 2 24.2 Properties of the Fourier Transform 14 24.3 Some Special Fourier Transform Pairs 27 Learning outcomes In this Workbook you will learn about
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationFOURIER SERIES, GENERALIZED FUNCTIONS, LAPLACE TRANSFORM. 1. A (generalized) function f(t) of period 2L has a Fourier series of the form
FOURIER SERIES, GENERAIZED FUNCTIONS, APACE TRANSFORM 1 Fourier Series 1.1 General facts 1. A (generalized) function f(t) of period has a Fourier series of the form or f(t) a + a 1 cos πt + a cos πt +
More informationReview for Calculus Rational Functions, Logarithms & Exponentials
Definition and Domain of Rational Functions A rational function is defined as the quotient of two polynomial functions. F(x) = P(x) / Q(x) The domain of F is the set of all real numbers except those for
More informationEngineering Mathematics II
PSUT Engineering Mathematics II Fourier Series and Transforms Dr. Mohammad Sababheh 4/14/2009 11.1 Fourier Series 2 Fourier Series and Transforms Contents 11.1 Fourier Series... 3 Periodic Functions...
More informationFourier Series & Fourier Transforms
Fourier Series & Fourier Transforms nicholas.harrison@imperial.ac.uk 19th October 003 Synopsis ecture 1 : Review of trigonometric identities Fourier Series Analysing the square wave ecture : The Fourier
More informationLecture 3: Fourier Series: pointwise and uniform convergence.
Lecture 3: Fourier Series: pointwise and uniform convergence. 1. Introduction. At the end of the second lecture we saw that we had for each function f L ([, π]) a Fourier series f a + (a k cos kx + b k
More informationUNIT  I LESSON  1 The Solution of Numerical Algebraic and Transcendental Equations
UNIT  I LESSON  1 The Solution of Numerical Algebraic and Transcendental Equations Contents: 1.0 Aims and Objectives 1.1 Introduction 1.2 Bisection Method 1.2.1 Definition 1.2.2 Computation of real root
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More information19.6. Finding a Particular Integral. Introduction. Prerequisites. Learning Outcomes. Learning Style
Finding a Particular Integral 19.6 Introduction We stated in Block 19.5 that the general solution of an inhomogeneous equation is the sum of the complementary function and a particular integral. We have
More informationFourier Series Chapter 3 of Coleman
Fourier Series Chapter 3 of Coleman Dr. Doreen De eon Math 18, Spring 14 1 Introduction Section 3.1 of Coleman The Fourier series takes its name from Joseph Fourier (1768183), who made important contributions
More informationCurve Fitting. Next: Numerical Differentiation and Integration Up: Numerical Analysis for Chemical Previous: Optimization.
Next: Numerical Differentiation and Integration Up: Numerical Analysis for Chemical Previous: Optimization Subsections LeastSquares Regression Linear Regression General Linear LeastSquares Nonlinear
More informationSection 5: Summary. Section 6. General Fourier Series
Section 5: Summary Periodic functions, (so far only with period π, can be represented ug the the Fourier series. We can use symmetry properties of the function to spot that certain Fourier coefficients
More informationFourier Series and Integrals
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) can be
More informationNUMERICAL ANALYSIS PROGRAMS
NUMERICAL ANALYSIS PROGRAMS I. About the Program Disk This disk included with Numerical Analysis, Seventh Edition by Burden and Faires contains a C, FORTRAN, Maple, Mathematica, MATLAB, and Pascal program
More informationModule 43: Vibrations of a Rigid Beam
Module 43: Vibrations of a Rigid Beam David L. Powers in his book, Boundary Value Problems, Third Edition (Published by Harcourt Brace Jovanovich Publishers) gives a problem concerning the vibrations of
More informationA Second Course in Elementary Differential Equations: Problems and Solutions. Marcel B. Finan Arkansas Tech University c All Rights Reserved
A Second Course in Elementary Differential Equations: Problems and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved Contents 8 Calculus of MatrixValued Functions of a Real Variable
More informationModule MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions
Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective
More informationDISTRIBUTIONS AND FOURIER TRANSFORM
DISTRIBUTIONS AND FOURIER TRANSFORM MIKKO SALO Introduction. The theory of distributions, or generalized functions, provides a unified framework for performing standard calculus operations on nonsmooth
More information