Lectures 9-10: Polynomial and piecewise polynomial interpolation

Size: px
Start display at page:

Download "Lectures 9-10: Polynomial and piecewise polynomial interpolation"

Transcription

1 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 = 1,,,n For instance, we may have obtained these values through measurements and now would like to determine f(x) for other values of x Example 91: Assume that you need to evaluate cos(π/6), but the trigonometric function-key on your calculator is broken and you do not have access to a computer You do remember that cos() = 1, cos(π/4) = 1/, and cos(π/) = How can we use this information about the cosine function to determine an approximation of cos(π/6) Example 9: Let x represent time (in hours) and f(x) be the amount of rain falling at time x Assume that f(x) is measured once an hour at a weather station We would like to determine the total amount of rain fallen during a 4-hour period, ie, we would like to compute 4 f(x)dx How can we determine an estimate of this integral? Example 9: Let f(x) represent the position of a car at time x and assume that we know f(x) at the times x 1, x,,x n How can we determine the velocity at time x? Can we also find out the acceleration? Interpolation by polynomials or piecewise polynomials provide approaches to solving the problems in the above examples We first discuss polynomial interpolation and then turn to interpolation by piecewise polynomials 1 Polynomial interpolation Given n distinct nodes x 1, x,, x n and associated function values y 1, y,,y n, determine the polynomial p(x) of degree at most n 1, such that p(x j ) = y j, j = 1,,,n (1) The polynomial is said to interpolate the values y j at the nodes x j, and is referred to as the interpolating polynomial Example 94: Let n = Then the interpolating polynomial is linear and is given by p(x) = y 1 + y y 1 x x 1 (x x 1 ) Example 91 cont d: We may seek to approximate cos(π/6) by first determining the polynomial p of degree at most, which interpolates cos(x) at x =, x = π/4, and x = π/, and the evaluate p(π/6) Before dwelling more on applications of interpolating polynomials, we have to establish that they exist and are unique We also will consider several representations of the interpolating polynomial, starting with the power form p(x) = a 1 + a x + a x + + a n x () This is a polynomial of degree at most n 1 We would like to determine the coefficients a j, which multiply powers of x, so that the conditions (1) are satisfied This gives the equations a 1 + a x j + a x j + + a nx j = y j, j = 1,,, n, 1

2 which we can be expressed in matrix form, 1 x 1 x 1 x1 n x1 1 x x x n x 1 x x x n 1 x n x n x n n x xn a 1 a a a n = y 1 y y y n () The above matrix is known as a Vandermonde matrix It is nonsingular when the nodes x j are distinct For instance, when n =, we have [ ] 1 x1 det = x 1 x x 1 Below we will be able to conclude that Vandermonde matrices with distinct nodes are nonsingular without evaluating their determinants The representation of a polynomial p(x) in terms of the powers of x, like in (), is convenient for many applications, because this representation easily can be integrated or differentiated However, Vandermonde matrices generally are severely ill-conditioned This is illustrated in Exercise 9 When the function values y j are obtained by measurements, and therefore are contaminated by measurement errors, the ill-conditioning implies that the computed coefficients a j may differ significantly from the coefficients that would have been obtained with error-free data Moreover, round-off errors introduced during the solution of the linear system of equations () also can give rise to a large propagated error in the computed coefficients We are therefore interested in investigating other polynomial bases than the power basis The Newton basis for polynomials of degree n 1 is given by 1, x x 1, (x x 1 )(x x ),, (x x j ) We seek to determine the interpolating polynomial in the form p(x) = a 1 + a (x x 1 ) + a (x x 1 )(x x ) + + a n (x x j ) (4) The interpolation conditions (1) give the linear system of equations 1 1 x x 1 1 x x 1 (x x 1)(x x ) 6 Q 4 1 x x 1 (x x 1)(x x ) n (x xj) Q 1 x n x 1 (x n x 1)(x n x ) n (xn xj) Q (xn xj) a 1 a a a n = y 1 y y y n 5 with a lower triangular matrix We refer to these equations as the Newton equations The matrices in the Newton equations have smaller condition number than the corresponding Vandermonde matrices; cf Exercise 9 The Newton form (4) of the interpolation polynomial is quite easy to use for hand computations For instance, Example 94 uses this representation

3 Example 95: Consider the situation when we have determined the interpolation of Example 94 and would like to add another data point {x, y } Thus, we would like to compute the polynomial of degree at most that interpolates the data points {x j, y j}, j = 1,, The desired interpolation polynomial is obtained by adding a quadratic term to the polynomial of Example 94, p(x) = y 1 + y y1 x x 1 (x x 1) + a (x x 1)(x x ) (5) This polynomial satisfies the interpolation conditions of p(x j) = y j for j = 1, for any coefficient a This coefficient is determined by the interpolation condition p(x ) = y Let a = Substituting x = x into (5) then yields the expression a = y y1 x x 1 y y1 a(x x1) (x x 1)(x x ) These computations amount to one step of forward substitution in the solution of the Newton equations The determinant of a lower triangular matrix is the product of its diagonal entries These are all nonvanishing in the Newton equation matrix when the nodes x j are distinct Hence the matrix is nonsingular when the nodes are distinct This shows that the coefficients in the Newton form are uniquely determined by the interpolation conditions (1) We conclude that the polynomial interpolation problem has a unique solution when the polynomial is expressed in Newton form Given a polynomial in Newton form, we may express it in power form The transformation to power form is unique Thus, the interpolation conditions (1) also determine the interpolating polynomial in power form uniquely It follows that the Vandermonde matrix in () is nonsingular when the nodes are distinct (If the matrix were singular, then the interpolating polynomial either would not be unique or would not exist) The last polynomial basis we consider are Lagrange polynomials l k (x) = ny j k These polynomials are of degree n 1 and satisfy x x j x k x j, k = 1,,, n l k (x j) = j 1, k = j,, k j (6) Consider the interpolation polynomial expressed in Lagrange form, p(x) = The interpolation conditions (1) become l 1(x 1) l (x 1) l (x 1) l n(x 1) l 1(x ) l (x ) l (x ) l n(x ) l 1(x ) l (x ) l (x ) l n(x ) 5 4 l 1(x n) l (x n) l (x n) l n(x n) nx a k l k (x) () k=1 a 1 a a a n = y 1 y y y n (8) 5 Using the property (6), we see that the matrix reduces to the identity matrix and it follows that the coefficients a k in () are given by a k = y k, k = 1,,, n

4 Thus, no linear system of equations has to be solved in order to determine the Lagrange form of the interpolation polynomial The only drawback of the the representation () is that it is somewhat cumbersome to evaluate Recall that the identity matrix has condition number 1, which is minimal Let the nodes x j be distinct and live in the real interval [a, b], and let f(x) be a function, which is n times differentiable in [a, b] Let f (n) (x) denote the nth derivative Assume that y j = f(x j), j = 1,,, n Then the difference f(x) p(x) can be expressed as f(x) p(x) = ny (x x j) f(n) (ξ), (9) n! where ξ is a function of x 1, x,, x n and x The exact value of ξ is difficult to pin down, however, it is known that ξ is in the interval [a, b] when x and x 1, x,, x n are there One can derive the expression by using a variant of the mean-value theorem from Calculus We will not prove the error-formula (9) in this course Instead, we will use the formula to learn about some properties of the polynomial interpolation problem Usually, the nth derivative of f is not available and only the product over the interpolation points can be studied easily It is remarkable how much useful information can be gained by investigating this product First we note that the interpolation error max a x b f(x) p(x) is likely to be larger when the interval [a, b] is long than when it is short We can see this by doubling the size of the interval, ie, we multiply a, b, x and the x j by Then the product in the right-hand side of (9) is replaced by ny Y n (x x j) = n (x x j), which shows that the interpolation error might be multiplied by n when doubling the size of the interval Actual computations show that, indeed, the error typically increases with the length of the interval when other relevant quantities are not changed The error-formula (9) also raises the question how the interpolation points should be distributed in the interval [a, b] in order to give a small error max a x b f(x) p(x) For instance, we may want to choose interpolation points x j that solve the minimization problem min x j max a x b ny x x j (1) This fairly complicated problem turns out to have a simple solution! Let for the moment a = 1 and b = 1 Then the solution is given by «j 1 x j = cos n π, j = 1,,, n (11) These points are the projection of n equidistant points on the upper half of the unit circle onto the x-axis; see Figure 1 For intervals with endpoints a < b, the solution of (1) is given by x j = 1 (b + a) + 1 «j 1 (b a)cos n π, j = 1,,, n (1) Finally, the presence of a high-order derivative in the error-formula (9) suggests that interpolation polynomials are likely to give small approximation errors when the function has many continuous derivatives that are not very large in magnitude In the next subsection, we will discuss a modification of polynomial interpolation, that can work better when the function to be approximated does not have many (or any) continuous derivatives that can give better approximations 4

5 Figure 1: Upper half of the unit circle with 8 equidistant points marked in red, and their projection onto the x-axis marked in magenta The latter are, from left to right, the points x 1, x,, x 8 defined by (11) for n = Table 1: Grind size (Left-hand side column) versus pressure (right-hand side column) Exercises Exercise 91: Solve the interpolation problem of Example 91 Exercise 9: Let V n be an n n Vandermonde matrix determined by n equidistant nodes in the interval [ 1, 1] How quickly does the condition number of V n grow with n? Linearly, quadratically, cubically,, exponentially? Use the MATLAB or Octave functions vander and cond Determine the growth experimentally Describe how you designed the experiments Show your MATLAB or Octave codes and relevant input and output Exercise 9: Let L n be an n n lower triangular matrix determined Newton interpolation at n equidistant nodes in the interval [ 1, 1] How do the condition numbers of L n and V n compare? How quickly does the condition number of L n grow with n? Determine the growth experimentally Show your MATLAB or Octave codes and relevant input and output Exercise 94: The pressure in a fully automatic espresso machine varies with size of the coffee grinds The pressure is measured in bar and the grind size in units, where 1 signifies a coarse grind and 5 a fine one The relation is tabulated in Table 1 (a) Determine by linear interpolation, which pressure grind size 1 gives rise to Which data should be used? (b) Determine by quadratic interpolation, which pressure grind size 1 gives rise to Which data should be used? Are the results for linear and quadratic interpolation close? 5

6 Table : n and Γ(n) Exercise 95: The Γ-function is defined by Γ(x) = Z t x 1 e t dt Direct evaluation of the integral yields Γ(1) = 1 and integration by parts shows that Γ(x + 1) = xγ(x) In particular, for integer-values n > 1, we obtain that Γ(n + 1) = nγ(n) and therefore Γ(n + 1) = n(n 1)(n ) 1 We would like to determine an estimate of Γ(45) using the tabulated values of Table (a) Determine the actual value of Γ(45) by interpolation by in and 5 nodes Which nodes should be used? Determine the actual value of Γ(45) Are the computed approximations close? Which one is more accurate (b) Also, investigate the following approach Instead of interpolating Γ(x), interpolate ln(γ(x)) by polynomials at and 5 nodes Evaluate the computed polynomial at 45 and exponentiate How do the computed approximations in (a) and (b) compare? Explain! Exercise 96: (a) Interpolate the function f(x) = e x at equidistant nodes in [ 1,1] This gives an interpolation polynomial p of degree at most 19 Measure the approximation error f(x) p(x) by measure the difference at 5 equidistant nodes t j in [ 1,1] We refer to the quantity max f(tj) p(tj) t j,,,5 as the error Compute the error (b) Repeat the above computations with the function f(x) = e x /(1 5x ) Plot p(t j) f(t j), j = 1,,, 5 Where in the interval [ 1, 1] is the error the largest? (c) Repeat the computations in (a) using Chebyshev points (11) as interpolation points How do the errors compare for equidistant and Chebyshev points? Plot the error (d) Repeat the computations in (b) using Chebyshev points (11) as interpolation points How do the errors compare for equidistant and Chebyshev points? Exercise 9: Compute an approximation of the integral Z 1 xexp(x )dx by first interpolating the integrand by a rd degree polynomial and then integrating the polynomial Which representation of the polynomial is most convenient to use? Specify which interpolation points you use Exercise 98: The function f(t) gives the position of a ball at time t Table displays a few values of f and t Interpolate f by a quadratic polynomial and estimate the velocity and acceleration of the ball at time t = 1 6

7 1 1 6 Table : t and f(t) Interpolation by piecewise polynomials In the above subsection, we sought to determine one polynomial that approximates a function on a specified interval This works well if either one of the following conditions hold: The polynomial required to achieve desired accuracy is of fairly low degree The function has a few continuous derivatives and interpolation can be carried out at the Chebyshev points (11) or (1) A quite natural and different approach to approximate a function on an interval is to first split the interval into subintervals and then approximate the function by a polynomial of fairly low degree on each subinterval Example 96: We would like to approximate a function on the interval [ 1,1] Let the function values y j = f(x j) be available, where x 1 = 1, x =, x = 1, and y 1 = y =, y = 1 It is easy to approximate f(x) by a linear function on each subinterval [x 1, x ] and [x, x ] We obtain p(x) = y 1 + p(x) = y + y y1 x x 1 (x x 1) = x + 1, 1 x, y y x x (x x ) = 1 x, x 1 The MATLAB command plot([-1,,1],[,1,]) gives the continuous graph of Figure This is a piecewise linear approximation of the unknown function f(x) If f(x) indeed is a piecewise linear function with a kink at x =, then the computed approximation is appropriate, On the other hand, if f(x) displays the trajectory of a baseball, then the smoother function p(x) = 1 x, which is depicted by the dashed curve, may be a more suitable approximation of f(x), since baseball trajectories do not exhibit kinks - even if some players occasionally may wish they do Piecewise linear functions give better approximations of a smooth function if more interpolation points {x j, y j} are used We can increase the accuracy of the approximation by reducing the lengths of the subintervals We conclude that piecewise linear approximations of functions are easy to compute These approximations display kinks Many interpolation points may be required to determine a piecewise linear approximant of desired accuracy The benefits of piecewise linear approximation is the ease of the computations on each subinterval There are several ways to modify piecewise linear functions to give them a more pleasing look Here we will discuss how to use derivative information to obtain smoother approximants A different approach, which uses Bézier curves is described in the next lecture Assume that not only the function values y j = f(x j), but also the derivative values y j = f (x j), are available at the nodes a x 1 < x < < x n b We can then on each subinterval, say [x j, x j+1], approximate f(x) by a polynomial that interpolates both f(x) and f (x) at the endpoints Thus, we would like to determine a polynomial p j(x), such that p j(x j) = y j, p j(x j+1) = y j+1, p j(x j) = y j, p j(x j+1) = y j+1 (1) These are 4 conditions, and we seek to determine a polynomial of degree, p j(x) = a 1 + a x + a x + a 4x, (14)

8 Figure : Example 96: Quadratic polynomial p(x) = 1 x (red dashed graph) and piecewise linear approximation (continuous blue graph) which satisfies these conditions Our reason for choosing a polynomial of degree is that it has 4 coefficients, one for each condition Substituting the polynomial (14) into the conditions (1) gives the linear system of equations, 1 x j x j x j a 1 y j 6 1 x j+1 x j+1 x j+1 6 a 4 1 x j x 5 4 j a 5 = 6 y j+1 4 y 5 (15) 1 x j+1 x j j+1 a 4 y j+1 The last rows impose interpolation of the derivative values The matrix can be shown to be nonsingular when x j x j+1 The polynomials p 1(x),p (x),, p (x) provide a piecewise cubic polynomial approximation of f(x) on the whole interval [a, b] They can be computed independently and yield an approximation with a continuous derivative on [a, b] The latter can be seen as follows: The polynomial p j is defined and differentiable on the interval [x j, x j+1] for j = 1,,, n 1 What remains to be established is that our approximant also has a continuous derivative at the interpolation points This, however, follows from the interpolation conditions (1) We have that lim xրx j+1 p j(x) = p j(x j+1) = y j+1, lim xցx j+1 p j+1(x) = p j+1(x j+1) = y j+1 The existence of the limit follows from the continuity of each polynomial on the interval where it is defined, and the other equalities are the interpolation conditions Thus, p j(x j+1) = p j+1(x j+1), which shows the continuity of the derivative at x j+1 of our piecewise cubic polynomial approximant The use of piecewise cubic polynomials as described gives attractive approximations However, the approach discussed requires derivative information be available When no derivative information is explicitly known, modifications of the scheme outlined can be used A simple modification is to use estimates the derivative-values of the function f(x) at the nodes; see Exercise 91 Another possibility is to impose the conditions p j(x j) = y j, p j(x j+1) = y j+1, p j(x j) = p j 1(x j), p j (x j) = p j 1(x j), for j =,,, Thus, at the subinterval boundaries at x x,, x we require the piecewise cubic polynomial to have continuous first and second derivatives However, these derivatives are not required to take on prescibed 8

9 values The piecewise cubic polynomials obtained in the manner are known as splines They are popular design tools in industry Their determination requires the solution of a linear system of equations, which is somewhat complicated to derive We will therefore omit its derivation Also, extra conditions at the interval endpoints have to be imposed in order to make the linear system of solvable with a unique solution Exercise 99: Consider the function in Example 96 Assume that we also know the derivative values y 1 =, y =, and y = Determine a piecewise polynomial approximation on [ 1, 1] by using the interpolation conditions (1) Plot the resulting function Exercise 91: Assume the derivative values in the above exercise are not available How can one determine estimates of these values? Use these estimates in the interpolation conditions (1) and compute a piecewise cubic approximation How does it compare with the one from Exercise 99 and with the piecewise linear approximation of Example 96 Exercise 911: Compute a spline approximant, eg, by using the function spline in MATLAB or Octave 9

Chapter 4: Interpolation and Approximation. October 28, 2005

Chapter 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 information

We consider the problem of finding a polynomial that interpolates a given set of values:

We 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 information

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation

CS 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 information

Scientific Computing

Scientific 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 information

INTERPOLATION. 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. 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 information

BSM510 Numerical Analysis

BSM510 Numerical Analysis BSM510 Numerical Analysis Polynomial Interpolation Prof. Manar Mohaisen Department of EEC Engineering Review of Precedent Lecture Polynomial Regression Multiple Linear Regression Nonlinear Regression Lecture

More information

Interpolation Theory

Interpolation 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 information

1 Piecewise Cubic Interpolation

1 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 information

Lecture 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 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 information

1 Review of Interpolation using Cubic Splines

1 Review of Interpolation using Cubic Splines cs412: introduction to numerical analysis 10/10/06 Lecture 12: Instructor: Professor Amos Ron Cubic Hermite Spline Interpolation Scribes: Yunpeng Li, Mark Cowlishaw 1 Review of Interpolation using Cubic

More information

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

x 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 information

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).

(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 information

Scientific Computing: An Introductory Survey

Scientific 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 information

Cubic Splines; Bézier Curves

Cubic 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 information

Lecture 10 Polynomial interpolation

Lecture 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 information

you 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

you 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 information

Outline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation

Outline. 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

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

LECTURE 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 information

Department 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 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 information

CHAPTER 4. Interpolation

CHAPTER 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 information

Lecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University

Lecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2

More information

Numerical Analysis: Interpolation Part 1

Numerical 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 information

Empirical Models Interpolation Polynomial Models

Empirical Models Interpolation Polynomial Models Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained

More information

Math Numerical Analysis Mid-Term Test Solutions

Math Numerical Analysis Mid-Term Test Solutions Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)

More information

Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning

Interpolation. 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 information

MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs

MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and

More information

Homework and Computer Problems for Math*2130 (W17).

Homework 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 information

3.1 Interpolation and the Lagrange Polynomial

3.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 information

Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation

Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation See your notes. 1. Lagrange Interpolation (8.2) 1 2. Newton Interpolation (8.3) different form of the same polynomial as Lagrange

More information

1 Lecture 8: Interpolating polynomials.

1 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 information

MA2501 Numerical Methods Spring 2015

MA2501 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 information

Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation

Numerical 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 information

Lecture 9: Elementary Matrices

Lecture 9: Elementary Matrices Lecture 9: Elementary Matrices Review of Row Reduced Echelon Form Consider the matrix A and the vector b defined as follows: 1 2 1 A b 3 8 5 A common technique to solve linear equations of the form Ax

More information

Ma 530 Power Series II

Ma 530 Power Series II Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series

More information

Exam 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: 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 information

Chapter 2: Differentiation

Chapter 2: Differentiation Chapter 2: Differentiation Spring 2018 Department of Mathematics Hong Kong Baptist University 1 / 82 2.1 Tangent Lines and Their Slopes This section deals with the problem of finding a straight line L

More information

MATH ASSIGNMENT 07 SOLUTIONS. 8.1 Following is census data showing the population of the US between 1900 and 2000:

MATH ASSIGNMENT 07 SOLUTIONS. 8.1 Following is census data showing the population of the US between 1900 and 2000: MATH4414.01 ASSIGNMENT 07 SOLUTIONS 8.1 Following is census data showing the population of the US between 1900 and 2000: Years after 1900 Population in millions 0 76.0 20 105.7 40 131.7 60 179.3 80 226.5

More information

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2. MAT 1332: CALCULUS FOR LIFE SCIENCES JING LI Contents 1 Review: Linear Algebra II Vectors and matrices 1 11 Definition 1 12 Operations 1 2 Linear Algebra III Inverses and Determinants 1 21 Inverse Matrices

More information

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

(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 information

Inverses. Stephen Boyd. EE103 Stanford University. October 28, 2017

Inverses. 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 information

Math Numerical Analysis

Math 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 information

Numerical Methods of Approximation

Numerical Methods of Approximation Contents 31 Numerical Methods of Approximation 31.1 Polynomial Approximations 2 31.2 Numerical Integration 28 31.3 Numerical Differentiation 58 31.4 Nonlinear Equations 67 Learning outcomes In this Workbook

More information

Mathematics for Engineers. Numerical mathematics

Mathematics for Engineers. Numerical mathematics Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set

More information

8.5 Taylor Polynomials and Taylor Series

8.5 Taylor Polynomials and Taylor Series 8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:

More information

Applied Numerical Analysis Homework #3

Applied Numerical Analysis Homework #3 Applied Numerical Analysis Homework #3 Interpolation: Splines, Multiple dimensions, Radial Bases, Least-Squares Splines Question Consider a cubic spline interpolation of a set of data points, and derivatives

More information

The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods

The 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 information

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

Numerical 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 information

CHAPTER 10 Shape Preserving Properties of B-splines

CHAPTER 10 Shape Preserving Properties of B-splines CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially

More information

University of Houston, Department of Mathematics Numerical Analysis, Fall 2005

University 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 information

Cubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines

Cubic 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 information

Chapter 2: Differentiation

Chapter 2: Differentiation Chapter 2: Differentiation Winter 2016 Department of Mathematics Hong Kong Baptist University 1 / 75 2.1 Tangent Lines and Their Slopes This section deals with the problem of finding a straight line L

More information

Numerical Methods. King Saud University

Numerical 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 information

Fixed point iteration and root finding

Fixed 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 information

Review I: Interpolation

Review I: Interpolation Review I: Interpolation Varun Shankar January, 206 Introduction In this document, we review interpolation by polynomials. Unlike many reviews, we will not stop there: we will discuss how to differentiate

More information

Maria Cameron Theoretical foundations. Let. be a partition of the interval [a, b].

Maria Cameron Theoretical foundations. Let. be a partition of the interval [a, b]. Maria Cameron 1 Interpolation by spline functions Spline functions yield smooth interpolation curves that are less likely to exhibit the large oscillations characteristic for high degree polynomials Splines

More information

Sec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h

Sec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h 1 Sec 4.1 Limits, Informally When we calculated f (x), we first started with the difference quotient f(x + h) f(x) h and made h small. In other words, f (x) is the number f(x+h) f(x) approaches as h gets

More information

Interpolation and Approximation

Interpolation 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 information

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45

Two 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 information

Lecture 6. Numerical methods. Approximation of functions

Lecture 6. Numerical methods. Approximation of functions Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation

More information

5 Numerical Integration & Dierentiation

5 Numerical Integration & Dierentiation 5 Numerical Integration & Dierentiation Department of Mathematics & Statistics ASU Outline of Chapter 5 1 The Trapezoidal and Simpson Rules 2 Error Formulas 3 Gaussian Numerical Integration 4 Numerical

More information

Chapter 1 Numerical approximation of data : interpolation, least squares method

Chapter 1 Numerical approximation of data : interpolation, least squares method Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated

More information

Approximation theory

Approximation theory Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

Introduction Linear system Nonlinear equation Interpolation

Introduction Linear system Nonlinear equation Interpolation Interpolation Interpolation is the process of estimating an intermediate value from a set of discrete or tabulated values. Suppose we have the following tabulated values: y y 0 y 1 y 2?? y 3 y 4 y 5 x

More information

Outline. 1 Numerical Integration. 2 Numerical Differentiation. 3 Richardson Extrapolation

Outline. 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 information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors

More information

Computational Physics

Computational 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 information

Integration, differentiation, and root finding. Phys 420/580 Lecture 7

Integration, 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 information

Applied Math 205. Full office hour schedule:

Applied 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 information

Function approximation

Function 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 information

LEAST SQUARES APPROXIMATION

LEAST 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 information

11.10a Taylor and Maclaurin Series

11.10a Taylor and Maclaurin Series 11.10a 1 11.10a Taylor and Maclaurin Series Let y = f(x) be a differentiable function at x = a. In first semester calculus we saw that (1) f(x) f(a)+f (a)(x a), for all x near a The right-hand side of

More information

Lösning: Tenta Numerical Analysis för D, L. FMN011,

Lö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 information

Interpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34

Interpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34 Interpolation Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34 Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial

More information

Numerical Methods I: Polynomial Interpolation

Numerical Methods I: Polynomial Interpolation 1/31 Numerical Methods I: Polynomial Interpolation Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 16, 2017 lassical polynomial interpolation Given f i := f(t i ), i =0,...,n, we would

More information

Numerical Methods for Differential Equations Mathematical and Computational Tools

Numerical 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 information

Math 3191 Applied Linear Algebra

Math 3191 Applied Linear Algebra Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful

More information

Applied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight

Applied 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 information

Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?

Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2? Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation

More information

CS 257: Numerical Methods

CS 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 information

CHAPTER 3 Further properties of splines and B-splines

CHAPTER 3 Further properties of splines and B-splines CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions

More information

Numerical Integration (Quadrature) Another application for our interpolation tools!

Numerical 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 information

i x i y i

i x i y i Department of Mathematics MTL107: Numerical Methods and Computations Exercise Set 8: Approximation-Linear Least Squares Polynomial approximation, Chebyshev Polynomial approximation. 1. Compute the linear

More information

November 20, Interpolation, Extrapolation & Polynomial Approximation

November 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 information

Math 365 Homework 5 Due April 6, 2018 Grady Wright

Math 365 Homework 5 Due April 6, 2018 Grady Wright Math 365 Homework 5 Due April 6, 018 Grady Wright 1. (Polynomial interpolation, 10pts) Consider the following three samples of some function f(x): x f(x) -1/ -1 1 1 1/ (a) Determine the unique second degree

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

LEAST SQUARES DATA FITTING

LEAST SQUARES DATA FITTING LEAST SQUARES DATA FITTING Experiments generally have error or uncertainty in measuring their outcome. Error can be human error, but it is more usually due to inherent limitations in the equipment being

More information

Relevant sections from AMATH 351 Course Notes (Wainwright): Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls):

Relevant sections from AMATH 351 Course Notes (Wainwright): Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls): Lecture 5 Series solutions to DEs Relevant sections from AMATH 35 Course Notes (Wainwright):.4. Relevant sections from AMATH 35 Course Notes (Poulin and Ingalls): 2.-2.3 As mentioned earlier in this course,

More information

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C. Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES We have: Seen how to interpret derivatives as slopes and rates of change Seen how to estimate derivatives of functions given by tables of values Learned how

More information

Interpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter

Interpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3

More information

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes

n 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 information

MATH 1902: Mathematics for the Physical Sciences I

MATH 1902: Mathematics for the Physical Sciences I MATH 1902: Mathematics for the Physical Sciences I Dr Dana Mackey School of Mathematical Sciences Room A305 A Email: Dana.Mackey@dit.ie Dana Mackey (DIT) MATH 1902 1 / 46 Module content/assessment Functions

More information

Algebraic. techniques1

Algebraic. techniques1 techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them

More information

Curve Fitting and Interpolation

Curve 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 information

Numerical Analysis Exam with Solutions

Numerical Analysis Exam with Solutions Numerical Analysis Exam with Solutions Richard T. Bumby Fall 000 June 13, 001 You are expected to have books, notes and calculators available, but computers of telephones are not to be used during the

More information

MATH 350: Introduction to Computational Mathematics

MATH 350: Introduction to Computational Mathematics MATH 350: Introduction to Computational Mathematics Chapter V: Least Squares Problems Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu MATH

More information

Chapter 3 Interpolation and Polynomial Approximation

Chapter 3 Interpolation and Polynomial Approximation Chapter 3 Interpolation and Polynomial Approximation Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Polynomial Interpolation

More information

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

2tdt 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 information

Polynomial Interpolation Part II

Polynomial 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 information