Fixed point iteration and root finding
|
|
- Ginger Shaw
- 5 years ago
- Views:
Transcription
1 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 by x k+ = 3x k x 3 k. (4) a) Find all fixed points of this iteration. How many of the fixed points are stable? b) Find the order of convergence of the iteration at the stable fixed point(s). c) Show that for x [, ], x 0, the iteration (4) always converges. SOLUTION: a) Solving the equation x = (3x x 3 )/ g(x) gives the fixed points x = ± and x = 0 The fixed points x = ± are stable since g (±) = 0, and the fixed point x = 0 is unstable since g (0) = 3/ >. b) Let α denote the fixed point x = or x =. Define the error ɛ n x n α. Taylor expanding x n+ = g(x n ) around α gives us x n+ = g(x n ) = g(α) + g (α)ɛ n + g (α) ɛ n + O(ɛ3 n ). Since g(α) = α, we have that ɛ n+ = g(x n ) g(α) and hence ɛ n+ = g (α)ɛ n + g (α) ɛ n + O(ɛ 3 n). Since g (±) = 0 and g (α) = 3 we have that the lowest non-zero term is O(ɛ n ) and we have quadratic convergence. 3
2 c) We show that g([0, ]) [0, ] by first observing that g (x) = 3 3x > 0 for x (0, ). Therefore the function g(x) is monotonically increasing from g(0) = 0 to the local maximum g() = and hence g([0, ]) [0, ]. Since x k+ x k = 3x k x 3 k x k = 3 x k. we have that x k+ x k > for x (0, ). Hence, if x 0 (0, ) then {x k } is a monotonically increasing sequence in the interval [0, ] where it must have a point of accumulation. Since x = 0 and x = are the only fixed points in this interval, the monotonically increasing sequence must converge to x =. (The argument when x 0 [, 0) is analogous.) 4
3 Quadrature Gaussian quadratures f(x) dx = w k f(x k ) () with nodes including the endpoints (x 0 = and x N = ) are called Gauss- Legendre-Lobatto quadratures. a) Show that if the interior nodes x,..., x N in the quadrature are given by the roots of p N (x), where p N(x) denotes the N:th degree Legendre polynomial, then the quadrature is exact for polynomials up to degree N. Hint: The N :th degree Legendre polynomial can be written as p N (x) = s N (x)(x )p N (x) + r N(x) where s N (x) and r N (x) are N :th and N:th degree polynomials, respectively. b) Find the 4-point (N = 3) Gauss-Legendre-Lobatto quadrature (nodes and weights) for the integrals f(x) dx. Hint: The three term recursion for Legendre polynomials is given by P 0 (x) =, P (x) = x and (k + )P k+ (k + )xp k + kp k = 0. SOLUTION: a) We want to show that with the given nodes, weights can be found such that p N (x) dx = w k p N (x k ). From the hint we have that p N (x) dx = s N (x)(x )p N (x) dx + r N (x) dx. Integration by parts of the first integral to the right gives s N (x)(x )p N (x) dx = d ( sn (x)(x ) ) p N (x) dx. dx
4 Since d (s dx N (x)(x )) is a polynomial of degree N, it can be expanded into p 0 (x),..., p N (x). Since these polynomials are orthogonal to p N (x), the integral s N(x )p N (x) dx = 0, and hence p N (x) dx = r N (x) dx. () Since x 0 =, x N =, and {x k } N k= are the roots of p N (x), it follows that w k p N (x k ) = w k s N (x k )(x k )p N (x k) dx + w k r N (x k ) dx = w k r N (x k ) dx. To show () we see from () and (3) that we must require that r N(x) dx = N w kr N (x k ) for r N (x) = x j, j = 0,..., N. This gives a linear (Vandermonde) system for the weights w k which can be solved since the nodes are distinct. b) Using the recursion formula for Legendre polynomials we find that p 3 (x) = 5x 3 3x, and hence p 3 (x) = 5x 3 with the roots ± 5. Hence, the nodes are x 0 =, x = / 5, x = 5 and x 3 =. We find the weights by solving the system 3 w k x j k = x j dx, j = 0,..., 3 w 0 + w + w + w 3 = w 0 w 5 + w 5 + w 3 = 0 w 0 + w 5 + w 5 + w 3 = 3 w 0 w 5 + w w 5 3 = 0 which by using symmetry (w 0 = w 3 and w = w ) is reduced to { w0 + w = w 0 + w 5 = 3 with the solution w 0 = /6 and w = 5/6. (3)
5 Interpolation / Approximation: 3. a. Define what is meant by a cubic spline. b. Show that giving just function values f(x i), i =,..., N is insufficient to determine uniquely a cubic spline through the points. Work out how many additional conditions that are required for this. c. Two ways to obtain a unique cubic spline interpolant are known as 'natural spline' and 'not-a-knot' spline. Define these two spline types. d. A cubic B-spline is the cubic spline that is non-zero over the narrowest interval. In the case of a unit-spaced grid, it will look as shown in the figure to the right; non-zero over four subintervals only (taking values at the nodes and at subinterval midpoints as shown, when normalized in the usual fashion). If one knows the values of such a B-spline f (x) only at the node points, one can very easily tabulate it at increasingly denser sets of point locations by means of repeatedly using the relation /3 3/48 /6 /48 f (x) = 8 (f (x ) + 4f (x ) + 6f (x) + 4f (x + ) + f (x + )) () Show that () holds true for all values of x. Hint: One way to solve the problem, requiring only little algebra, is to let f(x) in the right hand side of () be the cubic B-spline, and then show that uniqueness of cubic splines implies that the whole expression must evaluate to the very same spline. Solution: a. A cubic spline s(x) is a piecewise cubic function which, at the nodes, feature continuity in s, s', s'' (but may jump in s'''). b. With f(x i), i =,..., N given, we need to determine N- cubics, i.e. 4N-4 parameters. The conditions we have are Function values at the ends of each sub-interval (N-) Continuity of s' at interior nodes N- Continuity of s'' at interior nodes N- for a total of 4N-6. We fall short of conditions. c. Natural spline: Add two conditions by imposing also s''(x ) = s''(x N) = 0. Not-a-knot spline: Remove two freedoms by not allowing the jump in s''' at x and x N-. d. Substituting the B-spline f(x) into the right hand side of () gives a piecewise cubic result, which we call h(x). It will clearly satisfy: - h(x)h0 for x < - and x > +. - Continuity of h, h', h'' everywhere, and possible jumps in h''' at x =, 3,,, 0,,, 3,. In particular, h''(-) = h''() = 0. - At the points x =, 3,,, 0,,, 3,, h(x) evaluates to the same values as are given in the figure for f(x). A cubic spline which takes certain values at the nodes and also satisfies zero second derivative end conditions is the unique natural spline. Both h(x) and f(x) (the B-spline) satisfies all the properties just listed. So they have to be the same.
6 Linear Algebra Let A be an m n matrix, with m n, and b and m vector. Consider the least-squares problem which can be written as min Ax x R b, n Ax b. () a. Explain why any solution of the normal equations is a solution of this problem, regardless of the rank of A. Show that the solution is unique if the rank of A is n. b. Describe the solution of this problem in terms of the singular value decomposition of A. Consider the regularized least-squares problem ( min Ax b + λ x ). x R n c. Derive a form of the normal equations for this problem. Use it to argue that the regularized problem has a unique solution whenever λ 0, regardless of the rank of A. (Hint: Write the regularized least-square problem in the form of equation () using an (m+n) n linear system.) d. Write the solution of the regularized problem in terms of the singular value decomposition of A. e. Assume that A has only one zero singular value and b is not orthogonal to the corresponding left singular vector of A. Describe the effect on the solution, x, of the regularized problem as λ 0. Solution: a. Any solution of the least-squares problem satisfies the orthogonality condition < Ax b, Az >= 0 z R n and, thus, x satisfies the normal equations, which are given by A t Ax = A t b. If A has rank n, then A t A is nonsingular and x = (A t A) A t b.
7 b. Let the singular value decomposition be given as A = UΛV where U is an m m unitary matrix, V is an n n unitary matrix and Λ is is an m n matrix such that Λ = diag {σ, σ,..., σ n }, 0 σ σ σ n Substituting in the equation above and simplifying, we have x = V Λ U b + z where Λ = diag { σ, σ,..., σ n }, σ j = { 0 σj = 0 0 and z is any null vector of A. Writing it out in terms of the columns of U and V yields x = v j u t j b + z c. Write the system as [ A λi 0 ] x ( b 0 The normal equations associated with the regularized problem are [ A t λi ] [ ] A x = [ A λi t λi ] ( ) b 0 ). which become ( A t A + λ I ) x = A t b. () Since, A t A is positive semidefinite and, if λ 0, λ I is positive definite, then A t A + λ I is nonsingular. This implies that equation() has a unique solution/ d. Plugging the singular value decomposition in to these new normal equations, we have x = V DU b where D = diag {..., } σj + λ,....
8 Writing it out in terms of the columns of U and V yields x = n j= σ j + λ v ju j t b = 0 σ j + λ v ju j t b e. Consider the formula above. If = 0, it play no role in the solution. Thus, lim x = v j u t j b λ 0 0 which is the minimal length least squares solution. 3
9 Numerical ODE: 5. A general linear multistep formula for solving y = f (t, y) takes the form p y n+ = j=0 q a j y n j + k j= b j f (t n j, y n j ) a. Derive the coefficients a j and b j for the second order Adams-Bashforth and Adams-Moulton methods. b. The figure to the right shows the stability domain for the second order Adams-Bashforth method (interior of the closed curve). Can this method be used to solve y = y, y = y, and/or y = i y? Explain! c. Determine the stability domain for the second order Adams-Moulton method Solution: a. The AB-formula for solving y = f(t, y) takes the form y n+ = a 0 y n + k[b 0 f n + b f n ]. It should be exact for example when k = and {yh, fh0}, {yht, fh}, {yht, fht}. This gives three equations: = a 0 +0b 0 +0b = 0a 0 +b 0 +b = 0a 0 +0b 0 b with the solution a 0 =, b 0 = 3, b =. For AM, we get similarly y n+ = a 0 y n + k[b f n+ + b 0 f n ], leading to = a 0 +0b +0b 0 = 0a 0 +b +b 0 = 0a 0 +b +0b 0 with the solution a 0 =, b =, b 0 =. b. The stability domain tells for which values of the time step k solutions to the ODE y = y can feature growing solutions. That is not the information we need to decide convergence. This instead requires - consistency (here OK; already first order accuracy would be slightly more than what is needed) - stability (root condition OK; the equation to test is r =, which obviously has as only root r = ) So the method can be used for all the cases mentioned. c. We find the stability domain by applying the method to y = y, giving y n+ + y n + k Writing [y n+ + y n ]. k =, this becomes y n+ = + / The relation holds precisely when Re ξ < 0. Hence, / y + / n. / < the stability domain is the left half plane.
10 6. Finite Difference Equations for PDEs ConsiderRichardson sdifferenceschemefortheheatequation,u t =u xx : k (u(x,t+k) u(x,t k))= h (u(x h,t) u(x,t)+u(x+h,t)) a. Show that this scheme has second-order truncation error. b. UseeitherODEprinciplesorvonNeumannanalysistoshowthatthis scheme is unconditionally unstable. c. Demonstrate a minor modification of the left-side of Richardson s scheme that yields a familiar unconditionally stable scheme and prove it. Solution a. Taylor expansion of left-hand side yields k (u(x,t+k) u(x,t k))=u t(x,t)+ 6 u ttt(x,t)k +O(k 4 ) Likewise, a Taylor expansion of the right-hand side yields h (u(x h,t) u(x,t)+u(x+h,t))=u xx(x,t)+ u xxxx(x,t)h +O(h 4 ) b. Using von Neumannanalysis, we set u(x,t) = a t e iωx andsolve for a k. This yields the equation a k a k = k h (e iωh +e iωh )= 4k h (cos(ωh))=8k h sin (ωh/) Multiplyingbya k yields (a k ) + 8k h sin (ωh/)a k =0 Plugging in the values a k = 0 and a k = demonstrates that the equationhasarealroota k <foranyk,h>0,andω. 3
11 c. The backward Euler scheme is k (u(x,t) u(x,t k))= h (u(x h,t) u(x,t)+u(x+h,t)) A von Neumann analysis yields a k =a kk h (e iωh +e iωh )=a k4k h (cos(ωh))=ak8k h sin (ωh/) Solvingfora k yileds a k = foranyk,h>0,andω. + 8k (sin (ωh/)) <.0 h 4
Preliminary 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
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 information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
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 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 informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More 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 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 informationECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
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 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 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 informationOutline. 1 Numerical Integration. 2 Numerical Differentiation. 3 Richardson Extrapolation
Outline Numerical Integration Numerical Differentiation Numerical Integration Numerical Differentiation 3 Michael T. Heath Scientific Computing / 6 Main Ideas Quadrature based on polynomial interpolation:
More informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationIntegration, differentiation, and root finding. Phys 420/580 Lecture 7
Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation 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 informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationOutline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs
Boundary Value Problems Numerical Methods for BVPs Outline Boundary Value Problems 2 Numerical Methods for BVPs Michael T. Heath Scientific Computing 2 / 45 Boundary Value Problems Numerical Methods for
More 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 informationMultistage Methods I: Runge-Kutta Methods
Multistage Methods I: Runge-Kutta Methods Varun Shankar January, 0 Introduction Previously, we saw that explicit multistep methods (AB methods) have shrinking stability regions as their orders are increased.
More informationIntroductory Numerical Analysis
Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection
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 informationNumerical interpolation, extrapolation and fi tting of data
Chapter 6 Numerical interpolation, extrapolation and fi tting of data 6.1 Introduction Numerical interpolation and extrapolation is perhaps one of the most used tools in numerical applications to physics.
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationScientific Computing: Numerical Integration
Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture
More informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
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 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 informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
More informationMA 3021: Numerical Analysis I Numerical Differentiation and Integration
MA 3021: Numerical Analysis I Numerical Differentiation and Integration Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw
More informationTime stepping methods
Time stepping methods ATHENS course: Introduction into Finite Elements Delft Institute of Applied Mathematics, TU Delft Matthias Möller (m.moller@tudelft.nl) 19 November 2014 M. Möller (DIAM@TUDelft) Time
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
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 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 informationLEAST SQUARES APPROXIMATION
LEAST SQUARES APPROXIMATION One more approach to approximating a function f (x) on an interval a x b is to seek an approximation p(x) with a small average error over the interval of approximation. A convenient
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
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 informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationLecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems
Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems Tom Lyche University of Oslo Norway Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems p.1/33 Plan for the day 1. Notation
More information10.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
10.1 Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1 Examples: EX1: Find a formula for the general term a n of the sequence,
More informationNumerical Integration (Quadrature) Another application for our interpolation tools!
Numerical Integration (Quadrature) Another application for our interpolation tools! Integration: Area under a curve Curve = data or function Integrating data Finite number of data points spacing specified
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationInterpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning
76 Chapter 7 Interpolation 7.1 Interpolation Definition 7.1.1. Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t
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 informationSection 6.6 Gaussian Quadrature
Section 6.6 Gaussian Quadrature Key Terms: Method of undetermined coefficients Nonlinear systems Gaussian quadrature Error Legendre polynomials Inner product Adapted from http://pathfinder.scar.utoronto.ca/~dyer/csca57/book_p/node44.html
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 informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationRomberg Integration and Gaussian Quadrature
Romberg Integration and Gaussian Quadrature P. Sam Johnson October 17, 014 P. Sam Johnson (NITK) Romberg Integration and Gaussian Quadrature October 17, 014 1 / 19 Overview We discuss two methods for integration.
More informationNotation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i
LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
More informationMath 578: Assignment 2
Math 578: Assignment 2 13. Determine whether the natural cubic spline that interpolates the table is or is not the x 0 1 2 3 y 1 1 0 10 function 1 + x x 3 x [0, 1] f(x) = 1 2(x 1) 3(x 1) 2 + 4(x 1) 3 x
More informationFundamentals of Numerical Mathematics. Charles University Prague Faculty of Mathematics and Physics Czech Republic
Fundamentals of Numerical Mathematics Vít Dolejší Charles University Prague Faculty of Mathematics and Physics Czech Republic dolejsi@karlin.mff.cuni.cz December 18, 2017 Preface These lecture notes more
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 informationThe problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.
NUMERICAL ANALYSIS PRACTICE PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations
More informationFinite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations
Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO
More informationFourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
More informationMath 4263 Homework Set 1
Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that
More informationFinite Differences: Consistency, Stability and Convergence
Finite Differences: Consistency, Stability and Convergence Varun Shankar March, 06 Introduction Now that we have tackled our first space-time PDE, we will take a quick detour from presenting new FD methods,
More information1 Piecewise Cubic Interpolation
Piecewise Cubic Interpolation Typically the problem with piecewise linear interpolation is the interpolant is not differentiable as the interpolation points (it has a kinks at every interpolation point)
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 informationEngg. Math. II (Unit-IV) Numerical Analysis
Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationHIGHER ORDER METHODS. There are two principal means to derive higher order methods. b j f(x n j,y n j )
HIGHER ORDER METHODS There are two principal means to derive higher order methods y n+1 = p j=0 a j y n j + h p j= 1 b j f(x n j,y n j ) (a) Method of Undetermined Coefficients (b) Numerical Integration
More informationDifferentiation and Integration
Differentiation and Integration (Lectures on Numerical Analysis for Economists II) Jesús Fernández-Villaverde 1 and Pablo Guerrón 2 February 12, 2018 1 University of Pennsylvania 2 Boston College Motivation
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More informationNumerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.
Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Discretization of Boundary Conditions Discretization of Boundary Conditions On
More informationNUMERICAL MATHEMATICS AND COMPUTING
NUMERICAL MATHEMATICS AND COMPUTING Fourth Edition Ward Cheney David Kincaid The University of Texas at Austin 9 Brooks/Cole Publishing Company I(T)P An International Thomson Publishing Company Pacific
More informationApplied Math 205. Full office hour schedule:
Applied Math 205 Full office hour schedule: Rui: Monday 3pm 4:30pm in the IACS lounge Martin: Monday 4:30pm 6pm in the IACS lounge Chris: Tuesday 1pm 3pm in Pierce Hall, Room 305 Nao: Tuesday 3pm 4:30pm
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 informationNumerical Methods for PDEs
Numerical Methods for PDEs Problems 1. Numerical Differentiation. Find the best approximation to the second drivative d 2 f(x)/dx 2 at x = x you can of a function f(x) using (a) the Taylor series approach
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
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 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 informationMath 307 Learning Goals
Math 307 Learning Goals May 14, 2018 Chapter 1 Linear Equations 1.1 Solving Linear Equations Write a system of linear equations using matrix notation. Use Gaussian elimination to bring a system of linear
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
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 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 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 informationswapneel/207
Partial differential equations Swapneel Mahajan www.math.iitb.ac.in/ swapneel/207 1 1 Power series For a real number x 0 and a sequence (a n ) of real numbers, consider the expression a n (x x 0 ) n =
More informationInitial value problems for ordinary differential equations
Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP
More information