Newton's forward interpolation formula

Size: px
Start display at page:

Download "Newton's forward interpolation formula"

Transcription

1 Newton's Interpolation Formulae Interpolation is the process of approximating a given function, whose values are known at N + 1 tabular points, by a suitable polynomial, P N (x) of degree N which takes the values y k at x = x k for k = 0, 1, 2,, N. Note that if the given data has errors, it will also be reflected in the polynomial so obtained. In the following, we shall use forward and backward differences to obtain polynomial function approximating y = f(x) when the tabular points x k 's are equally spaced. That is x k x k 1 = h. Newton's forward interpolation formula Let where the polynomial P N (x)is given in the following form: f(x) = P N (x) P N (x) = a 0 + a 1 (x x 0 ) + a 2 (x x 0 )(x x 1 ) + + a k (x x 0 ) (x x k 1 ) + + a N (x x 0 ) (x x N 1 ).. (1) for some constants a 0, a 1,, a N to be determined using the fact that P N (x k ) = y k for k = 0, 1, 2,, N So, for k = 0 substitute x = x 0 in (1) to get P N (x 0 ) = y 0 This gives us a 0 = y 0. Next, for k = 1 substitute x = x 1 in (1), P N (x 1 ) = y 1

2 Thus y 1 = a 0 + a 1 (x 1 x 0 ) = y 0 + a 1 h Next, for k = 2 substitute x = x 2 in (1), a 1 = y 1 y 0 h = y 0 h P N (x 2 ) = y 2 y 2 = a 0 + a 1 (x 2 x 0 ) + a 2 (x 2 x 0 )(x 2 x 1 ) = y 0 + 2a 1 h + a 2 (2h)(h) 2h 2 a 2 = y 2 y 0 2a 1 h = y 2 y 0 2h ( y 0 h ) = y 2 y 0 2 y 0 = y 2 y 0 2(y 1 y 0 ) = y 2 2y 1 + y 0 a 2 = y 2 2y 1 + y 0 2h 2 = 2 y 0 2h 2 a 2 = 2 y 0 2h 2 Now, using mathematical induction, we get

3 a k = k y 0 k! h k Thus, P N (x) = a 0 + a 1 (x x 0 ) + a 2 (x x 0 )(x x 1 ) + + a k (x x 0 ) (x x k 1 ) + + a N (x x 0 ) (x x N 1 ) P N (x) = y 0 + y 0 h (x x 0) + 2 y 0 2h 2 (x x 0)(x x 1 ) + + k y 0 k! h k (x x 0) (x x k 1 ) + + N y 0 N! h N (x x 0) (x x N 1 ).. (2) As this uses the forward differences, it is called NEWTON'S FORWARD DIFFERENCE FORMULA for interpolation, or simply, forward interpolation formula. For calculation purpose, we simplify the formula (2) as done below. Now if we define Then So x p x 0 h = p x p x 0 = ph (x p x 0 )(x p x 1 ) = (x p x 0 )(x p x 0 h) = (ph)(ph h) = h 2 p(p 1)

4 And (x p x 0 )(x p x 1 ) h 2 = p(p 1) (x p x 0 )(x p x 1 ) (x p x k 1 ) h k = p(p 1) (p k + 1) Thus the NEWTON'S FORWARD DIFFERENCE FORMULA for interpolation formula (2) becomes P N (x p ) = y 0 + p y y 0 2! + N y 0 N! p(p 1) + + k y 0 k! p(p 1) (p N + 1).. (3) p(p 1) (p k + 1) + EXERCISE Show that and in general, and If N=1, we have a linear interpolation given by f(x p ) = f(x 0 ) + p f(x 0 )

5 For N=2, we get a quadratic interpolating polynomial: and so on. f(x p ) = f(x 0 ) + p f(x 0 ) + 2 f(x 0 ) p(p 1) 2! It may be pointed out here that if f(x) is a polynomial function of degree then P N (x) coincides with f(x) on the given interval. Otherwise, this gives only an approximation to the true values of f(x).i f we are given additional point x N+1 also, then the error, denoted by is estimated by R N (x) = P N (x) f(x) Newton's backward interpolation formula Similarly, if we assume, P N (x) is of the form then using the fact that P N (x i ) = y i, we have b 0 = y N, b 1 = 1 h y N, b 2 = 1 2! h 2 2 y N, b k = 1 k! h k k y N

6 Thus, using backward differences and the transformation x p = x N + ph, that is p = x p x N backward interpolation formula as follows: h we obtain the Newton's P N (x p ) = y N + p y N + 2 y N 2! + N y N N! p(p + 1) + + k y N k! p(p + 1) (p + N 1).. (4) p(p + 1) (p + k 1) +

7 Example 1: Using Newton s forward interpolation formula find the value of y at x=8 from the following table. X Y Ans. Here, x0 h xp Using Newton s forward interpolation formula x p x 0 h = p = 1.6 P N (x p ) = y 0 + p y y 0 2! + N y 0 N! p(p 1) + + k y 0 k! p(p 1) (p N + 1).. (3) p(p 1) (p k + 1) +

8 Here N = 5, so till fifth order difference we calculate in the following difference table 2 nd 3 rd n x y First y 2 y 3 y 4 th 4 y 5 th 4 y x0 h xp p= (xp-x0)/h p= 1.6 [p] p [p]^ p [p]^ p [p]^ p [p]^ f(xp)= Ans.= 12.77

9 Example 2: The following table gives corresponding values of x and y. Prepare a forward difference table and express y as a function of x. Also obtain y when x=2.5. X Y Ans. First we we form the forward difference table n x y first 2nd 3rd 4th Using the difference table, we can write the Newton forward interpolation polynomial as follows

10 P N (x) = y 0 + y 0 h (x x 0) + 2 y 0 2h 2 (x x 0)(x x 1 ) + 3 y 0 k! h k (x x 0)(x x 1 )(x x 2 ) + 4 y 0 4! h 4 (x x 0)(x x 1 )(x x 2 )(x x 3 ).. (2) = 7 + 4(x 0) (x 0)(x 1) Now putting x = 2. 5, we get = (ANS). 1 (x 0)(x 1)(x 2) + (x 0)(x 1)(x 2)(x 3) 24 P N (2.5) = 7 + 4(2.5 0) (2.5 0)(2.5 1) + 2 (2.5 0)(2.5 1)(2.5 2) (2.5 0)(2.5 1)(2.5 2)(2.5 3) 24 Instead of the polynomial if simply f(2. 5) is asked then we could solve as the following. Here, x0 h xp Using Newton s forward interpolation formula x p x 0 h = p = 2.5

11 P N (x p ) = y 0 + p y y 0 2! + N y 0 N! p(p 1) + + k y 0 k! p(p 1) (p N + 1).. (3) p(p 1) (p k + 1) + Here N = 4, so till fourth order difference we calculate in the following difference table n x y First y 4 2 nd 2 y rd 3 y th 4 y x0 h xp p= (xp-x0)/h p= 2.5 [p] 2.5 p [p]^ p [p]^ p [p]^ f(xp)= Ans.=

12 Example 3: Find the value of an annuity at 5 3 %, given the following table 8 x y Here we have used Newton Forward interpolation to get First y 2 nd 2 y 3 rd n x y 3 y 4 y x0 h xp p= (xp-x0)/h 4 th p= 2.75 [p] p [p]^ p [p]^ p [p]^ f(xp)= Ans.=

13 Example 4. Using Newton Backward Interpolation find the population in thousands in the year 1925, given the data for 5 censuses starting from 1891 till X F(x) Ans. Here, 1925 is near 1931 so we use backward interpolation. xn h xp x p x N h = p Using Newton s backward interpolation formula P N (x p ) = y N + p y N + 2 y N 2! p(p + 1) + + k y N k! = 0.6 p(p + 1) (p + k 1) + + N y N N! p(p + 1) (p + N 1)

14 x f(x) first 2nd 3rd 4th xn h xp p p= -0.6, p+1= 0.4, p+2= 1.4, p+3= 2.4, p+4= 3.4, f(xp)= Ans=

Curve Fitting. Objectives

Curve Fitting. Objectives Curve Fitting Objectives Understanding the difference between regression and interpolation. Knowing how to fit curve of discrete with least-squares regression. Knowing how to compute and understand the

More information

UNIT-II INTERPOLATION & APPROXIMATION

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

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

Engineering Mathematics through Applications

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

Engg. Math. II (Unit-IV) Numerical Analysis

Engg. Math. II (Unit-IV) Numerical Analysis Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided

More information

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks

More 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 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

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

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

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

Math 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1

Math 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1 ath 651 Introduction to Numerical Analysis I Fall 2010 SOLUTIONS: Homework Set 1 1. Consider the polynomial f(x) = x 2 x 2. (a) Find P 1 (x), P 2 (x) and P 3 (x) for f(x) about x 0 = 0. What is the relation

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

1 Motivation for Newton interpolation

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

Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi

Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi Lecture No - 27 Interpolation and Approximation (Continued.) In our last lecture we

More information

FINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations.

FINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. FINITE DIFFERENCES Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. 1. Introduction When a function is known explicitly, it is easy

More information

Additional exercises with Numerieke Analyse

Additional exercises with Numerieke Analyse Additional exercises with Numerieke Analyse March 10, 017 1. (a) Given different points x 0, x 1, x [a, b] and scalars y 0, y 1, y, z 1, show that there exists at most one polynomial p P 3 with p(x i )

More information

Solution of Algebric & Transcendental Equations

Solution of Algebric & Transcendental Equations Page15 Solution of Algebric & Transcendental Equations Contents: o Introduction o Evaluation of Polynomials by Horner s Method o Methods of solving non linear equations o Bracketing Methods o Bisection

More information

Quartic Equation. By CH vd Westhuizen A unique Solution assuming Complex roots. Ax^4 + Bx^3 + Cx^2 + Dx + E = 0

Quartic Equation. By CH vd Westhuizen A unique Solution assuming Complex roots. Ax^4 + Bx^3 + Cx^2 + Dx + E = 0 Quartic Equation By CH vd Westhuizen A unique Solution assuming Complex roots The general Quartic is given by Ax^4 + Bx^3 + Cx^ + Dx + E = 0 As in the third order polynomial we are first going to reduce

More information

Interpolation. P. Sam Johnson. January 30, P. Sam Johnson (NITK) Interpolation January 30, / 75

Interpolation. P. Sam Johnson. January 30, P. Sam Johnson (NITK) Interpolation January 30, / 75 Interpolation P. Sam Johnson January 30, 2015 P. Sam Johnson (NITK) Interpolation January 30, 2015 1 / 75 Overview One of the basic ideas in Mathematics is that of a function and most useful tool of numerical

More information

Then, Lagrange s interpolation formula is. 2. What is the Lagrange s interpolation formula to find, if three sets of values. are given.

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

Backward divided difference: Representation of numerical data by a polynomial curve

Backward divided difference: Representation of numerical data by a polynomial curve 2017; 2(2): 01-06 ISSN: 2456-1452 Maths 2017; 2(2): 01-06 2017 Stats & Maths www.mathsjournal.com Received: 01-01-2017 Accepted: 02-02-2017 Biswajit Das Research Scholar, Assam Down Town University, Panikhaiti,

More information

Preliminary Examination in Numerical Analysis

Preliminary Examination in Numerical Analysis Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify

More information

5.1 Polynomial Functions

5.1 Polynomial Functions 5.1 Polynomial Functions In this section, we will study the following topics: Identifying polynomial functions and their degree Determining end behavior of polynomial graphs Finding real zeros of polynomial

More information

M.SC. PHYSICS - II YEAR

M.SC. PHYSICS - II YEAR MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. PHYSICS - II YEAR DKP26 - NUMERICAL METHODS (From the academic year 2016-17) Most Student

More 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

Module 5 : Linear and Quadratic Approximations, Error Estimates, Taylor's Theorem, Newton and Picard Methods

Module 5 : Linear and Quadratic Approximations, Error Estimates, Taylor's Theorem, Newton and Picard Methods Module 5 : Linear and Quadratic Approximations, Error Estimates, Taylor's Theorem, Newton and Picard Methods Lecture 14 : Taylor's Theorem [Section 141] Objectives In this section you will learn the following

More information

Computational Methods. Solving Equations

Computational Methods. Solving Equations Computational Methods Solving Equations Manfred Huber 2010 1 Solving Equations Solving scalar equations is an elemental task that arises in a wide range of applications Corresponds to finding parameters

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

Q 0 x if x 0 x x 1. S 1 x if x 1 x x 2. i 0,1,...,n 1, and L x L n 1 x if x n 1 x x n

Q 0 x if x 0 x x 1. S 1 x if x 1 x x 2. i 0,1,...,n 1, and L x L n 1 x if x n 1 x x n . - Piecewise Linear-Quadratic Interpolation Piecewise-polynomial Approximation: Problem: Givenn pairs of data points x i, y i, i,,...,n, find a piecewise-polynomial Sx S x if x x x Sx S x if x x x 2 :

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

Unit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power.

Unit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power. MODULE 1 1 Polynomial A function that contains 1 or more or terms. The variables may be to any non-negative power. 1 Modeling Mathematical modeling is the process of using, and to represent real world

More information

Higher-Degree Polynomial Functions. Polynomials. Polynomials

Higher-Degree Polynomial Functions. Polynomials. Polynomials Higher-Degree Polynomial Functions 1 Polynomials A polynomial is an expression that is constructed from one or more variables and constants, using only the operations of addition, subtraction, multiplication,

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

MA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION

MA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION MA6452 STATISTICS AND NUMERICAL METHODS UNIT IV NUMERICAL DIFFERENTIATION AND INTEGRATION By Ms. K. Vijayalakshmi Assistant Professor Department of Applied Mathematics SVCE NUMERICAL DIFFERENCE: 1.NEWTON

More information

Taylor Series and Numerical Approximations

Taylor Series and Numerical Approximations Taylor Series and Numerical Approximations Hilary Weller h.weller@reading.ac.uk August 7, 05 An introduction to the concept of a Taylor series and how these are used in numerical analysis to find numerical

More information

Power Series Solutions to the Legendre Equation

Power Series Solutions to the Legendre Equation Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial

More information

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

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University

PowerPoints organized by Dr. Michael R. Gustafson II, Duke University Part 5 Chapter 17 Numerical Integration Formulas PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction

More information

1 Solutions to selected problems

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

Hermite Interpolation

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

Interpolation. s(s 1)(s 2) Δ 3 f ! s(s 1) Δ 2 f 0 + 2! f(x s )=f 0 + sδf 0 +

Interpolation. s(s 1)(s 2) Δ 3 f ! s(s 1) Δ 2 f 0 + 2! f(x s )=f 0 + sδf 0 + Interpolation For equally spaced sample points, the Newton-Gregory formula can be used effectively in two ways: (1) Use for derivation of well-known intepolation formulas. (2) Use directy for numerical

More information

Chapter 5: Numerical Integration and Differentiation

Chapter 5: Numerical Integration and Differentiation Chapter 5: Numerical Integration and Differentiation PART I: Numerical Integration Newton-Cotes Integration Formulas The idea of Newton-Cotes formulas is to replace a complicated function or tabulated

More information

Differentiation of Discrete Functions

Differentiation of Discrete Functions Differentiation of Discrete Functions Differentiation of Discrete Functions Introduction Ana Catalina Torres, Autar Kaw University of South Florida United States of America kaw@eng.usf.edu This worksheet

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

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

Hence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1.

Hence a root lies between 1 and 2. Since f a is negative and f(x 0 ) is positive The root lies between a and x 0 i.e. 1 and 1. The Bisection method or BOLZANO s method or Interval halving method: Find the positive root of x 3 x = 1 correct to four decimal places by bisection method Let f x = x 3 x 1 Here f 0 = 1 = ve, f 1 = ve,

More 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

Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series

Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series Power Series for Functions We can create a Power Series (or polynomial series) that can approximate a function around

More information

Solutions 2. January 23, x x

Solutions 2. January 23, x x Solutions 2 January 23, 2016 1 Exercise 3.1.1 (a), p. 149 Let us compute Lagrange polynomials first for our case x 1 = 0, x 2 = 2, x 3 = 3: In [14]: from sympy import * init_printing(use_latex=true) x=symbols(

More information

Lesson 5: The Graph of the Equation y = f(x)

Lesson 5: The Graph of the Equation y = f(x) Lesson 5: The Graph of the Equation y = f(x) Learning targets: I can identify when a function is increasing, decreasing, positive and negative and use interval notation to describe intervals where the

More information

Fall 2014 MAT 375 Numerical Methods. Numerical Differentiation (Chapter 9)

Fall 2014 MAT 375 Numerical Methods. Numerical Differentiation (Chapter 9) Fall 2014 MAT 375 Numerical Metods (Capter 9) Idea: Definition of te derivative at x Obviuos approximation: f (x) = lim 0 f (x + ) f (x) f (x) f (x + ) f (x) forward-difference formula? ow good is tis

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

Analysis Methods in Atmospheric and Oceanic Science

Analysis Methods in Atmospheric and Oceanic Science Analysis Methods in Atmospheric and Oceanic Science AOSC 652 Week 7, Day 1 13 Oct 2014 1 Student projects: 20% of the final grade: you will receive a numerical score for the project and final grade will

More information

Math 578: Assignment 2

Math 578: Assignment 2 Math 578: Assignment 2 13. Determine whether the natural cubic spline that interpolates the table is or is not the x 0 1 2 3 y 1 1 0 10 function 1 + x x 3 x [0, 1] f(x) = 1 2(x 1) 3(x 1) 2 + 4(x 1) 3 x

More information

Skills Practice Skills Practice for Lesson 10.1

Skills Practice Skills Practice for Lesson 10.1 Skills Practice Skills Practice for Lesson.1 Name Date Higher Order Polynomials and Factoring Roots of Polynomial Equations Problem Set Solve each polynomial equation using factoring. Then check your solution(s).

More information

Mathematical Focus 1 Complex numbers adhere to certain arithmetic properties for which they and their complex conjugates are defined.

Mathematical Focus 1 Complex numbers adhere to certain arithmetic properties for which they and their complex conjugates are defined. Situation: Complex Roots in Conjugate Pairs Prepared at University of Georgia Center for Proficiency in Teaching Mathematics June 30, 2013 Sarah Major Prompt: A teacher in a high school Algebra class has

More information

Numerical Methods. Lecture Notes #08 Discrete Least Square Approximation

Numerical Methods. Lecture Notes #08 Discrete Least Square Approximation Numerical Methods Discrete Least Square Approximation Pavel Ludvík, March 30, 2016 Department of Mathematics and Descriptive Geometry VŠB-TUO http://homen.vsb.cz/ lud0016/ 1 / 23

More information

A.APR.B.3: Find Zeros of Polynomials B. Understand the relationship between zeros and factors of polynomials.

A.APR.B.3: Find Zeros of Polynomials B. Understand the relationship between zeros and factors of polynomials. A.APR.B.3: Find Zeros of Polynomials POLYNOMIALS AND QUADRATICS A.APR.B.3: Find Zeros of Polynomials B. Understand the relationship between zeros and factors of polynomials. 3. Identify zeros of polynomials

More information

Quadratic Model To Solve Equations Of Degree n In One Variable

Quadratic Model To Solve Equations Of Degree n In One Variable Quadratic Model To Solve Equations Of Degree n In One Variable This paper introduces a numeric method to solving equations of degree n in one variable. Because the method is based on a quadratic model,

More information

GATE EC Previous Year Solved Paper

GATE EC Previous Year Solved Paper GATE EC Previous Year Solved Paper GATE 2017 is just round the corner. Engineering Mathematics is a highly scoring portion in GATE. A basic understanding of the concepts and a thorough practice is enough

More information

Chapter 2 notes from powerpoints

Chapter 2 notes from powerpoints Chapter 2 notes from powerpoints Synthetic division and basic definitions Sections 1 and 2 Definition of a Polynomial Function: Let n be a nonnegative integer and let a n, a n-1,, a 2, a 1, a 0 be real

More information

Applied Numerical Analysis Quiz #2

Applied Numerical Analysis Quiz #2 Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the

More information

( ) ( ) ( ) ( )( ) A.SSE.A.2: Factor Polynomials. Factoring Monomials:

( ) ( ) ( ) ( )( ) A.SSE.A.2: Factor Polynomials. Factoring Monomials: A.SSE.A.: Factor Polynomials POLYNOMIALS AND QUADRATICS A.SSE.A.: Factor Polynomials A. Interpret the structure of expressions.. Use the structure of an expression to identify ways to rewrite it. For example,

More information

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY Code No: R007/R0 Set No. I B.Tech I Semester Supplementary Examinations, Feb/Mar 04 MATHEMATICAL METHODS ( Common to Civil Engineering, Electrical & Electronics Engineering, Computer Science & Engineering,

More information

Newton s Method and Linear Approximations

Newton s Method and Linear Approximations Newton s Method and Linear Approximations Curves are tricky. Lines aren t. Newton s Method and Linear Approximations Newton s Method for finding roots Goal: Where is f (x) = 0? f (x) = x 7 + 3x 3 + 7x

More information

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK KINGS COLLEGE OF ENGINEERING MA5-NUMERICAL METHODS DEPARTMENT OF MATHEMATICS ACADEMIC YEAR 00-0 / EVEN SEMESTER QUESTION BANK SUBJECT NAME: NUMERICAL METHODS YEAR/SEM: II / IV UNIT - I SOLUTION OF EQUATIONS

More information

Chapter 3: Root Finding. September 26, 2005

Chapter 3: Root Finding. September 26, 2005 Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division

More 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

Math 110 Midterm 1 Study Guide October 14, 2013

Math 110 Midterm 1 Study Guide October 14, 2013 Name: For more practice exercises, do the study set problems in sections: 3.4 3.7, 4.1, and 4.2. 1. Find the domain of f, and express the solution in interval notation. (a) f(x) = x 6 D = (, ) or D = R

More information

Math 221 Notes on Rolle s Theorem, The Mean Value Theorem, l Hôpital s rule, and the Taylor-Maclaurin formula. 1. Two theorems

Math 221 Notes on Rolle s Theorem, The Mean Value Theorem, l Hôpital s rule, and the Taylor-Maclaurin formula. 1. Two theorems Math 221 Notes on Rolle s Theorem, The Mean Value Theorem, l Hôpital s rule, and the Taylor-Maclaurin formula 1. Two theorems Rolle s Theorem. If a function y = f(x) is differentiable for a x b and if

More information

SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V

SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V SBAME CALCULUS OF FINITE DIFFERENCES AND NUMERICAL ANLAYSIS-I Units : I-V Unit I-Syllabus Solutions of Algebraic and Transcendental equations, Bisection method, Iteration Method, Regula Falsi method, Newton

More information

AP Calculus Testbank (Chapter 9) (Mr. Surowski)

AP Calculus Testbank (Chapter 9) (Mr. Surowski) AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series

More information

GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES

GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES RICHARD J. MATHAR Abstract. The manuscript provides tables of abscissae and weights for Gauss- Laguerre integration on 64, 96 and 128

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

STATE COUNCIL OF EDUCATIONAL RESEARCH AND TRAINING TNCF DRAFT SYLLABUS

STATE COUNCIL OF EDUCATIONAL RESEARCH AND TRAINING TNCF DRAFT SYLLABUS STATE COUNCIL OF EDUCATIONAL RESEARCH AND TRAINING TNCF 2017 - DRAFT SYLLABUS Subject :Business Maths Class : XI Unit 1 : TOPIC Matrices and Determinants CONTENT Determinants - Minors; Cofactors; Evaluation

More information

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods

Chapter 8. Numerical Solution of Ordinary Differential Equations. Module No. 2. Predictor-Corrector Methods Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Matematics National Institute of Tecnology Durgapur Durgapur-7109 email: anita.buie@gmail.com 1 . Capter 8 Numerical Solution of Ordinary

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

Q1. Discuss, compare and contrast various curve fitting and interpolation methods

Q1. Discuss, compare and contrast various curve fitting and interpolation methods Q1. Discuss, compare and contrast various curve fitting and interpolation methods McMaster University 1 Curve Fitting Problem statement: Given a set of (n + 1) point-pairs {x i,y i }, i = 0,1,... n, find

More information

Interpolating Accuracy without underlying f (x)

Interpolating Accuracy without underlying f (x) Example: Tabulated Data The following table x 1.0 1.3 1.6 1.9 2.2 f (x) 0.7651977 0.6200860 0.4554022 0.2818186 0.1103623 lists values of a function f at various points. The approximations to f (1.5) obtained

More information

Lectures 9-10: Polynomial and piecewise polynomial interpolation

Lectures 9-10: Polynomial and piecewise polynomial interpolation Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j

More information

Numerical Methods School of Mechanical Engineering Chung-Ang University

Numerical Methods School of Mechanical Engineering Chung-Ang University Part 5 Chapter 19 Numerical Differentiation Prof. Hae-Jin Choi hjchoi@cau.ac.kr 1 Chapter Objectives l Understanding the application of high-accuracy numerical differentiation formulas for equispaced data.

More information

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent

More information

CS 323: Numerical Analysis and Computing

CS 323: Numerical Analysis and Computing CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.

More information

A first order divided difference

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

Newton s Method and Linear Approximations

Newton s Method and Linear Approximations Newton s Method and Linear Approximations Newton s Method for finding roots Goal: Where is f (x) =0? f (x) =x 7 +3x 3 +7x 2 1 2-1 -0.5 0.5-2 Newton s Method for finding roots Goal: Where is f (x) =0? f

More information

ON PERFECT SUBFIELDS OVER WHICH A FIELD IS SEPARABLY GENERATED

ON PERFECT SUBFIELDS OVER WHICH A FIELD IS SEPARABLY GENERATED PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 33. Number 2, June 1972 ON PERFECT SUBFIELDS OVER WHICH A FIELD IS SEPARABLY GENERATED DAVID JACOBSON Abstract. In this paper, we determine the perfect

More information

Section 5.3, Exercise 22

Section 5.3, Exercise 22 The Legendre equation is where α is a constant. Section 5.3, Exercise 22 (1 x 2 ) 2x + α(α + 1) 0 Determine two linearl independent solutions in powers of x for x < 1. Assume (x) a n x n and substitute

More information

HANDOUT ABOUT THE TABLE OF SIGNS METHOD. The method To find the sign of a rational (including polynomial) function

HANDOUT ABOUT THE TABLE OF SIGNS METHOD. The method To find the sign of a rational (including polynomial) function HANDOUT ABOUT THE TABLE OF SIGNS METHOD NIKOS APOSTOLAKIS The method To find the sign of a rational (including polynomial) function = p(x) q(x) where p(x) and q(x) have no common factors proceed as follows:

More information

DIFFERENTIAL EQUATIONS

DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS Chapter 1 Introduction and Basic Terminology Most of the phenomena studied in the sciences and engineering involve processes that change with time. For example, it is well known

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises

More information

Measures, orthogonal polynomials, and continued fractions. Michael Anshelevich

Measures, orthogonal polynomials, and continued fractions. Michael Anshelevich Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ

More information

Numerical Methods. Roots of Equations

Numerical Methods. Roots of Equations Roots of Equations by Norhayati Rosli & Nadirah Mohd Nasir Faculty of Industrial Sciences & Technology norhayati@ump.edu.my, nadirah@ump.edu.my Description AIMS This chapter is aimed to compute the root(s)

More information

F I F T H E D I T I O N. Introductory Methods of Numerical Analysis. S.S. Sastry

F I F T H E D I T I O N. Introductory Methods of Numerical Analysis. S.S. Sastry F I F T H E D I T I O N Introductory Methods of Numerical Analysis S.S. Sastry Introductory Methods of Numerical Analysis Introductory Methods of Numerical Analysis Fifth Edition S.S. SASTRY Formerly,

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

Approximation, Taylor Polynomials, and Derivatives

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

X. Numerical Methods

X. Numerical Methods X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced

More information

1 Solutions to selected problems

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

Newton s Method and Linear Approximations 10/19/2011

Newton s Method and Linear Approximations 10/19/2011 Newton s Method and Linear Approximations 10/19/2011 Curves are tricky. Lines aren t. Newton s Method and Linear Approximations 10/19/2011 Newton s Method Goal: Where is f (x) =0? f (x) =x 7 +3x 3 +7x

More information

SKMM 3023 Applied Numerical Methods

SKMM 3023 Applied Numerical Methods UNIVERSITI TEKNOLOGI MALAYSIA SKMM 3023 Applied Numerical Methods Numerical Differentiation ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Numerical

More information