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

Size: px
Start display at page:

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

Transcription

1 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 computation. The formula can be written using forward differnces in the form: f(x s )=f 0 + sδf 0 + s(s 1) Δ 2 f 0 + 2! s(s 1)(s 2) Δ 3 f ! in which s =(x s x 0 )/h is the normalized distance from x 0 and h = x 1 x 0 is increment of the sample points. (1) For the purpose of derivations, the forward differences can be written as: f Δf Δ 2 f Δ 3 f Δ 4 f f 0 f 1 f 0 f 1 f 2 2f 1 + f 0 f 2 f 1 f 3 3f 2 +3f 1 f 0 f 2 f 3 2f 2 + f 1 f 4 4f 3 +6f 2 4f 1 + f 0 f 3 f 2 f 4 3f 3 +3f 2 f 1 f 3 f 4 2f 3 + f 2 f 5 4f 4 +6f 3 4f 2 + f 1 f 4 f 3 f 5 3f 4 +3f 3 f 2 f 4 f 5 2f 4 + f 3 f 5 f 4 f 5 (2) For the purpose of direct computation, the forward differences can be written in terms of the forward differences of one order lower, as: f Δf Δ 2 f Δ 3 f Δ 4 f f 0 f 1 f 0 f 1 Δf 1 Δf 0 f 2 f 1 Δ 2 f 1 Δ 2 f 0 f 2 Δf 2 Δf 1 Δ 3 f 1 Δ 3 f 0 f 3 f 2 Δ 2 f 2 Δ 2 f 1 f 3 Δf 3 Δf 2 Δ 3 f 2 Δ 3 f 1 f 4 f 3 Δ 2 f 3 Δ 2 f 2 f 4 Δf 4 Δf 3 f 5 f 4 f 5

2 Interpolation With Equally Spaced Sample Points Two-sample-point Lagrange Formula Two sample points: Abscissas: x 0 and x 1. Sample functional values: f 0 and f 1. Let s =(x x 0 )/h. In this case, let p = s =(x x 0 )/h. The Newton=Gregory formula has the form: f(x) =f 0 + sδf 0 = f 0 + s(f 1 f 0 ). Substitute p for s, the Lagrange Two-Point Interpolation formula is: f(x) =f 0 + p (f 1 f 0 )=(1 p) f 0 + pf 1. Three-sample-point Lagrange Formula Three sample points: Abscissas: x 1, x 0 and x 1. Sample functional values: f 1, f 0 and f 1. Let s =(x x 1 )/h. In this case, let p be the normalized distance from the center point x 0, i.e.,p =(x x 0 )/h. With some simplication, p =[(x x 1 )+(x 1 x 0 )]/h = s 1. The Newton=Gregory formula has the form: In terms of the sample values, f(x) =f 1 + sδf s(s 1)Δ2 f 1. f(x) =f 1 + s (f 0 f 1 )+ 1 2 s(s 1) (f 1 2f 0 + f 1 ). Substitute for s = p +1, the formula can be written in terms of p as f(x) =f 1 +(p +1)(f 0 f 1 )+ 1 2 (p +1)p (f 1 2f 0 + f 1 ). Now collect terms according to the sample values: f(x) =f 1 [1 (p +1)+ 1 2 (p2 + p)] + f 0 [(p +1) (p 2 + p)] + f 1 [ 1 2 (p2 + p)] Finally, the 3-point Lagrange Formula could be written as f(x) = 1 2 p(p 1) f 1 +(1 p 2 ) f p(p +1)f 1.

3 Five-sample-point Lagrange Formula Five sample points: Abscissas: x 2, x 1, x 0, x 1 and x 2. Sample functional values: f 2, f 1, f 0, f 1 and f 2. Let s =(x x 2 )/h. In this case, let p be the normalized distance from the center point x 0, i.e.,p =(x x 0 )/h. With some simplication, p =[(x x 2 )+(x 2 x 0 )]/h = s 2. The Newton=Gregory formula has the form: f(x) =f 2 + sδf s(s 1)Δ2 f s(s 1)(s 2)Δ3 f s(s 1)(s 2)(s 3)Δ4 f 2. In terms of the sample values, f(x) =f 2 + s (f 1 f 2 )+ 1 2 s(s 1) (f 0 2f 1 + f 2 ) s(s 1)(s 2) (f 1 3f 0 +3f 1 f 2 ) s(s 1)(s 2)(s 3) (f 2 4f 1 +6f 0 4f 1 + f 2 ) Substitute for s = p +2, the above formula can be written in terms of p as f(x) =f 2 +(p +2)(f 1 f 2 )+ 1 2 (p + 2)(p +1)(f 0 2f 1 + f 2 ) (p + 2)(p +1)p (f 1 3f 0 +3f 1 f 2 ) (p + 2)(p +1)p(p 1) (f 2 4f 1 +6f 0 4f 1 + f 2 ) Now collect terms according to the sample values: f(x) =f 2 [1 (p +2)+ 1 2 (p + 2)(p +1) 1 6 (p + 2)(p +1)p + 1 (p + 2)(p +1)p(p 1)] 24 + f 1 [(p +2) (p + 2)(p +1)+ 1 2 (p + 2)(p +1)p 1 (p + 2)(p +1)p(p 1)] 6 + f 0 [ 1 2 (p + 2)(p +1) 1 2 (p + 2)(p +1)p 1 (p + 2)(p +1)p(p 1)] 4 + f 1 [ 1 6 (p + 2)(p +1)p 1 (p + 2)(p +1)p(p 1)] 6 + f 2 [ 1 (p + 2)(p +1)p(p 1)] 24 Finally, the 3-point Lagrange Formula could be written as f(x) = 1 24 (p2 1)p(p 2) f (p 1)p(p2 4) f (p2 1)(p 2 4) f (p +1)p(p2 4) f (p2 1)p(p +2)f 2

4 Example - Application of 3-point Lagrange Formula Given x 1 =0.9 f 1 = x 0 =1.4 f 0 = x 1 =1.9 f 1 = Solution: h = = =0.5. To interpolate for f(1.53), let p =( )/0.5 = The interpolation is then accomplished by f(1.53) 1 2 (0.26)(0.26 1)( ) + (1 (0.26)2 )( ) + 1 (0.26)( )( ) 2 Hence, the interpolated value is f(1.53) Since the values were obtained as sin x, the exact value for f(1.53)= But we need to do the interpolation because the tabulated values didn t include that for x =1.53.

5 Numerical Interpolation using Newton Gregory Formula If the number of sample points is large, it might be simpler to use the Newton Gregory formula directly. It is also quite simple to create a computer program to accomplish the task. Example - 3-point Forward Difference Table Given f Δf Δ 2 f Solution: h = = =0.5. To interpolate for f(1.53), let s =( )/0.5 = The application of the Newton-Gregory Formula will yield f(1.53) (1.26)( ) + 1 (1.26)(0.26)( ) = Example - 5-point Forward Difference Table Given f Δf Δ 2 f Δ 3 f Δ 4 f Solution: h = = = To interpolate for f(1.53), let s =( )/0.25=2.52. The application of the 4-th order Newton-Gregory Formula will yield f(1.53) (2.52)( ) (2.52)(1.52)( ) (2.52)(1.52)(0.52)( ) + 1 (2.52)(1.52)(0.52)( 0.48)( ) = The more refined interpolation yields a value of , very near the exact value of

6 Interpolation With Non-Equally Spaced Sample Points Three-sample-point Formula With three non-equally spaced abscissa, x 1, x 2 and x 3, and three function values f 1, f 2 and f 3, the interpolated value at x can be determined as f(x) =f 1 δ 1 (x)+f 2 δ 2 (x)+f 3 δ 3 (x). The requirements for δ i (x) is such that it must be equal to 1 when x = x i and it must be equal to 0 when x = j with j i. For this particular case, the interpolation functions could be written as δ 1 (x) = (x x 2)(x x 3 ) (x 1 x 2 )(x 1 x 3 ) δ 2 (x) = (x x 1)(x x 3 ) (x 2 x 1 )(x 2 x 3 ) δ 3 (x) = (x x 1)(x x 2 ) (x 3 x 1 )(x 3 x 2 ) The above functions satisfy the order of the polynomial as well, i.e., a parabola can be determined uniquely by 3 sample points. N-sample-point Formula It is clear that the interpolation formula was written as a sum of products. Therefore, the general case of the interpolation formula could be written as f(x) = N f i δ i (x). i=1 in which δ i (x) = N j=1,j i (x x j ) (x i x j ).

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

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

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

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

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

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

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

Numerical Integra/on

Numerical Integra/on Numerical Integra/on Applica/ons The Trapezoidal Rule is a technique to approximate the definite integral where For 1 st order: f(a) f(b) a b Error Es/mate of Trapezoidal Rule Truncation error: From Newton-Gregory

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

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

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

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

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

Newton's forward interpolation formula

Newton's forward interpolation formula 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

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

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

NUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.

NUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places. NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.

More 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

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

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

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

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 Integra/on

Numerical Integra/on Numerical Integra/on The Trapezoidal Rule is a technique to approximate the definite integral where For 1 st order: f(a) f(b) a b Error Es/mate of Trapezoidal Rule Truncation error: From Newton-Gregory

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

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

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

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

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

GENG2140, S2, 2012 Week 7: Curve fitting

GENG2140, S2, 2012 Week 7: Curve fitting GENG2140, S2, 2012 Week 7: Curve fitting Curve fitting is the process of constructing a curve, or mathematical function, f(x) that has the best fit to a series of data points Involves fitting lines and

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

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

Regent College Maths Department. Further Pure 1 Numerical Solutions of Equations

Regent College Maths Department. Further Pure 1 Numerical Solutions of Equations Regent College Maths Department Further Pure 1 Numerical Solutions of Equations Further Pure 1 Numerical Solutions of Equations You should: Be able use interval bisection, linear interpolation and the

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

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

Section 6.6 Gaussian Quadrature

Section 6.6 Gaussian Quadrature Section 6.6 Gaussian Quadrature Key Terms: Method of undetermined coefficients Nonlinear systems Gaussian quadrature Error Legendre polynomials Inner product Adapted from http://pathfinder.scar.utoronto.ca/~dyer/csca57/book_p/node44.html

More information

B.Sc. (Second Year)(Third Semester)(Mathematics)

B.Sc. (Second Year)(Third Semester)(Mathematics) B.Sc. Mathematics II Semester III - 1 - B.Sc. (Second Year)(Third Semester)(Mathematics) Paper No. MAT 301: (Number Theory) 1. Divisibility Theory in the integers: The Division Algorithm, The greatest

More information

Subbalakshmi Lakshmipathy College of Science. Department of Mathematics

Subbalakshmi Lakshmipathy College of Science. Department of Mathematics ॐ Subbalakshmi Lakshmipathy College of Science Department of Mathematics As are the crests on the hoods of peacocks, As are the gems on the heads of cobras, So is Mathematics, at the top of all Sciences.

More information

Numerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.

Numerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration. Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal

More information

(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

Section 5.3 The Newton Form of the Interpolating Polynomial

Section 5.3 The Newton Form of the Interpolating Polynomial Section 5.3 The Newton Form of the Interpolating Polynomial Key terms Divided Difference basis Add-on feature Divided Difference Table The Lagrange form is not very efficient if we have to evaluate the

More information

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding

More 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

STATISTICS AND NUMERICAL METHODS

STATISTICS AND NUMERICAL METHODS STATISTICS AND NUMERICAL METHODS Question IV November / December 2011 Part-A 1. The heights of college students in Chennai are normally distributed with standard deviation 6 cm and sample of 100 students

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

CS412: Introduction to Numerical Methods

CS412: Introduction to Numerical Methods CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,

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

LOWELL WEEKLY JOURNAL. ^Jberxy and (Jmott Oao M d Ccmsparftble. %m >ai ruv GEEAT INDUSTRIES

LOWELL WEEKLY JOURNAL. ^Jberxy and (Jmott Oao M d Ccmsparftble. %m >ai ruv GEEAT INDUSTRIES ? (») /»» 9 F ( ) / ) /»F»»»»»# F??»»» Q ( ( »»» < 3»» /» > > } > Q ( Q > Z F 5

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

Numerical Methods I Solving Nonlinear Equations

Numerical Methods I Solving Nonlinear Equations Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)

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

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

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

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

Polynomial Review Problems

Polynomial Review Problems Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on

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

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

Interpolation & Polynomial Approximation. Hermite Interpolation I

Interpolation & Polynomial Approximation. Hermite Interpolation I Interpolation & Polynomial Approximation Hermite Interpolation I Numerical Analysis (th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

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

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

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

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

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

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

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

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

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

Interpolation and the Lagrange Polynomial

Interpolation and the Lagrange Polynomial Interpolation and the Lagrange Polynomial MATH 375 J. Robert Buchanan Department of Mathematics Fall 2013 Introduction We often choose polynomials to approximate other classes of functions. Theorem (Weierstrass

More information

Midterm Review. Igor Yanovsky (Math 151A TA)

Midterm Review. Igor Yanovsky (Math 151A TA) Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply

More information

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes). CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f

More information

1.1 Introduction to Limits

1.1 Introduction to Limits Chapter 1 LIMITS 1.1 Introduction to Limits Why Limit? Suppose that an object steadily moves forward, with s(t) denotes the position at time t. The average speed over the interval [1,2] is The average

More information

Polynomial Interpolation with n + 1 nodes

Polynomial Interpolation with n + 1 nodes Polynomial Interpolation with n + 1 nodes Given n + 1 distinct points (x 0, f (x 0 )), (x 1, f (x 1 )),, (x n, f (x n )), Interpolating polynomial of degree n P(x) = f (x 0 )L 0 (x) + f (x 1 )L 1 (x) +

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

13 Path Planning Cubic Path P 2 P 1. θ 2

13 Path Planning Cubic Path P 2 P 1. θ 2 13 Path Planning Path planning includes three tasks: 1 Defining a geometric curve for the end-effector between two points. 2 Defining a rotational motion between two orientations. 3 Defining a time function

More information

Abstract. Keywords: Interpolation; simulated empirical study; reduced-bias. AMS Classification Number: 32E30; 47A57; 65D05.

Abstract. Keywords: Interpolation; simulated empirical study; reduced-bias. AMS Classification Number: 32E30; 47A57; 65D05. 1 1 1 1 1 1 0 1 An Iterative-Improvement Algorithm for Newton's Forward Difference Formula Using Statistical Perspective Shanaz Ansari Wahid,*Ashok Sahai & Vrijesh Tripathi Department of Mathematics &

More information

EVALUATING A POLYNOMIAL

EVALUATING A POLYNOMIAL EVALUATING A POLYNOMIAL Consider having a polynomial p(x) = a + a 1 x + a 2 x 2 + + a n x n which you need to evaluate for many values of x. How do you evaluate it? This may seem a strange question, but

More information

Previous Year Questions & Detailed Solutions

Previous Year Questions & Detailed Solutions Previous Year Questions & Detailed Solutions. The rate of convergence in the Gauss-Seidal method is as fast as in Gauss Jacobi smethod ) thrice ) half-times ) twice 4) three by two times. In application

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

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

Numerical Analysis & Computer Programming

Numerical Analysis & Computer Programming ++++++++++ Numerical Analysis & Computer Programming Previous year Questions from 07 to 99 Ramanasri Institute W E B S I T E : M A T H E M A T I C S O P T I O N A L. C O M C O N T A C T : 8 7 5 0 7 0 6

More information

8.8. Applications of Taylor Polynomials. Infinite Sequences and Series 8

8.8. Applications of Taylor Polynomials. Infinite Sequences and Series 8 8.8 Applications of Taylor Polynomials Infinite Sequences and Series 8 Applications of Taylor Polynomials In this section we explore two types of applications of Taylor polynomials. First we look at how

More information

SOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)

SOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS) CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY (Approved by AICTE New Delhi, Affiliated to Anna University Chennai. Zamin Endathur Village, Madurntakam Taluk, Kancheepuram Dist.-603311.) MA6459 - NUMERICAL

More 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

A General Formula of Polynomial Interpolation. A. C. AITKEN. (Received 2nd March Bead 3rd May 1929.) 1. ENUNCIATION AND PEOOF.

A General Formula of Polynomial Interpolation. A. C. AITKEN. (Received 2nd March Bead 3rd May 1929.) 1. ENUNCIATION AND PEOOF. 199 A General Formula of Polynomial Interpolation. By A. C. AITKEN. (Received 2nd March 1929. Bead 3rd May 1929.) 1. ENUNCIATION AND PEOOF. The operations 1 of differentiation, ordinary and central differencing,

More information

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

The Tangent Parabola The AMATYC Review, Vol. 23, No. 1, Fall 2001, pp

The Tangent Parabola The AMATYC Review, Vol. 23, No. 1, Fall 2001, pp The Tangent Parabola The AMATYC Review, Vol. 3, No., Fall, pp. 5-3. John H. Mathews California State University Fullerton Fullerton, CA 9834 By Russell W. Howell Westmont College Santa Barbara, CA 938

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

SPLINE INTERPOLATION

SPLINE INTERPOLATION Spline Background SPLINE INTERPOLATION Problem: high degree interpolating polynomials often have extra oscillations. Example: Runge function f(x = 1 1+4x 2, x [ 1, 1]. 1 1/(1+4x 2 and P 8 (x and P 16 (x

More information

Math 181, Exam 2, Study Guide 2 Problem 1 Solution. 1 + dx. 1 + (cos x)2 dx. 1 + cos2 xdx. = π ( 1 + cos π 2

Math 181, Exam 2, Study Guide 2 Problem 1 Solution. 1 + dx. 1 + (cos x)2 dx. 1 + cos2 xdx. = π ( 1 + cos π 2 Math 8, Exam, Study Guide Problem Solution. Use the trapezoid rule with n to estimate the arc-length of the curve y sin x between x and x π. Solution: The arclength is: L b a π π + ( ) dy + (cos x) + cos

More information

MAT 300 Midterm Exam Summer 2017

MAT 300 Midterm Exam Summer 2017 MAT Midterm Exam Summer 7 Note: For True-False questions, a statement is only True if it must always be True under the given assumptions, otherwise it is False.. The control points of a Bezier curve γ(t)

More information

COURSE Numerical integration of functions

COURSE Numerical integration of functions COURSE 6 3. Numerical integration of functions The need: for evaluating definite integrals of functions that has no explicit antiderivatives or whose antiderivatives are not easy to obtain. Let f : [a,

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

CELESTIAL MECHANICS. Part I. Mathematical Preambles

CELESTIAL MECHANICS. Part I. Mathematical Preambles Chapter 1. Numerical Methods CELESTIAL MECHANICS Part I. Mathematical Preambles 1.1 Introduction 1.2 Numerical Integration 1.3 Quadratic Equations 1.4 The Solution of f(x) = 0 1.5 The Solution of Polynomial

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

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

Tutorial 1, B. Tech. Sem III, 24 July, (Root Findings and Linear System of Equations)

Tutorial 1, B. Tech. Sem III, 24 July, (Root Findings and Linear System of Equations) Tutorial, B. Tech. Sem III, 24 July, 206 (Root Findings and Linear System of Equations). Find the root of the equation e x = 3x lying in [0,] correct to three decimal places using Bisection, Regula-Falsi

More information

12 STD BUSINESS MATHEMATICS

12 STD BUSINESS MATHEMATICS STD BUSINESS MATHEMATICS 6 MARK FAQ S: CHAPTER :. APPLICATION OF MATRICES AND DETERMINANTS. Given, A verify that A AdjA (J 7; O 7 ; O ). Find the inverse of, b a A and verify that I AA. (J 6). Verify A

More information

Data Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1

Data Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1 Data Analysis-I Interpolation Soon-Hyung Yook December 4, 2015 Soon-Hyung Yook Data Analysis-I December 4, 2015 1 / 1 Table of Contents Soon-Hyung Yook Data Analysis-I December 4, 2015 2 / 1 Introduction

More information

Torque and Rotation Lecture 7

Torque and Rotation Lecture 7 Torque and Rotation Lecture 7 ˆ In this lecture we finally move beyond a simple particle in our mechanical analysis of motion. ˆ Now we consider the so-called rigid body. Essentially, a particle with extension

More information

AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period:

AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: WORKSHEET: Series, Taylor Series AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: 1 Part I. Multiple-Choice Questions (5 points each; please circle the correct answer.) 1. The

More information