Interpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34
|
|
- Frederick Stevenson
- 5 years ago
- Views:
Transcription
1 Interpolation Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34
2 Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial interpolation (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 2 / 34
3 Introduction Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial interpolation (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 3 / 34
4 Introduction Motivation Often, when solving mathematical problems, we need to get the value of a function in several points. But: it can be expensive in terms of processor use or machine time (for instance, a complicated function which we need to evaluate many times). possibly, we only have the function values in few points (for instance, if they come from data trials). A possible solution is to replace the complicated function by another similar but simpler to evaluate. These simpler functions are polynomials, trigonometric functions,... (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 4 / 34
5 Introduction Interpolation Data: n + 1 different points x 0, x 1,..., x n n + 1 values ω 0, ω 1,..., ω n Problem: Find a (simple) function f verifying f (x i ) = y i with i = 0, 1,..., n. Remarks: x 0, x 1,..., x n are called interpolation nodes ω 0, ω 1,..., ω n can be the values of a function f in the nodes: ω i = f (x i ) i = 0, 1,..., n (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 5 / 34
6 Introduction Example Here, f P 5 is a polynomial of degree 5: (x i,ω i ) P 5 (x 4,ω 4 ) (x 2,ω 2 ) (x 0,ω 0 ) (x 1,ω 1 ) (x 3,ω 3 ) (x 5,ω 5 ) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 6 / 34
7 Introduction Polynomial interpolation If f is a polynomial or a piecewise polynomial function we speak of polynomic interpolation. Main examples: 1 Lagrange interpolation. 2 Piecewise polynomial interpolation. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 7 / 34
8 Lagrange interpolation Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial interpolation (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 8 / 34
9 Lagrange interpolation Lagrange interpolation Data: n + 1 different points x 0, x 1,..., x n n + 1 values ω 0, ω 1,..., ω n Problem: We seek for a polynomial P n of degree at most n verifying P n (x 0 ) = ω 0 P n (x 1 ) = ω 1 P n (x 2 ) = ω 2... P (n) n (x n ) = ω n (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 9 / 34
10 Lagrange interpolation Lagrange linear interpolation (n = 1) Data: 2 different points x 0, x 1 2 values ω 0, ω 1 Problem: Find a polynomial P n of degree at most 1 verifying P 1 (x 0 ) = ω 0 P 1 (x 1 ) = ω 1 y = P 1 (x) is the straight line joining (x 0, ω 0 ) and (x 1, ω 1 ) P 1 (x) = ω 0 + ω 1 ω 0 x 1 x 0 (x 1 x 0 ) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 10 / 34
11 Lagrange interpolation Lagrange interpolation (for any n) Problem: Find a polynomial satisfying P n (x) = a 0 + a 1 x + a 2 x a n x n P n (x 0 ) = ω 0 P n (x 1 ) = ω 1 P n (x 2 ) = ω 2... P n (x n ) = ω n (1) Conditions (1) imply that coefficients solve 1 x 0 x0 2 x n 0 1 x 1 x1 2 x1 n x n xn 2 xn n a 0 a 1. a n = ω 0 ω 1. ω n (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 11 / 34
12 Lagrange interpolation The coefficient matrix is of Vandermonde type: 1 x 0 x0 2 x0 n 1 x 1 x1 2 x1 n A = x n xn 2 xn n, with det (A) = 0 l k n (x k x l ) 0. Therefore, the system has a unique solution which determines P n. P n is the Lagrange interpolation polynomial at x 0, x 1,..., x n relative to the values ω 0, ω 1,..., ω n. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 12 / 34
13 Lagrange interpolation An example of Lagrange interpolation (x i,ω i ) P 1 (x) (x i,ω i ) P 2 (x) (x i,ω i ) P 3 (x) (x i,ω i ) P 4 (x) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 13 / 34
14 Lagrange interpolation Computing the Lagrange s interpolation polynomial Computing the Lagrange s interpolation polynomial Motivation: Solving the Vandermonde system of equations is not efficient and large errors may arise due to bad conditioning. Two ways of computing: Using fundamental Lagrange polynomials. Using divided differences. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 14 / 34
15 Lagrange interpolation Computing the Lagrange s interpolation polynomial Fundamental Lagrange polynomials Fundamental polynomials: For each i = 0, 1,..., n there exists an unique polynomial l i of degree at most n such that l i (x k ) = δ ik (zero if i k, one if i = k): l i (x) = n j = 0 j i x x j x i x j, l 0, l 1,..., l n are the fundamental Lagrange polynomials of degree n. Lagrange formula: Lagrange s polynomial at x 0, x 1,..., x n relative to ω 0, ω 1,..., ω n is P n (x) = ω 0 l 0 (x) + ω 1 l 1 (x) + + ω n l n (x). Remark: If we want to add new nodes, we need to re-compute all the fundamental polynomials. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 15 / 34
16 Lagrange interpolation Computing the Lagrange s interpolation polynomial Example l 0 (x) l 1 (x) l 2 (x) ω 0 l 0 (x) ω 1 l 1 (x) ω 2 l 2 (x) P 2 (x) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 16 / 34
17 Lagrange interpolation Computing the Lagrange s interpolation polynomial Divided differences Divided differences of 0-order [ω i ] = ω i, i = 0, 1,..., n. Divided differences of order 1 Divided differences of order 2 [ω i, ω i+1 ] = ω i+1 ω i x i+1 x i, i = 0, 1,..., n 1. [ω i, ω i+1, ω i+2 ] = [ω i+1, ω i+2 ] [ω i, ω i+1 ] x i+2 x i, i = 0, 1,..., n 2. Divided differences of order k (k = 1,..., n) [ω i, ω i+1,..., ω i+k ] = [ω i+1,..., ω i+k ] [ω i, ω i+1,..., ω i+k 1 ] x i+k x i, i = 0, 1,..., n k. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 17 / 34
18 Lagrange interpolation Computing the Lagrange s interpolation polynomial Newton s formula: Lagrange polynomial at x 0, x 1,..., x n relative to ω 0, ω 1,..., ω n is P n (x) = [ω 0 ] + [ω 0, ω 1 ] (x x 0 ) + [ω 0, ω 1, ω 2 ] (x x 0 ) (x x 1 ) [ω 0, ω 1,..., ω n ] (x x 0 ) (x x 1 ) (x x n 1 ). Consequence: P 0, P 1,..., P n may be computed recursively, adding in each iteration a new term, P n (x) = P n 1 (x) + [ω 0, ω 1,..., ω n ] (x x 0 ) (x x 1 ) (x x n 1 ). Notation: If ω i = f (x i ), with i = 0, 1,..., n, f [x i,..., x i+k ] = [ω i,..., ω i+k ]. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 18 / 34
19 Example Lagrange interpolation Computing the Lagrange s interpolation polynomial P 1 (x) P 2 (x) P 3 (x) P 4 (x) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 19 / 34
20 Error Lagrange interpolation Error Hypothesis: f : [a, b] R is n + 1 times differentiable in [a, b] with continuous derivatives. x 0, x 1,..., x n [a, b]. ω i = f (x i ) for i = 0, 1,..., n. Error estimate: The absolute error satisfies f (x) P n (x) sup f (n+1) (y) (x x 0) (x x 1 ) (x x n ). (n + 1)! y [a,b] (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 20 / 34
21 Piecewise polynomial interpolation Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial interpolation (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 21 / 34
22 Piecewise polynomial interpolation Piecewise polynomial interpolation Motivation: If we increase the number of nodes The Lagrange s interpolation polynomial degree increases as well, generating oscillations. Often, when increasing the number of nodes the error also increases (not intuitive). Estrategy: Use low degree piecewise polynomials. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 22 / 34
23 Piecewise polynomial interpolation Example: oscillations of Lagrange polynomials e x2 (x i,ω i ) P 10 (x) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 23 / 34
24 Piecewise polynomial interpolation Example: piecewise linear interpolation e x2 (x i,ω i ) s (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 24 / 34
25 Piecewise polynomial interpolation Constantwise polynomial interpolation Interpolation by degree zero piecewise polynomials is that in which the polynomials are constant between nodes. For instance, ω 0 if x [x 0, x 1 ), ω 1 if x [x 1, x 2 ), f (x) =... ω n 1 if x [x n 1, x n ), ω 0 if x = x n. Observe that if ω i ω i+1 then f is discontinuous at x i+1. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 25 / 34
26 Piecewise polynomial interpolation Linearwise polynomial interpolation The degree one piecewise polynomial interpolation is that in which the polynomials are straight lines joining two consecutive nodes, for i = 0,..., n 1. f (x) = ωi + (ω i+1 ω i ) x x i x i+1 x i if x [x i, x i+1 ], In this case, f is continuous, but its first derivative is, in general, discontinuous at the nodes. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 26 / 34
27 Piecewise polynomial interpolation Spline interpolation Data: n + 1 points x 0 < x 1 <... < x n. n + 1 values ω 0, ω 1,..., ω n. Problem: Interpolating by splines of order p (or degree p) consists on finding a function f such that: 1 f is p 1 times continuously differentiable in [x0, x n ]. 2 f is a piecewise function given by the polynomials f0, f 1,..., f n 1 defined, respectively, in [x 0, x 1 ], [x 1, x 2 ],..., [x n 1, x n ], and of degree lower or equal to p. 3 Interpolation condition: f 0 (x 0 ) = ω 0,..., f n (x n ) = ω n. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 27 / 34
28 Piecewise polynomial interpolation The problem has solution! Each solution f is called spline interpolator of order p at x 0, x 1,..., x n relative to ω 0, ω 1,..., ω n. The most used spline is that ot third order, known as cubic spline. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 28 / 34
29 Example Piecewise polynomial interpolation Cubic spline sin(x) Lineal Spline (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 29 / 34
30 Piecewise polynomial interpolation Cubic spline Cubic spline Definition: A Cubic spline is a function f such that 1 f is twice continuously differentiable in [x0, x n ]. 2 f0, f 1,..., f n 1 are of degree at most 3. 3 f (x0 ) = ω 0 f (x1 ) = ω 1... f (xn ) = ω n Remarks: In each sub-interval [x i, x i+1 ], the interpolant f is determined from the values of f at x i and x i+1. Such values ( f (x i ) and f (x i+1 )) are obtained by solving a linear system of equations. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 30 / 34
31 Piecewise polynomial interpolation Computing the cubic spline Cubic spline Task: Deduce an algorithm to compute the cubic spline. By definition, f is continuous in [x 0, x n ]. Therefore ω 0 = ω 1 = ω 2 = f f f 0 (x 0) 0 (x 1) = f 1 (x 1) 1 (x 2) = f 2 (x 2) ω n 1 = f n 2 (x n 1) = ω n = f n 1 (x n) f n 1 (x n 1) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 31 / 34
32 Piecewise polynomial interpolation Cubic spline Integrating twice, we get fi (x) = ω i (x i+1 x) 3 + ω (x x i ) 3 i+1 + a i (x i+1 x) + b i (x x i ), 6h i 6h i where a i = ω i ω h i i h i 6, b i = ω i+1 ω h i i+1 h i 6. Therefore, once ω i are known, the cubic spline is fully determined. Using that f is twice continuously differentiable gives the n 1 linear equations h i 6 ω i + h i+1 + h i ω i+1 + h i ω i+2 = ω i ( ) ωi+1 + ω i+2. h i h i+1 h i h i+1 For full determination of the n + 1 values ω i we need two additional equations. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 32 / 34
33 Piecewise polynomial interpolation Cubic spline Natural cubic spline: There are several options to determine uniquely the cubic spline, for instance adding two equations to close the system, fix the value of two unknowns. If the values of ω 0 and ω n are fixed, we talk about natural splines. In this case, ω in = (ω 1,..., ω n ) are solution of Hω in = 6d, where d = ( 1 0,..., n 1 n 2 ), with i = (ω i+1 ω i )/h i, H = 2 (h 0 + h 1 ) h h 1 2 (h 1 + h 2 ) h (h n 3 + h n 2 ) h n h n 2 2 (h n 2 + h n 1 ) (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 33 / 34
34 Error Piecewise polynomial interpolation Error Hypothesis: f : [a, b] R is four times continuously differentiable in [a, b]. x 0, x 1,..., x n [a, b]. Error estimation: Let h = max i=0,...,n h i. Then, for all x [a, b] we have f (x) f (x) c h p+1 max f (p+1) (y), y [a,b] where c is a constant independent of f, x and h. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 34 / 34
Optimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30
Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationCubic 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 information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationScientific 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 informationChapter 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 informationNumerical Mathematics & Computing, 7 Ed. 4.1 Interpolation
Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 November 7, 2011 2011 1 /
More informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
More informationIntroduction 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 informationSome 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(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 informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationChapter 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 informationLectures 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 informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationFunction approximation
Week 9: Monday, Mar 26 Function approximation A common task in scientific computing is to approximate a function. The approximated function might be available only through tabulated data, or it may be
More informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More informationQ1. 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 informationUNIT-II INTERPOLATION & APPROXIMATION
UNIT-II INTERPOLATION & APPROXIMATION LAGRANGE POLYNAMIAL 1. Find the polynomial by using Lagrange s formula and hence find for : 0 1 2 5 : 2 3 12 147 : 0 1 2 5 : 0 3 12 147 Lagrange s interpolation formula,
More informationInterpolation and extrapolation
Interpolation and extrapolation Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University October 30, 207 Interpolation/extrapolation vs fitting Formulation of the problem: there
More informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationChapter 2 Interpolation
Chapter 2 Interpolation Experiments usually produce a discrete set of data points (x i, f i ) which represent the value of a function f (x) for a finite set of arguments {x 0...x n }. If additional data
More information1 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 informationCS 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 informationApplied 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 informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationSPLINE 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 informationMATH 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 informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationGeometric Interpolation by Planar Cubic Polynomials
1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,
More informationNumerical 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 informationOutline. 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 informationLecture 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 informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationGENG2140, 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 informationBSM510 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 informationInput: 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 informationConvergence rates of derivatives of a family of barycentric rational interpolants
Convergence rates of derivatives of a family of barycentric rational interpolants J.-P. Berrut, M. S. Floater and G. Klein University of Fribourg (Switzerland) CMA / IFI, University of Oslo jean-paul.berrut@unifr.ch
More informationMathematics 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 informationLecture 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 informationJim 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 informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationCS 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 informationEmpirical 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 informationInterpolation. 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 informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationCS 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 informationTwo 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 informationINTERPOLATION Background Polynomial Approximation Problem:
INTERPOLATION Background Polynomial Approximation Problem: given f(x) C[a, b], find P n (x) = a 0 + a 1 x + a 2 x 2 + + a n x n with P n (x) close to f(x) for x [a, b]. Motivations: f(x) might be difficult
More informationNumerical Marine Hydrodynamics
Numerical Marine Hydrodynamics Interpolation Lagrange interpolation Triangular families Newton s iteration method Equidistant Interpolation Spline Interpolation Numerical Differentiation Numerical Integration
More informationMath 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 informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
More informationEngineering 7: Introduction to computer programming for scientists and engineers
Engineering 7: Introduction to computer programming for scientists and engineers Interpolation Recap Polynomial interpolation Spline interpolation Regression and Interpolation: learning functions from
More informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationCS412: 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 informationApplied 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 informationIntegration, 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 informationMotivation Subgradient Method Stochastic Subgradient Method. Convex Optimization. Lecture 15 - Gradient Descent in Machine Learning
Convex Optimization Lecture 15 - Gradient Descent in Machine Learning Instructor: Yuanzhang Xiao University of Hawaii at Manoa Fall 2017 1 / 21 Today s Lecture 1 Motivation 2 Subgradient Method 3 Stochastic
More informationChapter 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 informationMA3232 Summary 5. d y1 dy1. MATLAB has a number of built-in functions for solving stiff systems of ODEs. There are ode15s, ode23s, ode23t, ode23tb.
umerical solutions of higher order ODE We can convert a high order ODE into a system of first order ODEs and then apply RK method to solve it. Stiff ODEs Stiffness is a special problem that can arise in
More informationNon-polynomial Least-squares fitting
Applied Math 205 Last time: piecewise polynomial interpolation, least-squares fitting Today: underdetermined least squares, nonlinear least squares Homework 1 (and subsequent homeworks) have several parts
More informationThe Normal Equations. For A R m n with m > n, A T A is singular if and only if A is rank-deficient. 1 Proof:
Applied Math 205 Homework 1 now posted. Due 5 PM on September 26. Last time: piecewise polynomial interpolation, least-squares fitting Today: least-squares, nonlinear least-squares The Normal Equations
More informationNumerical 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 informationSection 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 informationFinite Elements. Colin Cotter. January 18, Colin Cotter FEM
Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted
More informationIntro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University
Interpolation Sanzheng Qiao Department of Computing and Software McMaster University January, 2014 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic
More informationNumerical 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 informationC O M P U L S O R Y R E A D I N G S 1
C O M P U L S O R Y R E A D I N G S 1 1 According to the author of the module, the compulsory readings do not infringe known copyright. COMPILED LIST OF COMPULSORY READINGS 1. Wikipedia: Numerical Methods/Errors
More informationHilbert-Huang and Morlet wavelet transformation
Hilbert-Huang and Morlet wavelet transformation Sonny Lion (sonny.lion@obspm.fr) LESIA, Observatoire de Paris The Hilbert-Huang Transform The main objective of this talk is to serve as a guide for understanding,
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationPreliminary 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 informationMA2501 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 informationAy190 Computational Astrophysics
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of Physics, Mathematics, and Astronomy Ay190 Computational Astrophysics Christian D. Ott and Andrew Benson cott@tapir.caltech.edu, abenson@tapir.caltech.edu
More informationFourier Reconstruction from Non-Uniform Spectral Data
School of Electrical, Computer and Energy Engineering, Arizona State University aditya.v@asu.edu With Profs. Anne Gelb, Doug Cochran and Rosemary Renaut Research supported in part by National Science Foundation
More informationArsène Pérard-Gayot (Slides by Piotr Danilewski)
Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =
More informationPolynomial Interpolation
Chapter Polynomial Interpolation. Introduction Suppose that we have a two sets of n + real numbers {x i } n+ i= and {y i} n+ i=, and that the x i are strictly increasing: x < x < x 2 < < x n. Interpolation
More informationFunction Approximation
1 Function Approximation This is page i Printer: Opaque this 1.1 Introduction In this chapter we discuss approximating functional forms. Both in econometric and in numerical problems, the need for an approximating
More informationComputing the Hausdorff Distance between Two B-Spline Curves. Zachi Shtain
Computing the Hausdorff Distance between Two B-Spline Curves Zachi Shtain Based on the work of: Chen et al. 2010 Definition Given two curves C 1, C 2, their Hausdorff distance is defined as: H Where:,
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More informationLecture 6 September 21, 2016
ICS 643: Advanced Parallel Algorithms Fall 2016 Lecture 6 September 21, 2016 Prof. Nodari Sitchinava Scribe: Tiffany Eulalio 1 Overview In the last lecture, we wrote a non-recursive summation program and
More information1 Lecture 24: Linearization
1 Lecture 24: Linearization 1.1 Outline The linearization of a function at a point a. Linear approximation of the change in f. Error, absolute error. Examples 1.2 Linearization Functions can be complicated.
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Approximation Bézier curves B- 1 Some vocabulary (again ;) Control point : Geometric point that serves as support to the
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationGlobal polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly.
Piecewise polynomial interpolation Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly. In many applications, one does not have the freedom
More informationAutomatic Control Motion planning
Automatic Control Motion planning (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Motivations 2 Electric motors are used in many different applications,
More informationCurve 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 informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
More informationInterpolation Atkinson Chapter 3, Stoer & Bulirsch Chapter 2, Dahlquist & Bjork Chapter 4 Topics marked with are not on the exam
Interpolation Atkinson Chapter 3, Stoer & Bulirsch Chapter 2, Dahlquist & Bjork Chapter 4 Topics marked with are not on the exam 1 Polynomial interpolation, introduction Let {x i } n 0 be distinct real
More informationIntroduction. Region of interest. Linear Lagrange Polynomials
Introduction The derivation and codes in this section are based on a section in Press which ends with references to the papers in which the details were wored out. The fact that the derivatives are continuous
More informationInterpolation. 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 informationName of the Student: Unit I (Solution of Equations and Eigenvalue Problems)
Engineering Mathematics 8 SUBJECT NAME : Numerical Methods SUBJECT CODE : MA6459 MATERIAL NAME : University Questions REGULATION : R3 UPDATED ON : November 7 (Upto N/D 7 Q.P) (Scan the above Q.R code for
More informationUniversity of British Columbia Math 307, Final
1 University of British Columbia Math 307, Final April 23, 2012 3.30-6.00pm Name: Student Number: Signature: Instructor: Instructions: 1. No notes, books or calculators are allowed. A MATLAB/Octave formula
More information