Examination paper for TMA4215 Numerical Mathematics
|
|
- Tyrone Frank Maxwell
- 5 years ago
- Views:
Transcription
1 Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: Examination date: 6th of December 207 Examination time (from to): 09:00 3:00 Permitted examination support material: C: Endre Süli and David Mayers An Introduction to Numerical Analysis (a copy is accepted) TMA425 Numerical Mathematics: Collection of Lecture Notes (5/ 203, 62 pages) Interpolation summary (4. October 20, 9 pages) Lecture notes on splines (26. October 207, 8 pages) Rottmann: Matematisk formelsamling Approved calculator Other information: All answers should be justified and include enough details to make it clear which methods and/or results have been used. All the (sub-)problems are worth 5 points each. The total value is 70 points. Language: English Number of pages: 6 Number of pages enclosed: 0 Checked by: Date Signature
2
3 TMA425 Numerical Mathematics 6th of December 207 Page of 6 Problem a) The matrix is symmetric because A T = A, but it is not positive definite because the determinant is zero: A = = 0 The eigenvalues are {0, 4, 5}, so the matrix is positive semidefinite. b) Since the matrix is singular, the conditioning number is infinite. c) An LU-factorization means that we have the representation Writing out the equations, we get 0 0 d e g 2 3 a 0 0 f h = b c 0 0 i 3 7 d = ad = 2 bd = 3 e = 2 ae + f = 5 be + cf = 7 g = 3 ag + h = 7 bg + ch + i = Solving these equations, we get L = 2 0, U = Problem 2 a) Using Lagrange interpolation, we get (x 2)(x 3) L(x) = (0 2)(0 3) = (x + ) 2 x(x 3) x(x 2) (2 0)(2 3) (3 0)(3 2) 6 b) The same polynomial above satisfies the new imposed criterion.
4 Page 2 of 6 TMA425 Numerical Mathematics 6th of December 207 c) We use Hermite interpolation for this task. The function values are f(x) = sin π x f (x) = π cos πx π The required Lagrange monomials are L 0 (x) = x, L (x) = x Using the definition of the auxiliary polynomials, we get H (x) = x 2 ( 2(x )) K 0 (x) = x( x) 2 We do not need H 0 and K because they are multiplied by 0, so the Hermite interpolation polynomial becomes p(x) = x 2 (3 2x) + π x(x )2 2 Problem 3 a) We use Cox-de Boor recursion on the two first splines: φ (x) = B[0, 0, 0, /2] = /2 x B[0, 0, /2] /2 0 ( ) 2 /2 x = B[0, /2] /2 0 = (2x ) 2 χ [0,/2] φ 2 (x) = B[0, 0, /2, ] = x 0 x B[0, 0, /2] + /2 0 0 = 2x /2 x B[0, /2] + ( x) /2 0 B[0, /2, ] ( ) x 0 x B[0, /2] + B[/2, ] /2 0 /2 = 2x( 2x + x)b[0, /2] + 2( x)( x)b[/2, ] = ( 6x 2 + 4x)χ [0,/2] + 2(x ) 2 χ [/2,]
5 TMA425 Numerical Mathematics 6th of December 207 Page 3 of 6 Due to symmetry, we can reflect φ 2 and φ about the origin and move the new spline one unit to the right. This is done by replacing x with x. With this transformation, φ 2 and φ become respectively φ 3 (x) = (2x 2 )χ [0,/2] + ( 6x 2 + 8x 2)χ [/2,] φ 4 (x) = (2x ) 2 χ [/2,] b) The equations for the nodes and weights are φ (x ) φ (x 2 ) [ ] 0 φ 2 (x ) φ 2 (x 2 ) φ (x) dx w = 0 φ 2(x) dx φ 3 (x ) φ 3 (x 2 ) w 2 0 φ 3(x) dx φ 4 (x ) φ 4 (x 2 ) 0 φ 4(x) dx Because of symmetry, the two quadrature weights w and w 2 are equal, and their sum equals, so we get w = w 2 = 2 Since φ has support in [0, /2], we find x as follows: w φ (x ) + w 2 φ (x 2 ) = 0 φ (x) dx /2 2 (2x ) = (2x ) 2 dx 0 (2x ) 2 = 3 x = 2 ± 3 6 The symmetry of the nodes implies that x = 2 3 6, x 2 = c) The characteristic of orthogonal polynomials is that given and interval [a, b] and a weight function w(x) we have: φ i φ j w(x)dx = 0 i j See Definition 9.4 page 260 in the textbook of Süli and Mayers. Orthogonal polynomials play an important role in finding the best polynomial approximation of function measured in the 2-norm. The zeroes of a set of orthogonal polynomials may also be used to determine the optimal numerical sampling points in a numerical integration scheme.
6 Page 4 of 6 TMA425 Numerical Mathematics 6th of December 207 E.g. the Legendre polynomials are a set of orthogonal polynomials and on the interval [, ] they are: φ 0 (x) =, φ (x) = x, and φ 2 (x) = 3 2 x2 2. The orthogonality condition is φ i φ j dx = 0 i j We have that xdx = 2 x2 = x2 2 dx = 2 x3 2 x = 0 x 3 2 x2 2 dx = 3 8 x4 4 x2 = 0 Problem 4 a) Our function is defined as f(x) = 2x sin(x) + 2 The corresponding iteration function g and its derivative become g(x) = x 2 f(x) = 2 sin(x) g (x) = 2 cos(x) The point x is a zero of f if and only if it is a fixed point of the mapping x g(x). We observe that In this way, we obtain sup x R g (x) = sup x R g(x) g(y) = x y 2 cos(x) = 2 g (z) dz x y 2 Thus, g is a contraction mapping on R with contraction factor /2, and it follows from Banach s fixed point theorem that the fixed point iteration x k+ = g(x k ) converges to x for any starting value x 0 R.
7 TMA425 Numerical Mathematics 6th of December 207 Page 5 of 6 b) Since the maximal value of g (x) is /2 on R, and x = when x 0 = 0, we get the estimate k = ln x x 0 ln(e( L)) ln(/l) = ln 0 ln(2 6 ( /2)) ln(2) = ln(2 7 ) ln(2) = 7 We need 7 iterations before reaching the desired precision. Problem 5 a) We recognize that Φ(x n, y n ; h) = f(x n +h/2, (y n +y n+ )/2). Since Φ(x, y; 0) = f(x, y), the method is consistent. Since x n+ = x n + h, we obtain x n + h/2 = (x n + x n+ )/2 = x n+/2 and (y n + y n+ )/2 = y n+/2. Taylor expansion yields: y n+ = y n + hy n + h2 2 y n + h3 6 y y n+/2 = f(x n + h/2, (y n + y n+ )/2) = y n + h 2 y n + h2 4 y n + O(h 3 ) With these formulas, we get the truncation error n + O(h 4 ) T n = y n+ y n hf(x n + h/2, (y n + y n+ )/2) ( ) ( = y n + hy n + h2 2 y n + h3 6 y n + O(h 4 ) y n h y n + h ) 2 y n + h2 4 y n + O(h 3 ) = h3 2 y n + O(h 4 ) Since T n = O(h 2+ ), the method is of second order. Alternatively, we can utilize that the Butcher tableau is /2 /2 The second order conditions are satisfied because b =, b c = 2
8 Page 6 of 6 TMA425 Numerical Mathematics 6th of December 207 b) We replace f(t, y) with λy and obtain y n+ = y n + λh y n + y n+ ( 2 λh ) ( y n+ = + λh ) y n n n y n+ = + z z y n This is the stability function for the implicit midpoint rule, which is A-stable. c) Implicit methods are appropriate to use when the time-step for an explicit method is governed by its stability, not the accuracy. This is typical for stiff problems.
Exam 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 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 informationExamination paper for TMA4110 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA11 Matematikk 3 Academic contact during examination: Eugenia Malinnikova Phone: 735557 Examination date: 6th May, 15 Examination time (from
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 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 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 information12.0 Properties of orthogonal polynomials
12.0 Properties of orthogonal polynomials In this section we study orthogonal polynomials to use them for the construction of quadrature formulas investigate projections on polynomial spaces and their
More informationNumerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018
Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationPractice Midterm 2 Math 2153
Practice Midterm 2 Math 23. Decide if the following statements are TRUE or FALSE and circle your answer. You do NOT need to justify your answers. (a) ( point) If both partial derivatives f x and f y exist
More informationExamination paper for TMA4180 Optimization I
Department of Mathematical Sciences Examination paper for TMA4180 Optimization I Academic contact during examination: Phone: Examination date: 26th May 2016 Examination time (from to): 09:00 13:00 Permitted
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationFixed point iteration and root finding
Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
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 informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationDepartment of Applied Mathematics Preliminary Examination in Numerical Analysis August, 2013
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August, 013 August 8, 013 Solutions: 1 Root Finding (a) Let the root be x = α We subtract α from both sides of x n+1 = x
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
More informationx n+1 = x n f(x n) f (x n ), n 0.
1. Nonlinear Equations Given scalar equation, f(x) = 0, (a) Describe I) Newtons Method, II) Secant Method for approximating the solution. (b) State sufficient conditions for Newton and Secant to converge.
More informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More information, applyingl Hospital s Rule again x 0 2 cos(x) xsinx
Lecture 3 We give a couple examples of using L Hospital s Rule: Example 3.. [ (a) Compute x 0 sin(x) x. To put this into a form for L Hospital s Rule we first put it over a common denominator [ x 0 sin(x)
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationExam in Numerical Methods (MA2501)
Norwegian University of Science and Technology Department of Mathematical Sciences Page 1 of 7 MA251 Numeriske Metoder Olivier Verdier (contact: 48 95 2 66) Exam in Numerical Methods (MA251) 211-5-25,
More informationCOURSE Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method
COURSE 7 3. Numerical integration of functions (continuation) 3.3. The Romberg s iterative generation method The presence of derivatives in the remainder difficulties in applicability to practical problems
More informationExamination paper for TMA4145 Linear Methods
Department of Mathematical Sciences Examination paper for TMA4145 Linear Methods Academic contact during examination: Franz Luef Phone: 40614405 Examination date: 5.1.016 Examination time (from to): 09:00-13:00
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationThe Area bounded by Two Functions
The Area bounded by Two Functions The graph below shows 2 functions f(x) and g(x) that are continuous between x = a and x = b and f(x) g(x). The area shaded in green is the area between the 2 curves. We
More informationCHALLENGE! (0) = 5. Construct a polynomial with the following behavior at x = 0:
TAYLOR SERIES Construct a polynomial with the following behavior at x = 0: CHALLENGE! P( x) = a + ax+ ax + ax + ax 2 3 4 0 1 2 3 4 P(0) = 1 P (0) = 2 P (0) = 3 P (0) = 4 P (4) (0) = 5 Sounds hard right?
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationPolytechnic Institute of NYU MA 2132 Final Practice Answers Fall 2012
Polytechnic Institute of NYU MA Final Practice Answers Fall Studying from past or sample exams is NOT recommended. If you do, it should be only AFTER you know how to do all of the homework and worksheet
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More informationProblem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1
Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2
More informationEXAMPLE OF ONE-STEP METHOD
EXAMPLE OF ONE-STEP METHOD Consider solving y = y cos x, y(0) = 1 Imagine writing a Taylor series for the solution Y (x), say initially about x = 0. Then Y (h) = Y (0) + hy (0) + h2 2 Y (0) + h3 6 Y (0)
More informationFinal Year M.Sc., Degree Examinations
QP CODE 569 Page No Final Year MSc, Degree Examinations September / October 5 (Directorate of Distance Education) MATHEMATICS Paper PM 5: DPB 5: COMPLEX ANALYSIS Time: 3hrs] [Max Marks: 7/8 Instructions
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 informationMaking Models with Polynomials: Taylor Series
Making Models with Polynomials: Taylor Series Why polynomials? i a 3 x 3 + a 2 x 2 + a 1 x + a 0 How do we write a general degree n polynomial? n a i x i i=0 Why polynomials and not something else? We
More informationLecture 5: Function Approximation: Taylor Series
1 / 10 Lecture 5: Function Approximation: Taylor Series MAR514 Geoffrey Cowles Department of Fisheries Oceanography School for Marine Science and Technology University of Massachusetts-Dartmouth Better
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationEcon 204 (2015) - Final 08/19/2015
Econ 04 (015 - Final 08/19/015 Instructions: This is a closed book exam. You have 3 hours. The weight of each question is indicated next to it. Write clearly, explain your answers, and be concise. You
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationMini project ODE, TANA22
Mini project ODE, TANA22 Filip Berglund (filbe882) Linh Nguyen (linng299) Amanda Åkesson (amaak531) October 2018 1 1 Introduction Carl David Tohmé Runge (1856 1927) was a German mathematician and a prominent
More informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
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 informationExamples of solutions to the examination in Computational Physics (FYTN03), October 24, 2016
Examples of solutions to the examination in Computational Physics (FYTN3), October 4, 6 Allowed calculation aids: TEFYMA or Physics Handbook. The examination consists of eight problems each worth five
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationMath 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros
Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros Midterm, October 6, 016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
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 informationIterative solvers for linear equations
Spectral Graph Theory Lecture 17 Iterative solvers for linear equations Daniel A. Spielman October 31, 2012 17.1 About these notes These notes are not necessarily an accurate representation of what happened
More informationDifferentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5
Differentiation Table of contents. Derivatives................................................. 2.. Definition................................................ 2.2. Arithmetics...............................................
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationExamination paper for TMA4110/TMA4115 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA40/TMA45 Matematikk 3 Academic contact during examination: Gereon Quick Phone: 48 50 4 2 Examination date: 8 August 206 Examination time (from
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,
Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the
More informationMath 227 Sample Final Examination 1. Name (print) Name (sign) Bing ID number
Math 227 Sample Final Examination 1 Name (print) Name (sign) Bing ID number (Your instructor may check your ID during or after the test) No books, notes, or electronic devices (calculators, cell phones,
More informationMATH 118, LECTURES 27 & 28: TAYLOR SERIES
MATH 8, LECTURES 7 & 8: TAYLOR SERIES Taylor Series Suppose we know that the power series a n (x c) n converges on some interval c R < x < c + R to the function f(x). That is to say, we have f(x) = a 0
More informationReview: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function.
Taylor Series (Sect. 10.8) Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function. Review: Power series define functions Remarks:
More informationMath 180, Exam 2, Practice Fall 2009 Problem 1 Solution. f(x) = arcsin(2x + 1) = sin 1 (3x + 1), lnx
Math 80, Exam, Practice Fall 009 Problem Solution. Differentiate the functions: (do not simplify) f(x) = x ln(x + ), f(x) = xe x f(x) = arcsin(x + ) = sin (3x + ), f(x) = e3x lnx Solution: For the first
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationMath 113 Winter 2005 Key
Name Student Number Section Number Instructor Math Winter 005 Key Departmental Final Exam Instructions: The time limit is hours. Problem consists of short answer questions. Problems through are multiple
More informationLecture IX. Definition 1 A non-singular Sturm 1 -Liouville 2 problem consists of a second order linear differential equation of the form.
Lecture IX Abstract When solving PDEs it is often necessary to represent the solution in terms of a series of orthogonal functions. One way to obtain an orthogonal family of functions is by solving a particular
More informationExercises * on Linear Algebra
Exercises * on Linear Algebra Laurenz Wiskott Institut für Neuroinformatik Ruhr-Universität Bochum, Germany, EU 4 February 7 Contents Vector spaces 4. Definition...............................................
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 informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationExamination paper for TMA4285 Time Series Models
Department of Mathematical Sciences Examination paper for TMA4285 Series Models Academic contact during examination: Professor Jarle Tufto Phone: 99 70 55 19 Examination date: December 8, 2016 Examination
More informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
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 informationAssignment # 8, Math 370, Fall 2018 SOLUTIONS:
Assignment # 8, Math 370, Fall 018 SOLUTIONS: Problem 1: Solve the equations (a) y y = 3x + x 4, (i) y(0) = 1, y (0) = 1, y (0) = 1. Characteristic equation: α 3 α = 0 so α 1, = 0 and α 3 =. y c = C 1
More informationGrade: The remainder of this page has been left blank for your workings. VERSION D. Midterm D: Page 1 of 12
First Name: Student-No: Last Name: Section: Grade: The remainder of this page has been left blank for your workings. Midterm D: Page of 2 Indefinite Integrals. 9 marks Each part is worth marks. Please
More informationLecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
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 informationLecture 9: Implicit function theorem, constrained extrema and Lagrange multipliers
Lecture 9: Implicit function theorem, constrained extrema and Lagrange multipliers Rafikul Alam Department of Mathematics IIT Guwahati What does the Implicit function theorem say? Let F : R 2 R be C 1.
More informationIf y = f (u) is a differentiable function of u and u = g(x) is a differentiable function of x then dy dx = dy. du du. If y = f (u) then y = f (u) u
Section 3 4B Lecture The Chain Rule If y = f (u) is a differentiable function of u and u = g(x) is a differentiable function of x then dy dx = dy du du dx or If y = f (u) then y = f (u) u The Chain Rule
More informationAn Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence
An Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence John Pearson MSc Special Topic Abstract Numerical approximations of
More informationSCORE. Exam 3. MA 114 Exam 3 Fall 2016
Exam 3 Name: Section and/or TA: Do not remove this answer page you will return the whole exam. You will be allowed two hours to complete this test. No books or notes may be used. You may use a graphing
More informationMA22S3 Summary Sheet: Ordinary Differential Equations
MA22S3 Summary Sheet: Ordinary Differential Equations December 14, 2017 Kreyszig s textbook is a suitable guide for this part of the module. Contents 1 Terminology 1 2 First order separable 2 2.1 Separable
More informationMathematics for Chemistry: Exam Set 1
Mathematics for Chemistry: Exam Set 1 June 18, 017 1 mark Questions 1. The minimum value of the rank of any 5 3 matrix is 0 1 3. The trace of an identity n n matrix is equal to 1-1 0 n 3. A square matrix
More informationAnalysis III Solutions - Serie 12
.. Necessary condition Let us consider the following problem for < x, y < π, u =, for < x, y < π, u y (x, π) = x a, for < x < π, u y (x, ) = a x, for < x < π, u x (, y) = u x (π, y) =, for < y < π. Find
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
3 Numerical Solution of Nonlinear Equations and Systems 3.1 Fixed point iteration Reamrk 3.1 Problem Given a function F : lr n lr n, compute x lr n such that ( ) F(x ) = 0. In this chapter, we consider
More informationMA2AA1 (ODE s): The inverse and implicit function theorem
MA2AA1 (ODE s): The inverse and implicit function theorem Sebastian van Strien (Imperial College) February 3, 2013 Differential Equations MA2AA1 Sebastian van Strien (Imperial College) 0 Some of you did
More informationApplied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight
Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationJuly 21 Math 2254 sec 001 Summer 2015
July 21 Math 2254 sec 001 Summer 2015 Section 8.8: Power Series Theorem: Let a n (x c) n have positive radius of convergence R, and let the function f be defined by this power series f (x) = a n (x c)
More informationNumerical Methods for Differential Equations Mathematical and Computational Tools
Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic
More informationf (x) = k=0 f (0) = k=0 k=0 a k k(0) k 1 = a 1 a 1 = f (0). a k k(k 1)x k 2, k=2 a k k(k 1)(0) k 2 = 2a 2 a 2 = f (0) 2 a k k(k 1)(k 2)x k 3, k=3
1 M 13-Lecture Contents: 1) Taylor Polynomials 2) Taylor Series Centered at x a 3) Applications of Taylor Polynomials Taylor Series The previous section served as motivation and gave some useful expansion.
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
More informationECONOMICS 207 SPRING 2006 LABORATORY EXERCISE 5 KEY. 8 = 10(5x 2) = 9(3x + 8), x 50x 20 = 27x x = 92 x = 4. 8x 2 22x + 15 = 0 (2x 3)(4x 5) = 0
ECONOMICS 07 SPRING 006 LABORATORY EXERCISE 5 KEY Problem. Solve the following equations for x. a 5x 3x + 8 = 9 0 5x 3x + 8 9 8 = 0(5x ) = 9(3x + 8), x 0 3 50x 0 = 7x + 7 3x = 9 x = 4 b 8x x + 5 = 0 8x
More information8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0
8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n
More information