Problem 1. Possible Solution. Let f be the 2π-periodic functions defined by f(x) = cos ( )
|
|
- Abraham Bradford
- 5 years ago
- Views:
Transcription
1 Problem Let f be the π-periodic functions defined by f() = cos ( ) hen [ π, π]. Make a draing of the function f for the interval [ 3π, 3π], and compute the Fourier series of f. Use the result to compute the value of the series n= ( ) n n. First observe that f( ) = cos ( ) ( ) = cos, so f() is an even function. Then the Fourier series of the function f() is of the form Then and π a 0 = π = π π π 0 a 0 + a n cos(n). n= π f() d = f() d π π 0 ( ) cos d = sin ( ) π π a n = f() cos(n) d = f() cos(n) d π π π 0 = π ( ) cos cos(n) d = π ( ( n + cos π 0 π 0 = π ( ) ( ) n + n cos + cos d π 0 = ( ( ) n + π n + sin + ( n n sin = ( ( ) n + π n + sin π + ( n n sin = ( π n + ( )n + ) ( n ( )n+ = ( )n π ( ) ( ) = ( )n = ( )n. π n π n Thus, the Fourier series to f() is =π =0 π + ( ) n n= π n cos(n). = π, ) + cos )] =π =0 ) π 0 0 ( n ) n + n ) )) d
2 Finally to find the value of the series, e evaluate the Fourier series of f() at = 0, and by the Fourier Theorem and since f() is continuous at = 0 e have that ( 0 = cos = f(0) = ) π + ( ) n n= π n cos(0) = π + π hence Problem n= ( ) n n = π ( ) = π. π Find all the non-trivial solutions of the heat equation n= u t = u here 0 π and t 0, ( ) n n, that are of the form u(, t) = F () G(t), and that satisfy the boundary conditions u(0, t) = 0 and u (π, t) = 0 for every t 0. Use this to find a solution satisfying the initial condition ( ) u(, 0) = cos() sin for every 0 π. If u(, t) = F ()G(t) e have that u = F G and u t = F G. Then if e replace this into the heat equation e have that F G = F G, so it follos that F F = G G = K here K R. From this e deduce the to folloing ODEs F KF = 0 and G KG = 0. Additionally, observe that from the boundary conditions it follos that u(0, t) = F (0)G(t) = 0 implies F (0) = 0,
3 u (π, t) = F (π)g(t) = 0 implies F (π) = 0. First e solve the ODE F KF = 0. Suppose that K = 0, then F = 0, from here e have that F () = A + B. But 0 = F (0) = A 0 + B = B and 0 = F (π) = A, thus F = 0. This gives us a trivial solution. No suppose that K > 0. Then the solution of F KF = 0 is of the form F () = A cosh( K) + B sinh( K). But 0 = F (0) = A cosh(0)+b sinh(0) = A and 0 = F (π) = B K cosh(0) = B K = 0, thus F = 0. This gives us also a trivial solution. Finally suppose that K < 0. We rite K = p here p > 0. Then the ODE F + p F = 0 has solution F () = A cos(p) + B sin(p). But 0 = F (0) = A cos 0 + B sin 0 = A and 0 = F (π) = Bp cos(pπ). But this means that pπ = n+ π for n Z, from here it follos that p = n + Then e define the functions ( ) n + F n () = sin ith n Z. for n Z. Observe that since sin is an odd function for every n N e have that ( ) n + F n () = sin = sin ( n ) = F n (). So the negative n s do not give us any ne solutions. Then it is enough to use the functions ( ) n + F n () = sin for n = 0,,,... No e are going to solve the ODE G KG = 0, but since K = p = ( n+ ) for n = 0,,,..., e can rite the ODE ( ) n + G + G = 0, 3
4 n+ that has solution G n (t) = e ( ) t for n = 0,,,.... Then our desired solutions are ( ) n + n+ u n (, t) = F n ()G n (t) = sin e ( ) t for n = 0,,,... No e ant to find a linear combination u(, t) = n=0 B n u n (, t) such that u(, 0) = B n u n (, 0) = B n F n ()G n (0) n=0 n=0 ( ) ( ) n + = B n sin = cos() sin. n=0 But cos() sin ( ) = sin ( 3 ) + sin ( 5 ), so it follos that B = and B = and the rest of B n s are zero. Therefore our desired solution is Problem 3 u(, t) = sin ( 3 ) e ( 3 ) t + sin ( 5 ) e ( 5 ) t. Sho the Fourier transform F( e ) = i π We have that F(e ) = π = π 0 sin ( + ) d. e e i d = π 0 e ( i) d + e ( i) d π = π ( e ( i) ( i) e( i) ( i) = π = π 0 ] =0 =. Use this to compute (+ ) e e i d + e e i d π + ( ] e ( i) = π ( i) e( i) ( i) =0 ( i) + π ( + i) = ( + i) + ( i) π ( + i) ( i) i i (( + i)( i)) = π ( + ), 0
5 as desired. For the last part, e use the inverse of the Fourier transform, that is, e = π i π ( + ) ei d = π No if e set = e have that e = i π ( + ) ei d = π = i π ( + ) cos d + π But then observe that cos d = 0 because (+ ) odd function, so it follos that hence Problem e = π i ( + ) ei d. i (cos + i sin ) d ( + ) sin d ( + ) sin d ( + ) π e = sin d. ( + ) cos is an (+ ) Perfom 3 iterations of the Neton method to find the root of the function f() = e ith 0 = 0. (Use only decimals in your computations). Observe that f () = + e, then Netons metode is the iteration given by Then e have that Problem 5 n+ = n f( n) f ( n ) = n n e n + e n = ne n + e n + e n. 0 = 0, = 0.5, = , 3 = Use the Laplace transform to solve the differential equation ith initial conditions y 3y + y = e 3t, y(0) = 0 and y (0) =. 5
6 We use the Laplace transform in the ODE, and denoting Y the Laplace transform of y, e have that so e have that and and Y = s Y sy(0) y (0) 3(sY y(0)) + Y = s 3, s Y 3sY + Y = s 3, Y (s 3s + ) = s 0 + = s 3 s 3, s 0 (s 3)(s 3s + ) = s 0 (s 3)(s )(s ) = s 3 + s 3 s. So then applying the inverse of the Laplace transform e get y(t) = e 3t + e t 3e t. Problem 6 Find the polynomial of smallest degree that interpolates the points of the function f() i f( i ) 5 Use this polynomial to estimate f(3). Using Neton interpolation, e obtain /3 - / Lagrange interpolation ould be fine as ell 6
7 Then the polynomial is of the form p() = ( )( + )( + ) ( + )( + ) + ( + )( + ) + ( + ) + 3 Then the estimate of f(3) can be done ith p(3) = 6. Problem 7 We ant to numerically evaluate the integral f() d here f() = sin( ), 0 ith the Simpson method such that the approimation error is smaller than What is the largest value of the step size h that this accuracy is guaranteed? Use this h to compute a numerical approimation of the above integral by the Simpson method. (Use only decimals in your computations). (Hint: You can use that ma 0 f () () 30). We use the error estimation for the Simpsons methode, that says that ɛ h b a 80 ma f () () h 0 h 30 = a b Since e ant that ɛ < 0.00 e may choose h such that h < 0.00, so 6 h < Then if e ant to use Simpsons method ith this accuracy e need to pick n such that < So observe that ith n =, e have n that / = 0.5 < Then e compute S = Problem 8 ( sin(0) + sin((0.5) ) + sin((0.5) ) + sin((0.75) ) + sin(() ) ) = Let y() be the function that solves the ODE y = y and y(0) =. Use the Euler method ith h = 0. to approimate the values of y() at the points = 0., = 0. and 3 = 0.3. (Use only decimals in your computations) 7
8 We have the ODE y = f(, y) =. Then the Euler method iteration says y y n+ = y n + hf( n, y n ). Then if e start ith 0 = 0 and y 0 = and ith h = 0., e have that y =, y = 0.99, y 3 = Problem 9 Write the linear system 0 + y z = 8 + y + 0z = 7 + 5y + z = in such a form that you can apply the Gauss-Seidel method and it converges. Then perform 3 iterations ith starting values 0 = y 0 = z 0 = 0. (Use only decimals in your computations). First e can rearrange the linear system in the folloing ay Then e can apply Gauss-Seidel to 0 0 A = = + 0 y 0 z = y + 5 z = y + z = = L+I+U Observe that the method ill converge because A is diagonal dominant. 8
9 We have then the folloing iteration equations (n+) = y(n) + 0 z(n) y (n+) = 5 5 (n+) 5 z(n) z (n+) = (n+) 0 y(n+) Then if ( (0), y (0), z (0) ) = (0, 0, 0) e have that Problem 0 ( (), y (), z () ) = (.8, 0.9, 0.986) ( (), y (), z () ) = (.9906, 0.998, ) ( (3), y (3), z (3) ) = (,, ). Let R be the region defined by the lines L : y = L : y = 0 L 3 : = 0. Let u(, y) be the function defined in R that satisfies the Poisson equation and boundary conditions u + u y = y u(, y) = if (, y) L u(, y) = if (, y) L u(, y) = y if (, y) L 3 y u = y R u = u = 9
10 Let us define the points ( i, y j ) = (i h, j h) ith h =. Use the method of difference equations ith h = in order to set up a linear system for finding approimations of the values u(, ), u(, ) and u(, ). If e define u i,j := u(ih, jh), the difference method gives us the folloing equation h (u i+,j + u i,j + u i,j+ + u i,j u i,j ) = (ih jh) So if h = e have the folloing equations u, + u 0, + u, + u,0 u, = ( ) = u 3, + u, + u, + u,0 u, = ( ) = u, + u 0, + u,3 + u, u, = ( ) = and using the boundary conditions u, + + u, + u, = + u, + + u, = u, u, = Hence the the desired linear system is u, + u, u, = 0 u, u, = 6 u, u, = 6 0
1 x if 0 < x < 2, 1 x if 2 < x < 0.
Problem The function f(x) = x, defined on the interval [0, 2], is to be extended to an odd function g with period 4. Sketch the graph of the function g on the interval [ 4, 4] and find the Fourier series
More informationExamination paper for TMA4130 Matematikk 4N: SOLUTION
Department of Mathematical Sciences Examination paper for TMA4 Matematikk 4N: SOLUTION Academic contact during examination: Morten Nome Phone: 9 84 97 8 Examination date: December 7 Examination time (from
More informationHomework 6 Solutions
Homeork 6 Solutions Igor Yanovsky (Math 151B TA) Section 114, Problem 1: For the boundary-value problem y (y ) y + log x, 1 x, y(1) 0, y() log, (1) rite the nonlinear system and formulas for Neton s method
More informationSuggested solutions, TMA4125 Calculus 4N
Suggested solutions, TMA5 Calculus N Charles Curry May 9th 07. The graph of g(x) is displayed below. We have b n = = = 0 [ nπ = nπ ( x) nπx dx nπx dx cos nπx ] x nπx dx [ nπx x cos nπ ] ( cos nπ + cos
More informationNUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
More informationExamination paper for TMA4130 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA4130 Matematikk 4N Academic contact during examination: Morten Nome Phone: 90 84 97 83 Examination date: 13 December 2017 Examination time (from
More informationExamination paper for TMA4125 Matematikk 4N
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 4N Academic contact during examination: Anne Kværnø a, Louis-Philippe Thibault b Phone: a 9 66 38 4, b 9 3 0 95 Examination date:
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More information13.3 Analytic functions (Analytiske funksjoner)
13.3 Analytic functions (Analytiske funksjoner) Eugenia Malinnikova, NTNU October 3, 2017 1 This course so far: Laplace transform: solutions of ODE, integral equations, systems of ODE Periodic functions
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationBACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES
No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK
KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS
More informationA turbulence closure based on the maximum entropy method
Advances in Fluid Mechanics IX 547 A turbulence closure based on the maximum entropy method R. W. Derksen Department of Mechanical and Manufacturing Engineering University of Manitoba Winnipeg Canada Abstract
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationA Simple Derivation of Newton-Cotes Formulas with Realistic Errors
Journal of Mathematics Research; Vol. 4, No. 5; 01 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education A Simple Derivation of Neton-Cotes Formulas ith Realistic Errors
More informationThese notes give a quick summary of the part of the theory of autonomous ordinary differential equations relevant to modeling zombie epidemics.
NOTES ON AUTONOMOUS ORDINARY DIFFERENTIAL EQUATIONS MARCH 2017 These notes give a quick summary of the part of the theory of autonomous ordinary differential equations relevant to modeling zombie epidemics.
More informationSTATISTICS AND NUMERICAL METHODS
STATISTICS AND NUMERICAL METHODS Question IV November / December 2011 Part-A 1. The heights of college students in Chennai are normally distributed with standard deviation 6 cm and sample of 100 students
More information3 - Vector Spaces Definition vector space linear space u, v,
3 - Vector Spaces Vectors in R and R 3 are essentially matrices. They can be vieed either as column vectors (matrices of size and 3, respectively) or ro vectors ( and 3 matrices). The addition and scalar
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationInterpolation and the Lagrange Polynomial
Interpolation and the Lagrange Polynomial MATH 375 J. Robert Buchanan Department of Mathematics Fall 2013 Introduction We often choose polynomials to approximate other classes of functions. Theorem (Weierstrass
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationPHYS 301 HOMEWORK #4
PHYS HOMEWORK #4 Due : February 7 Do all integrals by hand; you may check your answers via Mathematica but must show all work.. Show for m, n integers :, m n sin (m x) sin (n x) dx = -, m = n - sin (n
More informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationUnit I (Testing of Hypothesis)
SUBJECT NAME : Statistics and Numerical Methods SUBJECT CODE : MA645 MATERIAL NAME : Part A questions REGULATION : R03 UPDATED ON : November 07 (Upto N/D 07 Q.P) Unit I (Testing of Hypothesis). State level
More informationNumerical Analysis & Computer Programming
++++++++++ Numerical Analysis & Computer Programming Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6
More informationComplex Numbers and the Complex Exponential
Complex Numbers and the Complex Exponential φ (2+i) i 2 θ φ 2+i θ 1 2 1. Complex numbers The equation x 2 + 1 0 has no solutions, because for any real number x the square x 2 is nonnegative, and so x 2
More informationBivariate Uniqueness in the Logistic Recursive Distributional Equation
Bivariate Uniqueness in the Logistic Recursive Distributional Equation Antar Bandyopadhyay Technical Report # 629 University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860
More informationLecture 8 January 30, 2014
MTH 995-3: Intro to CS and Big Data Spring 14 Inst. Mark Ien Lecture 8 January 3, 14 Scribe: Kishavan Bhola 1 Overvie In this lecture, e begin a probablistic method for approximating the Nearest Neighbor
More informationNumerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error. 2- Fixed point
Numerical Analysis Solution of Algebraic Equation (non-linear equation) 1- Trial and Error In this method we assume initial value of x, and substitute in the equation. Then modify x and continue till we
More informationExamination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N
Department of Mathematical Sciences Examination paper for TMA4122/TMA4123/TMA4125/TMA4130 Matematikk 4M/N Academic contact during examination: Markus Grasmair Phone: 97 58 04 35 Code C): Basic calculator.
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationy(x) = x w + ε(x), (1)
Linear regression We are ready to consider our first machine-learning problem: linear regression. Suppose that e are interested in the values of a function y(x): R d R, here x is a d-dimensional vector-valued
More informationMA1023-Methods of Mathematics-15S2 Tutorial 1
Tutorial 1 the week starting from 19/09/2016. Q1. Consider the function = 1. Write down the nth degree Taylor Polynomial near > 0. 2. Show that the remainder satisfies, < if > > 0 if > > 0 3. Show that
More informationGRADIENT DESCENT. CSE 559A: Computer Vision GRADIENT DESCENT GRADIENT DESCENT [0, 1] Pr(y = 1) w T x. 1 f (x; θ) = 1 f (x; θ) = exp( w T x)
0 x x x CSE 559A: Computer Vision For Binary Classification: [0, ] f (x; ) = σ( x) = exp( x) + exp( x) Output is interpreted as probability Pr(y = ) x are the log-odds. Fall 207: -R: :30-pm @ Lopata 0
More informationINTRODUCTION TO MULTIGRID METHODS
INTRODUCTION TO MULTIGRID METHODS LONG CHEN 1. ALGEBRAIC EQUATION OF TWO POINT BOUNDARY VALUE PROBLEM We consider the discretization of Poisson equation in one dimension: (1) u = f, x (0, 1) u(0) = u(1)
More informationSchool of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January 2012 cycle)
MTE-0 ASSIGNMENT BOOKLET Bachelor's Degree Programme Numerical Analysis (MTE-0) (Valid from st January, 0 to st December, 0) School of Sciences Indira Gandhi National Open University Maidan Garhi, New
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationCS 257: Numerical Methods
CS 57: Numerical Methods Final Exam Study Guide Version 1.00 Created by Charles Feng http://www.fenguin.net CS 57: Numerical Methods Final Exam Study Guide 1 Contents 1 Introductory Matter 3 1.1 Calculus
More informationRevision Topic 5: Rearranging Formulae
Revision Topic 5: Rearranging Formulae Changing the suject of simple formulae Introductory example When cooking a roast, the formula that links cooking time (T) ith eight (W) can e ritten as T = 30W +
More informationSome Classes of Invertible Matrices in GF(2)
Some Classes of Invertible Matrices in GF() James S. Plank Adam L. Buchsbaum Technical Report UT-CS-07-599 Department of Electrical Engineering and Computer Science University of Tennessee August 16, 007
More informationCHAPTER 4: DYNAMICS: FORCE AND NEWTON S LAWS OF MOTION
CHAPTE 4: DYNAMICS: FOCE AND NEWTON S LAWS OF MOTION 4. NEWTON S SECOND LAW OF MOTION: CONCEPT OF A SYSTEM. A 6.- kg sprinter starts a race ith an acceleration of external force on him? 4. m/s. What is
More informationFirst Order Differential Equations
2 First Order Differential Equations We have seen ho to solve simple first order differential equations using Simulin. In particular e have solved initial value problems for the equations dy dt dy dt dx
More informationLecture 21: Numerical Solution of Differential Equations
cs41: introduction to numerical analysis 11/30/10 Lecture 1: Numerical Solution of Differential Equations Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Introduction
More informationMathematical Methods and its Applications (Solution of assignment-12) Solution 1 From the definition of Fourier transforms, we have.
For 2 weeks course only Mathematical Methods and its Applications (Solution of assignment-2 Solution From the definition of Fourier transforms, we have F e at2 e at2 e it dt e at2 +(it/a dt ( setting (
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 informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More informationLecture 3: Initial and boundary value problems in 1 dimension
Lecture 3: Initial and boundary value problems in 1 dimension Gantumur Tsogtgerel Assistant professor of Mathematics Math 319: Introduction to PDEs McGill University, Montréal January 10, 2011 Euler s
More informationIntroduction to PDEs and Numerical Methods Tutorial 11. 2D elliptic equations
Platzalter für Bild, Bild auf Titelfolie inter das Logo einsetzen Introduction to PDEs and Numerical Metods Tutorial 11. 2D elliptic equations Dr. Noemi Friedman, 3. 1. 215. Overview Introduction (classification
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationPhysics 6303 Lecture 8 September 25, 2017
Physics 6303 Lecture 8 September 25, 2017 LAST TIME: Finished tensors, vectors, and matrices At the beginning of the course, I wrote several partial differential equations (PDEs) that are used in many
More informationFinal Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University
Final Examination CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University The exam runs for 3 hours. The exam contains eight problems. You must complete the first
More informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More informationMATH 1220 Midterm 1 Thurs., Sept. 20, 2007
MATH 220 Midterm Thurs., Sept. 20, 2007 Write your name and ID number at the top of this page. Show all your work. You may refer to one double-sided sheet of notes during the eam and nothing else. Calculators
More informationBASIC EXAM ADVANCED CALCULUS/LINEAR ALGEBRA
1 BASIC EXAM ADVANCED CALCULUS/LINEAR ALGEBRA This part of the Basic Exam covers topics at the undergraduate level, most of which might be encountered in courses here such as Math 233, 235, 425, 523, 545.
More information(a) Show that there is a root α of f (x) = 0 in the interval [1.2, 1.3]. (2)
. f() = 4 cosec 4 +, where is in radians. (a) Show that there is a root α of f () = 0 in the interval [.,.3]. Show that the equation f() = 0 can be written in the form = + sin 4 Use the iterative formula
More informationIn this chapter we study several functions that are useful in calculus and other areas of mathematics.
Calculus 5 7 Special functions In this chapter we study several functions that are useful in calculus and other areas of mathematics. 7. Hyperbolic trigonometric functions The functions we study in this
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationreader is comfortable with the meaning of expressions such as # g, f (g) >, and their
The Abelian Hidden Subgroup Problem Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Introduction: The general Hidden Subgroup Problem is as follos. Let G be
More information37. f(t) sin 2t cos 2t 38. f(t) cos 2 t. 39. f(t) sin(4t 5) 40.
28 CHAPTER 7 THE LAPLACE TRANSFORM EXERCISES 7 In Problems 8 use Definition 7 to find {f(t)} 2 3 4 5 6 7 8 9 f (t),, f (t) 4,, f (t) t,, f (t) 2t,, f (t) sin t,, f (t), cos t, t t t 2 t 2 t t t t t t t
More informationMathematical Methods for Numerical Analysis and Optimization
Biyani's Think Tank Concept based notes Mathematical Methods for Numerical Analysis and Optimization (MCA) Varsha Gupta Poonam Fatehpuria M.Sc. (Maths) Lecturer Deptt. of Information Technology Biyani
More informationENGINEERING MATHEMATICS I. CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 PART-A
ENGINEERING MATHEMATICS I CODE: 10 MAT 11 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 Total Hrs: 52 Exam Marks:100 PART-A Unit-I: DIFFERENTIAL CALCULUS - 1 Determination of n th derivative of standard functions-illustrative
More informationLecture 3 Frequency Moments, Heavy Hitters
COMS E6998-9: Algorithmic Techniques for Massive Data Sep 15, 2015 Lecture 3 Frequency Moments, Heavy Hitters Instructor: Alex Andoni Scribes: Daniel Alabi, Wangda Zhang 1 Introduction This lecture is
More informationM.SC. PHYSICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student
More informationNumerical methods. Examples with solution
Numerical methods Examples with solution CONTENTS Contents. Nonlinear Equations 3 The bisection method............................ 4 Newton s method.............................. 8. Linear Systems LU-factorization..............................
More informationOn the approximation of real powers of sparse, infinite, bounded and Hermitian matrices
On the approximation of real poers of sparse, infinite, bounded and Hermitian matrices Roman Werpachoski Center for Theoretical Physics, Al. Lotnikó 32/46 02-668 Warszaa, Poland Abstract We describe a
More information1. Suppose preferences are represented by the Cobb-Douglas utility function, u(x1,x2) = Ax 1 a x 2
Additional questions for chapter 7 1. Suppose preferences are represented by the Cobb-Douglas utility function ux1x2 = Ax 1 a x 2 1-a 0 < a < 1 &A > 0. Assuming an interior solution solve for the Marshallian
More informationSOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)
CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY (Approved by AICTE New Delhi, Affiliated to Anna University Chennai. Zamin Endathur Village, Madurntakam Taluk, Kancheepuram Dist.-603311.) MA6459 - NUMERICAL
More informationNumerical and Statistical Methods
F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With
More information. (a) Express [ ] as a non-trivial linear combination of u = [ ], v = [ ] and w =[ ], if possible. Otherwise, give your comments. (b) Express +8x+9x a
TE Linear Algebra and Numerical Methods Tutorial Set : Two Hours. (a) Show that the product AA T is a symmetric matrix. (b) Show that any square matrix A can be written as the sum of a symmetric matrix
More informationNumerical and Statistical Methods
F.Y. B.Sc.(IT) : Sem. II Numerical and Statistical Methods Time : ½ Hrs.] Prelim Question Paper Solution [Marks : 75 Q. Attempt any THREE of the following : [5] Q.(a) What is a mathematical model? With
More informationLecture V: Linear difference and differential equations
Lecture V: Linear difference and differential equations BME 171: Signals and Systems Duke University September 10, 2008 This lecture Plan for the lecture: 1 Discrete-time systems linear difference equations
More informationCalculus Problem Sheet Prof Paul Sutcliffe. 2. State the domain and range of each of the following functions
f( 8 6 4 8 6-3 - - 3 4 5 6 f(.9.8.7.6.5.4.3.. -4-3 - - 3 f( 7 6 5 4 3-3 - - Calculus Problem Sheet Prof Paul Sutcliffe. By applying the vertical line test, or otherwise, determine whether each of the following
More informationMATHEMATICS. Course Syllabus. Section A: Linear Algebra. Subject Code: MA. Course Structure. Ordinary Differential Equations
MATHEMATICS Subject Code: MA Course Structure Sections/Units Section A Section B Section C Linear Algebra Complex Analysis Real Analysis Topics Section D Section E Section F Section G Section H Section
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationPH.D. PRELIMINARY EXAMINATION MATHEMATICS
UNIVERSITY OF CALIFORNIA, BERKELEY SPRING SEMESTER 207 Dept. of Civil and Environmental Engineering Structural Engineering, Mechanics and Materials NAME PH.D. PRELIMINARY EXAMINATION MATHEMATICS Problem
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 informationA Second Course in Elementary Differential Equations
A Second Course in Elementary Differential Equations Marcel B Finan Arkansas Tech University c All Rights Reserved August 3, 23 Contents 28 Calculus of Matrix-Valued Functions of a Real Variable 4 29 nth
More informationPrevious Year Questions & Detailed Solutions
Previous Year Questions & Detailed Solutions. The rate of convergence in the Gauss-Seidal method is as fast as in Gauss Jacobi smethod ) thrice ) half-times ) twice 4) three by two times. In application
More informationA Generalization of a result of Catlin: 2-factors in line graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(2) (2018), Pages 164 184 A Generalization of a result of Catlin: 2-factors in line graphs Ronald J. Gould Emory University Atlanta, Georgia U.S.A. rg@mathcs.emory.edu
More informationUSHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY
Code No: R007/R0 Set No. I B.Tech I Semester Supplementary Examinations, Feb/Mar 04 MATHEMATICAL METHODS ( Common to Civil Engineering, Electrical & Electronics Engineering, Computer Science & Engineering,
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes
UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 26: Probability and Random Processes Problem Set Spring 209 Self-Graded Scores Due:.59 PM, Monday, February 4, 209 Submit your
More informationElastic Buckling Behavior of Beams ELASTIC BUCKLING OF BEAMS
Elastic Buckling Behavior of Beams CE579 - Structural Stability and Design ELASTIC BUCKLING OF BEAMS Going back to the original three second-order differential equations: 3 Therefore, z z E I v P v P 0
More informationTutorial 1, B. Tech. Sem III, 24 July, (Root Findings and Linear System of Equations)
Tutorial, B. Tech. Sem III, 24 July, 206 (Root Findings and Linear System of Equations). Find the root of the equation e x = 3x lying in [0,] correct to three decimal places using Bisection, Regula-Falsi
More informationPONDI CHERRY UNI VERSI TY
B.Sc. ALLIED MATHEMATICS SYLLABUS 2009-2010 onwards PONDI CHERRY UNI VERSI TY PUDUCHERRY 605 014 B.Sc. ALLIED MATHEMATICS Syllabus for Allied Mathematics for B.Sc. Physics Main/Chemistry Main/Electronics
More informationPhysics 6303 Lecture 9 September 17, ct' 2. ct' ct'
Physics 6303 Lecture 9 September 17, 018 LAST TIME: Finished tensors, vectors, 4-vectors, and 4-tensors One last point is worth mentioning although it is not commonly in use. It does, however, build on
More informationDr. Allen Back. Oct. 6, 2014
Dr. Allen Back Oct. 6, 2014 Distribution Min=48 Max=100 Q1=74 Median=83 Q3=91.5 mean = 81.48 std. dev. = 12.5 Distribution Distribution: (The letters will not be directly used.) Scores Freq. 100 2 98-99
More informationHence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.
The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,
More informationDifferential Equations and Linear Algebra Exercises. Department of Mathematics, Heriot-Watt University, Edinburgh EH14 4AS
Differential Equations and Linear Algebra Exercises Department of Mathematics, Heriot-Watt University, Edinburgh EH14 4AS CHAPTER 1 Linear second order ODEs Exercises 1.1. (*) 1 The following differential
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationDynamics and control of mechanical systems
JU 18/HL Dnamics and control of mechanical sstems Date Da 1 (3/5) 5/5 Da (7/5) Da 3 (9/5) Da 4 (11/5) Da 5 (14/5) Da 6 (16/5) Content Revie of the basics of mechanics. Kinematics of rigid bodies coordinate
More informationFundamental Numerical Methods for Electrical Engineering
Stanislaw Rosloniec Fundamental Numerical Methods for Electrical Engineering 4y Springei Contents Introduction xi 1 Methods for Numerical Solution of Linear Equations 1 1.1 Direct Methods 5 1.1.1 The Gauss
More information1 :: Mathematical notation
1 :: Mathematical notation x A means x is a member of the set A. A B means the set A is contained in the set B. {a 1,..., a n } means the set hose elements are a 1,..., a n. {x A : P } means the set of
More informationNumerical Analysis Spring 2001 Professor Diamond
Numerical Analysis Spring 2001 Professor Diamond Polynomial interpolation: The Polynomial Interpolation Problem: Find a polynomial pÿx a 0 a 1 x... a n x n which satisfies the n 1 conditions pÿx 0 y 0,
More informationEngineering Mathematics through Applications
89 80 Engineering Mathematics through Applications Finite Differences, Numerical Differentiations and Integrations 8 8 Engineering Mathematics through Applications Finite Differences, Numerical Differentiations
More informationProblems on Numerical Methods for Engineers. Pedro Fortuny Ayuso. EPIG, Gijón. Universidad de Oviedo address:
Problems on Numerical Methods for Engineers Pedro Fortuny Ayuso EPIG, Gijón. Universidad de Oviedo E-mail address: fortunypedro@uniovi.es CC BY: Copyright c 2011 2015 Pedro Fortuny Ayuso This work is licensed
More informationMath 220 Final Exam Sample Problems December 12, Topics for Math Fall 2002
Math 220 Final Exam Sample Problems December 12, 2002 Topics for Math 220 - Fall 2002 Chapter 1. Solutions and Initial Values Approximation via the Euler method Chapter 2. First Order: Linear First Order:
More informationMATHEMATICS EDUCATION FOR LOGISTICS ENGINEERING
Advanced Logistic Systems Vol. 6. No. 1. (01) pp. 183-189. MATEMATICS EDUCATION FOR LOGISTICS ENGINEERING GABRIELLA BOGNÁR 1, BÉLA ILLÉS Abstract: Mathematics is a crucial language in all engineering courses
More informationEXAM 2 MARCH 17, 2004
8.034 EXAM MARCH 7, 004 Name: Problem : /30 Problem : /0 Problem 3: /5 Problem 4: /5 Total: /00 Instructions: Please write your name at the top of every page of the exam. The exam is closed book, closed
More information