Interpolation Practice-6 Additional chapters of mathematics

Slides:



Advertisements
Similar presentations
Interpolation A standard idea in interpolation now is to find a polynomial pn(x) of degree n (or less) that assumes the given values; thus (1) We call.
Advertisements

CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
1 Dr. Scott Schaefer Curves and Interpolation. 2/61 Smooth Curves How do we create smooth curves?
Curve-Fitting Polynomial Interpolation
Polynomial Interpolation
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
1 Chapter 6 NUMERICAL DIFFERENTIATION. 2 When we have to differentiate a function given by a set of tabulated values or when a complicated function is.
ON MULTIVARIATE POLYNOMIAL INTERPOLATION
Lagrange interpolation Gives the same results as Newton, but different method.
Chapter 6 Numerical Interpolation
Chapter 2 Systems of Linear Equations and Matrices Section 2.1 Solutions of Linear Systems.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Numerical Methods.  If (n+1) number of points are given, (n+1) number of equations can be formed using a (n+1) order polynomial  The equations can be.
Today’s class Spline Interpolation Quadratic Spline Cubic Spline Fourier Approximation Numerical Methods Lecture 21 Prof. Jinbo Bi CSE, UConn 1.
Chapter 8 Curve Fitting.
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
Karatsuba’s Algorithm for Integer Multiplication
Introduction to Numerical Analysis I MATH/CMPSC 455 Interpolation.
Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values at intermediate.
By Adam Mallen.  What is it?  How is it different from regression?  When would you use it?  What can go wrong?  How do we find the interpolating.
Applied Symbolic Computation1 Applied Symbolic Computation (CS 300) Karatsuba’s Algorithm for Integer Multiplication Jeremy R. Johnson.
Lecture 22 Numerical Analysis. Chapter 5 Interpolation.
Elimination method Solving linear equations simultaneously.
Solving Equations Binomials Simplifying Polynomials
SOLVING SYSTEMS USING ELIMINATION 6-3. Solve the linear system using elimination. 5x – 6y = -32 3x + 6y = 48 (2, 7)
Math 495B Polynomial Interpolation Special case of a step function. Frederic Gibou.
Cryptographic Protocols Secret sharing, Threshold Security
CHAPTER 3 NUMERICAL METHODS
Chapter 4, Integration of Functions
Data manipulation II: Least Squares Fitting
DIFFERENTIAL EQUATIONS
Part 5 - Chapter
Polynomial Interpolation
Curve-Fitting Spline Interpolation
Numerical Analysis Lecture 25.
Chapter 4: Linear Differential Equations
Interpolation Estimation of intermediate values between precise data points. The most common method is: Although there is one and only one nth-order.
Chapter 18.
INTERPOLATION Interpolation produces a function that matches the given data exactly. The function then can be utilized to approximate the data values.
Interpolation.
Chapter 18.
Polynomials and the FFT(UNIT-3)
Numerical Analysis Lecture 45.
Chapter 7 Numerical Differentiation and Integration
MATH 2140 Numerical Methods
Factor and Solve Polynomial Equations
182A – Engineering Mathematics
Numerical Analysis Lecture 23.
POLYNOMIAL INTERPOLATION
Numerical Analysis Lecture 26.
MATH 174: Numerical Analysis
Numerical Analysis Lecture 19.
Regression Lecture-5 Additional chapters of mathematics
INTERPOLASI.
Least Square Regression
Regression and Correlation Analysis
Systems of Equations Solve by Graphing.
Laplace Transforms Lecture-11 Additional chapters of mathematics
Cryptology Design Fundamentals
SKTN 2393 Numerical Methods for Nuclear Engineers
LU Decomposition.
LAGRANGE INTERPOLATING POLYNOMIALS
Solving a System of Linear Equations
Cryptographic Protocols Secret Sharing, Threshold Security
Numerical Analysis Lecture 24.
Interpolation with unequal intervals
Empirical Distributions
Approximation of Functions
Theory of Approximation: Interpolation
Presentation transcript:

Interpolation Practice-6 Additional chapters of mathematics Dmitriy Sergeevich Nikitin Assistant Tomsk Polytechnic University email: NikitinDmSr@yandex.ru

Vandermonde polynomial This Vandermonde polynomial is the most straightforward construction of the interpolating polynomial Pn(x). We simply write Pn(x) = c0xn + c1xn-1 + … + cn. Then we can immediately form n + 1 linear equations for the n + 1 unknown coefficients c0, c1, …, cn using the n + 1 known points: y0 = c0x0n + c1x0n-1 + … cn-1x0 + cn. y1 = c0x1n + c1x1n-1 + … cn-1x1 + cn. … yn = c0xnn + c1xnn-1 + … cn-1xn + cn.

Task 1 Given the following 4 data points, xi 0 1 3 5 yi 1 2 6 7 Find a polynomial in Vandermonde form to interpolate these data. 3

Lagrange Interpolation Polynomial Given (x0, f0) , (x1, f1), …, (xn, fn) with arbitrarily spaced xj. Lagrange had the idea of multiplying each fj by a polynomial that is 1 at xj and 0 at the other n nodes and then taking the sum of these n+1 polynomials. This gives the unique interpolation polynomial of degree n or less. For general n we obtain 𝐟 𝐱 ≈ 𝐩 𝐧 𝐱 = 𝐤=𝟎 𝐧 𝐋 𝐤 (𝐱) 𝐟 𝐤 = 𝐤=𝟎 𝐧 𝐥 𝐤 (𝐱) 𝐥 𝐤 ( 𝐱 𝐤 ) 𝐟 𝐤 where 𝐋 𝐤 𝐱 𝐤 =𝟏 and 𝐋 𝐤 is 0 at the other nodes, and the 𝐋 𝐤 are independent of the function f to be interpolated.

Lagrange Interpolation Polynomial

Task 2 Given the following 4 data points, xi 0 1 3 5 yi 1 2 6 7 Find a polynomial in Lagrange form to interpolate these data. 6

Newton Interpolation Polynomial The Newton polynomial is somewhat more clever than the Vandermonde polynomial because it results in a system of linear equations that is lower triangular, and therefore can be solved by forward substitution. The interpolating polynomial is written in the form which is clearly a polynomial of degree n. The n +1 unknown coefficients given by the c’s can be found by substituting the points (xi, yi) for i = 0, . . . , n:

Newton Interpolation Polynomial

Task 3 Given the following 4 data points, xi 0 1 3 5 yi 1 2 6 7 Find a polynomial in Newton form to interpolate these data. 9

Divided Differences Scheme

Divided Differences Scheme

Task 4 Given the following 4 data points, xi 0 1 3 5 yi 1 2 6 7 Find a polynomial in Newton form to interpolate these data using Divided Differences Scheme. 12

End of Lecture-4