Numerical Analysis Spring 2001 Professor Diamond
|
|
- Lucas Jennings
- 5 years ago
- Views:
Transcription
1 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, pÿx 1 y 1,...,pŸx n y n. It is easy to see that the unknown coefficients a 0,..,a n are to satisfy a system of n 1 equations in n 1 unknowns, which we write in shorthand as pÿx i y i, i 0,..., n I. The homogeneous system pÿx i 0, i 0,..., n has pÿx q 0,i.e. a 0 a 1... a n 0, as its only solution. This is obvious from algebra since a polynomial of degree n which is zero at the n 1 points x 0,..,x n must be the zero polynomial. This implies, from the theory of linear equations, that the general system pÿx i y i, i 0,..., n has a unique solution for any given choice of y 0,..,y n. Thus the solution of the polynomial interpolation problem exists, and is unique. II. Direct construction of an interpolating polynomial: The Lagrange Form, the Lagrange fundamental polynomials. Example: Consider this mysterious looking polynomial pÿx y 0 Ÿx " 1 Ÿx " 2 Ÿx " 3 Ÿ0 " 1 Ÿ0 " 2 Ÿ0 " 3 y 1 Ÿx " 0 Ÿx " 2 Ÿx " 3 Ÿ1 " 0 Ÿ1 " 2 Ÿ1 " 3 y 2 Ÿx " 0 Ÿx " 1 Ÿx " 3 Ÿ2 " 0 Ÿ2 " 1 Ÿ2 " 3 y 3 Ÿx " 0 Ÿx " 1 Ÿx " 2 Ÿ3 " 0 Ÿ3 " 1 Ÿ3 " 2 We can easily see that pÿ0 y 0,pŸ1 y 1,pŸ2 y 2,pŸ3 y 3. Generalizing this construction to a general set of interpolation points x 0,..,x n we obtain Lagrange form of the interpolating polynomial: pÿx y 0 L 0 Ÿx y 1 L 1 Ÿx... y n L n Ÿx where L i Ÿx is the Lagrange fundamental polynomial satisfying H. Diamond Numerical Analysis Spring
2 L i Ÿx 1ifx x i ;0 ifx x j for j p i and is given explicitly by L i Ÿx Ÿx " x 0 Ÿx " x i"1 Ÿx " x i1 Ÿx " x n Ÿx i " x 0 Ÿx i " x i"1 Ÿx i " x i1 Ÿx i " x n We have more efficient ways of computing than using the polynomial in this form, but there is a very important theoretical & practical importance to L i Ÿx ; it represents the sensitivity of the value of the interpolating polynomial p at x to changes in the datavalue y i,so that if y i changes by y i then pÿx changes by Ÿ y i L i Ÿx. Newton form of the interpolating polynomial: Here is another way of constructing the interpolating polynomial that leads to the so-called Newton form the and theory of divided differences. It s the best algorithm for constructing and evaluating the interpolating polynomial. For notation purposes, it helps to think of the y-values as coming from some function fÿx, so that we are interpolating the values fÿx i at the points x i, i.e. satisfying the equations pÿx i fÿx i,i 0,.., n. Note the following: p 0 Ÿx fÿx 0 interpolates the single value fÿx 0 with a polynomial of degree zero p 1 Ÿx fÿx 0 a 1 Ÿx " x 0 interpolates at x x 0 and with the right choice of a 1 fÿx 1 " fÿx 0 x 1 " x 0 also interpolates at x x 1 Now consider p 2 Ÿx p 1 Ÿx a 2 Ÿx " x 0 Ÿx " x 1 Because of the form of the last term we added, p 2 Ÿx still interpolates at x 0 and x 1.Ifwe now choose a 2 the right way we can make p 2 Ÿx interpolate at x 2 as well. We could write a 2 fÿx 2 " p 1 Ÿx 2 Ÿx 2 " x 0 Ÿx 2 " x 1 but there is a better way to calculate a 2 that we ll see later. For now, all we need to notice is that we can calculate the unique a 2 for which p 2 Ÿx H. Diamond Numerical Analysis Spring
3 interpolates at x 0,x 1,x 2. form In this way, we can construct, in principle, an interpolating polynomial of degree n of the p n Ÿx a 0 a 1 Ÿx " x 0... a n Ÿx " x 0 Ÿx " x n"1 p n"1 Ÿx a n Ÿx " x 0 Ÿx " x n"1 whose partial sums p k Ÿx a 0 a 1 Ÿx " x 0... a k Ÿx " x 0 Ÿx " x k"1 are interpolating polynomials of lower degree and which solve the interpolation problem at x i,i 0,.., k. Note that each a k can be described as the coefficient of x k in the interpolating polynomial p k Ÿx - this characterization does not depend on the form of the polynomial representation or the order in which the interpolation points are used. This is called the Newton form of the interpolating polynomial. The polynomial, once the coefficients have been determined, can be efficiently evaluated recursively using nested multiplication. The coefficients themselves are important in how they depend on the function values fÿx i and the x i themselves. They are called divided differences, and there is a nice theory that applies to them. Divided differences: Definition: Let t 0,.., t k be a vector of (for now, distinct) values. Given a function f, we define the divided difference of f at the values t 0,..,t k to be the coefficient of x k in the (interpolating) polynomial p of degree k that satisfies pÿt i fÿt i, i 0,.., k. We write f t 0,..,t k to denote this divided difference. A divided difference over k 1 points is referred to as a k th order divided difference. Using the divided difference notation, we can write the Newton form of the interpolating polynomial as H. Diamond Numerical Analysis Spring
4 p n Ÿx f x 0 f x 0,x 1 Ÿx " x 0... f x 0,..., x n Ÿx " x 0 Ÿx " x n"1 We will see that this is a discrete version of the Taylor polynomial P n, in the sense that we obtain P n as the polynomial that interpolates the derivatives of f at x a, and we add an n th degree term on to P n"1 to obtain P n. Also the k th order divided difference f t 0,..,t k will be seen to be closely related to the k th derivative of f. Next we have a nice theorem which provides a recursive formula for calculating divided differences. Theorem: f x 0,x 1,..., x n"1,x n f x 0,x 1,...,x n"1 " f x 1,...,x n"1,x n x n " x 0 This theorem espresses an n th order divided difference as a (first-order) divided difference of n " 1 st order divided differences. Proof: Suppose the polynomial PŸx interpolates f at x 0,x 1,...,x n"1 so that PŸx i fÿx i, i 0,.., n " 1; suppose the polynomial QŸx interpolates f at x 1,...,x n"1,x n so that QŸx i fÿx i, i 1,.., n Now we create as follows a polynomial pÿx that interpolates f at x 0,x 1,...,x n"1,x n : pÿx Ÿx n " x PŸx Ÿx " x 0 QŸx Clearly pÿx 0 PŸx 0 fÿx 0 and pÿx n QŸx n fÿx n and for i 1,.., n " 1 we have pÿx i Ÿx n " x i PŸx i Ÿx i " x 0 QŸx i Ÿx n " x i fÿx i Ÿx i " x 0 fÿx i fÿx i Now in pÿx the coefficient of x n is, by definition, the divided difference f x 0,x 1,..., x n"1,x n ; on the right, in the expression pÿx Ÿx n " x PŸx Ÿx " x 0 QŸx the coefficient of x n is the highest power coefficient of QŸx minus the highest power coefficient of H. Diamond Numerical Analysis Spring
5 PŸx, divided by,or f x 0, x 1,..., x n"1 " f x 1,...,x n"1,x n x n " x 0 coefficient of x n on both sides, we obtain f x 0,x 1,..., x n"1,x n f x 0,x 1,...,x n"1 " f x 1,..., x n"1,x n x n " x 0., and equating the Let s use this result for a practical purpose: Computing the coefficients a i f x 0,..,x i of the Newton polynomial. We begin with an array of x-values x 0,..., x n and an array of function values fÿx 0,...,fŸx n. We compute the first order differences between adjacent points, then the second order differences, and so on. In tabular form, this produces the divided difference table x i f x i f x i,x i1 f x i,x i1,x i2... x 0 fÿx 0 x 1 fÿx 1 f x 0,x 1 f x 0,x 1,x 2 f x 1,x 2 B B B B f x 0,..., x n f x n"2,x n"1 x n"1 fÿx n"1 f x n"2,x n"1,x n x n fÿx n f x n"1,x n The coefficients of the Newton interpolating polynomial appear on the top downward-sloping diagonal of the table. One might also note that any path through the table provides the coefficients of pÿx in (a different) Newton form. If one wishes to interpolate at an additional interpolation point, x n1, then this may be added to the bottom of the table and the bottom upward-sloping diagonal computed to find the coefficient a n1 f x 0,..,x n,x n1 of the additional term a n1 Ÿx " x 0 Ÿx " x n. H. Diamond Numerical Analysis Spring
6 Now we demonstrate the connection between divided differences and derivatives: Theorem: Assuming that f has an n th continuous derivative, f x 0,..., x n 1 n! f Ÿn Ÿ8 where 8 is between the smallest of the x i and the largest. Proof: Let pÿx interpolate fÿx at x 0,...,x n and consider the difference fÿx " pÿx. This function is zero at the n1 points x 0,...,x n. Now if a function is zero at two points, its derivative is zero somewhere in between (Rolle s theorem). If a function is zero at three points, then the first derivative is zero at two points (in between) and the second derivative is then zero at one point in between the three. Continuing, a function that is zero at n 1 points has its n th derivative zero at one point in between. Also note that the n th derivative of pÿx is n! ' coeff of x n n!f x 0,..., x n. We now have: Ÿf " p Ÿn Ÿ8 f Ÿn Ÿ8 " p Ÿn Ÿ8 0, f Ÿn Ÿ8 " n!f x 0,..., x n 0 and the theorem follows. Finally, we provide an important theorem analogous to Taylor s Theorem which says how well a polynomial interpolant p n Ÿx of degree n approximates the function fÿx Theorem: The error in polynomial interpolation satisfies fÿx " p n Ÿx f x 0,.., x n,x Ÿx " x 0 Ÿx " x n 1 Ÿn 1! f Ÿn1 Ÿ8 Ÿx " x 0 Ÿx " x n where 8 is between the smallest and largest values of the x i. Proof: We are given the points x 0,..,x n and values fÿx 1,..,fŸx n, and p n Ÿx interpolates the values of f at the given x-values. Now pick some other x-value, say x t and interpolate at x 0,.., x n,t with the polynomial p n1 Ÿx written in Newton form as p n1 Ÿx p n Ÿx f x 0,.., x n,t Ÿx " x 0 Ÿx " x n. Now since p n1 interpolates at x t we have fÿt p n1 Ÿt p n Ÿt f x 0,..,x n,t Ÿt " x 0 Ÿt " x n. Now simply replace t by x on H. Diamond Numerical Analysis Spring
7 both sides and obtain fÿx " p n Ÿx f x 0,..,x n,x Ÿx " x 0 Ÿx " x n and the latter expression can be replaced by 1 Ÿn 1! f Ÿn1 Ÿ8 Ÿx " x 0 Ÿx " x n by the previous theorem. We sometimes say that the remainder in polynomial interpolation is given by 1 Ÿn 1! f Ÿn1 Ÿ8 Ÿx " x 0 Ÿx " x n. This can be estimated in a manner similar to the remainder in Taylor s theorem. H. Diamond Numerical Analysis Spring
derivatives of a function at a point. The formulas will be in terms of function data; in our case
Math 220 Spring 200 Prof. Diamond Approximation of derivatives Here we develop formulas, and accompanying error estimates, for approximating derivatives of a function at a point. The formulas will be in
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 informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationName: Date: Honors Physics
Name: Date: Honors Physics Worksheet on Position, Velocity, and Acceleration Graphs when acceleration is constant Suppose you have an object that moves with a constant acceleration. Your task is to create
More informationPolynomial Interpolation Part II
Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session
More information6x 2 8x + 5 ) = 12x 8. f (x) ) = d (12x 8) = 12
AMS/ECON 11A Class Notes 11/6/17 UCSC *) Higher order derivatives Example. If f = x 3 x + 5x + 1, then f = 6x 8x + 5 Observation: f is also a differentiable function... d f ) = d 6x 8x + 5 ) = 1x 8 dx
More informationA description of a math circle set of activities around polynomials, especially interpolation.
A description of a math circle set of activities around polynomials, especially interpolation. Bob Sachs Department of Mathematical Sciences George Mason University Fairfax, Virginia 22030 rsachs@gmu.edu
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 informationERROR IN LINEAR INTERPOLATION
ERROR IN LINEAR INTERPOLATION Let P 1 (x) be the linear polynomial interpolating f (x) at x 0 and x 1. Assume f (x) is twice continuously differentiable on an interval [a, b] which contains the points
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationLinear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
More informationUniversity of British Columbia Math 307, Final
1 University of British Columbia Math 307, Final April 23, 2012 3.30-6.00pm Name: Student Number: Signature: Instructor: Instructions: 1. No notes, books or calculators are allowed. A MATLAB/Octave formula
More information1) The line has a slope of ) The line passes through (2, 11) and. 6) r(x) = x + 4. From memory match each equation with its graph.
Review Test 2 Math 1314 Name Write an equation of the line satisfying the given conditions. Write the answer in standard form. 1) The line has a slope of - 2 7 and contains the point (3, 1). Use the point-slope
More information6x 2 8x + 5 ) = 12x 8
Example. If f(x) = x 3 4x + 5x + 1, then f (x) = 6x 8x + 5 Observation: f (x) is also a differentiable function... d dx ( f (x) ) = d dx ( 6x 8x + 5 ) = 1x 8 The derivative of f (x) is called the second
More informationEcon Lecture 14. Outline
Econ 204 2010 Lecture 14 Outline 1. Differential Equations and Solutions 2. Existence and Uniqueness of Solutions 3. Autonomous Differential Equations 4. Complex Exponentials 5. Linear Differential Equations
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
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 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 informationLocal Parametrization and Puiseux Expansion
Chapter 9 Local Parametrization and Puiseux Expansion Let us first give an example of what we want to do in this section. Example 9.0.1. Consider the plane algebraic curve C A (C) defined by the equation
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
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 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 informationEVALUATING A POLYNOMIAL
EVALUATING A POLYNOMIAL Consider having a polynomial p(x) = a + a 1 x + a 2 x 2 + + a n x n which you need to evaluate for many values of x. How do you evaluate it? This may seem a strange question, but
More informationReverse engineering using computational algebra
Reverse engineering using computational algebra Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2015 M. Macauley (Clemson)
More informationFunction approximation
Week 9: Monday, Mar 26 Function approximation A common task in scientific computing is to approximate a function. The approximated function might be available only through tabulated data, or it may be
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationINTERPOLATION Background Polynomial Approximation Problem:
INTERPOLATION Background Polynomial Approximation Problem: given f(x) C[a, b], find P n (x) = a 0 + a 1 x + a 2 x 2 + + a n x n with P n (x) close to f(x) for x [a, b]. Motivations: f(x) might be difficult
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 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 informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationLeast-squares data fitting
EE263 Autumn 2015 S. Boyd and S. Lall Least-squares data fitting 1 Least-squares data fitting we are given: functions f 1,..., f n : S R, called regressors or basis functions data or measurements (s i,
More informationCoordinate systems and vectors in three spatial dimensions
PHYS2796 Introduction to Modern Physics (Spring 2015) Notes on Mathematics Prerequisites Jim Napolitano, Department of Physics, Temple University January 7, 2015 This is a brief summary of material on
More informationUNIT-II INTERPOLATION & APPROXIMATION
UNIT-II INTERPOLATION & APPROXIMATION LAGRANGE POLYNAMIAL 1. Find the polynomial by using Lagrange s formula and hence find for : 0 1 2 5 : 2 3 12 147 : 0 1 2 5 : 0 3 12 147 Lagrange s interpolation formula,
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 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 informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationlecture 4: Constructing Finite Difference Formulas
5 lecture 4: Constructing Finite Difference Formulas 17 Application: Interpolants for Finite Difference Formulas The most obvious use of interpolants is to construct polynomial models of more complicated
More informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More information1 Motivation for Newton interpolation
cs412: introduction to numerical analysis 09/30/10 Lecture 7: Newton Interpolation Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Motivation for Newton interpolation
More informationz-transforms 21.1 The z-transform Basics of z-transform Theory z-transforms and Difference Equations 36
Contents 21 z-transforms 21.1 The z-transform 2 21.2 Basics of z-transform Theory 12 21.3 z-transforms and Difference Equations 36 21.4 Engineering Applications of z-transforms 64 21.5 Sampled Functions
More informationMA4001 Engineering Mathematics 1 Lecture 15 Mean Value Theorem Increasing and Decreasing Functions Higher Order Derivatives Implicit Differentiation
MA4001 Engineering Mathematics 1 Lecture 15 Mean Value Theorem Increasing and Decreasing Functions Higher Order Derivatives Implicit Differentiation Dr. Sarah Mitchell Autumn 2014 Rolle s Theorem Theorem
More information100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX
100 CHAPTER 4. SYSTEMS AND ADAPTIVE STEP SIZE METHODS APPENDIX.1 Norms If we have an approximate solution at a given point and we want to calculate the absolute error, then we simply take the magnitude
More informationMATH 246: Chapter 2 Section 8 Motion Justin Wyss-Gallifent
MATH 46: Chapter Section 8 Motion Justin Wyss-Gallifent 1. Introduction Important: Positive is up and negative is down. Imagine a spring hanging with no weight on it. We then attach a mass m which stretches
More informationexact for polynomials of degree two using the following methods: Ÿ0 1 Ÿ0 " 2
Math 0 Homework 4. a) Derive a derivative approximation formula of the form f U Ÿ0 X AfŸ" BfŸ0 CfŸ exact for polynomials of degree two using the following methods: i) Lagrange polynomial interpolation
More information1.2. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy
.. Direction Fields: Graphical Representation of the ODE and its Solution Let us consider a first order differential equation of the form dy = f(x, y). In this section we aim to understand the solution
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 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 informationEE Homework 5 - Solutions
EE054 - Homework 5 - Solutions 1. We know the general result that the -transform of α n 1 u[n] is with 1 α 1 ROC α < < and the -transform of α n 1 u[ n 1] is 1 α 1 with ROC 0 < α. Using this result, the
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationThe Mean Value Theorem. Oct
The Mean Value Theorem Oct 14 2011 The Mean Value Theorem Theorem Suppose that f is defined and continuous on a closed interval [a, b], and suppose that f exists on the open interval (a, b). Then there
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 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 informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationMath101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:
Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the
More informationE.J. Barbeau. Polynomials. With 36 Illustrations. Springer
E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication
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 informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationHermite Interpolation
Jim Lambers MAT 77 Fall Semester 010-11 Lecture Notes These notes correspond to Sections 4 and 5 in the text Hermite Interpolation Suppose that the interpolation points are perturbed so that two neighboring
More informationA General Formula of Polynomial Interpolation. A. C. AITKEN. (Received 2nd March Bead 3rd May 1929.) 1. ENUNCIATION AND PEOOF.
199 A General Formula of Polynomial Interpolation. By A. C. AITKEN. (Received 2nd March 1929. Bead 3rd May 1929.) 1. ENUNCIATION AND PEOOF. The operations 1 of differentiation, ordinary and central differencing,
More informationSection 9.8 Higher Order Linear Equations
Section 9.8 Higher Order Linear Equations Key Terms: Higher order linear equations Equivalent linear systems for higher order equations Companion matrix Characteristic polynomial and equation A linear
More informationLecture 3: Tropicalizations of Cluster Algebras Examples David Speyer
Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by
More informationApproximation, Taylor Polynomials, and Derivatives
Approximation, Taylor Polynomials, and Derivatives Derivatives for functions f : R n R will be central to much of Econ 501A, 501B, and 520 and also to most of what you ll do as professional economists.
More informationStat 206: Linear algebra
Stat 206: Linear algebra James Johndrow (adapted from Iain Johnstone s notes) 2016-11-02 Vectors We have already been working with vectors, but let s review a few more concepts. The inner product of two
More informationNotice the minus sign on the adder: it indicates that the lower input is subtracted rather than added.
6.003 Homework Due at the beginning of recitation on Wednesday, February 17, 010. Problems 1. Black s Equation Consider the general form of a feedback problem: + F G Notice the minus sign on the adder:
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationAssignments VIII and IX, PHYS 301 (Classical Mechanics) Spring 2014 Due 3/21/14 at start of class
Assignments VIII and IX, PHYS 301 (Classical Mechanics) Spring 2014 Due 3/21/14 at start of class Homeworks VIII and IX both center on Lagrangian mechanics and involve many of the same skills. Therefore,
More informationChapter 2 Formulas and Definitions:
Chapter 2 Formulas and Definitions: (from 2.1) Definition of Polynomial Function: Let n be a nonnegative integer and let a n,a n 1,...,a 2,a 1,a 0 be real numbers with a n 0. The function given by f (x)
More informationNumerical Mathematics & Computing, 7 Ed. 4.1 Interpolation
Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 November 7, 2011 2011 1 /
More informationLecture 6. Regularized least-squares and minimum-norm methods 6 1
Regularized least-squares and minimum-norm methods 6 1 Lecture 6 Regularized least-squares and minimum-norm methods EE263 Autumn 2004 multi-objective least-squares regularized least-squares nonlinear least-squares
More informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More information1. Find the domain of the following functions. Write your answer using interval notation. (9 pts.)
MATH- Sample Eam Spring 7. Find the domain of the following functions. Write your answer using interval notation. (9 pts.) a. 9 f ( ) b. g ( ) 9 8 8. Write the equation of the circle in standard form given
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 informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
More informationOrdinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
More informationMAT137 Calculus! Lecture 48
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 48 Today: Taylor Series Applications Next: Final Exams Important Taylor Series and their Radii of Convergence 1 1 x = e x = n=0 n=0 x n n!
More informationSection 5.2 Series Solution Near Ordinary Point
DE Section 5.2 Series Solution Near Ordinary Point Page 1 of 5 Section 5.2 Series Solution Near Ordinary Point We are interested in second order homogeneous linear differential equations with variable
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More information446 CHAP. 8 NUMERICAL OPTIMIZATION. Newton's Search for a Minimum of f(x,y) Newton s Method
446 CHAP. 8 NUMERICAL OPTIMIZATION Newton's Search for a Minimum of f(xy) Newton s Method The quadratic approximation method of Section 8.1 generated a sequence of seconddegree Lagrange polynomials. It
More informationDiscrete (Difference) Equations
Discrete (Difference) Equations A discrete, or difference, equation expresses a relationship between the elements of a sequence, {y n }, where n N 0 {0, 1, 2,...}. For example, the trivial difference equation
More informationPython Analysis. PHYS 224 October 1/2, 2015
Python Analysis PHYS 224 October 1/2, 2015 Goals Two things to teach in this lecture 1. How to use python to fit data 2. How to interpret what python gives you Some references: http://nbviewer.ipython.org/url/media.usm.maine.edu/~pauln/
More informationProblem 1. Possible Solution. Let f be the 2π-periodic functions defined by f(x) = cos ( )
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
More informationReview 1 Math 321: Linear Algebra Spring 2010
Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics
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 informationChapter 4: Numerical Methods for Common Mathematical Problems
1 Capter 4: Numerical Metods for Common Matematical Problems Interpolation Problem: Suppose we ave data defined at a discrete set of points (x i, y i ), i = 0, 1,..., N. Often it is useful to ave a smoot
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 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 informationES.1803 Topic 7 Notes Jeremy Orloff. 7 Solving linear DEs; Method of undetermined coefficients
ES.1803 Topic 7 Notes Jeremy Orloff 7 Solving linear DEs; Method of undetermined coefficients 7.1 Goals 1. Be able to solve a linear differential equation by superpositioning a particular solution with
More informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationDynamical Systems. August 13, 2013
Dynamical Systems Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 Dynamical Systems are systems, described by one or more equations, that evolve over time.
More informationCOSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods
COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationSection 1.6. M N = [a ij b ij ], (1.6.2)
The Calculus of Functions of Several Variables Section 16 Operations with Matrices In the previous section we saw the important connection between linear functions and matrices In this section we will
More information5-6 The Remainder and Factor Theorems
Use synthetic substitution to find f (4) and f ( 2) for each function. 1. f (x) = 2x 3 5x 2 x + 14 58; 20 2. f (x) = x 4 + 8x 3 + x 2 4x 10 758; 46 3. NATURE The approximate number of bald eagle nesting
More informationThen, Lagrange s interpolation formula is. 2. What is the Lagrange s interpolation formula to find, if three sets of values. are given.
SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY, COIMBATORE- 10 DEPARTMENT OF SCIENCE AND HUMANITIES SUBJECT NUMERICAL METHODS & LINEAR PROGRAMMING ( SEMESTER IV ) IV- INTERPOLATION, NUMERICAL DIFFERENTIATION
More informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationChapter 6: Work and Kinetic Energy
Chapter 6: Work and Kinetic Energy Suppose you want to find the final velocity of an object being acted on by a variable force. Newton s 2 nd law gives the differential equation (for 1D motion) dv dt =
More informationMB4018 Differential equations
MB4018 Differential equations Part II http://www.staff.ul.ie/natalia/mb4018.html Prof. Natalia Kopteva Spring 2015 MB4018 (Spring 2015) Differential equations Part II 0 / 69 Section 1 Second-Order Linear
More informationx(t + t) = x(t) + Ix(t) t.
6 2. Modeling by first order linear ODEs 2.1. The savings account model. Modeling a savings account gives a good way to visualize the significance of many of the features of a general first order linear
More information