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

Size: px
Start display at page:

Download "Lecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University"

Transcription

1 Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015

2 2

3 Contents 1.1 Introduction Existence and Uniqueness of polynomial interpolation Lagrange Formula Neville s method Newton s divided difference Properties and Derivation of Newton s divided difference Newton s divided difference formula with equi-spaced nodes Error Analysis of Polynomial interpolation Runge Phenomenon Hermit interpolation Hermite interpolation by Newton divided difference Cubic spline interpolation Further reading Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2 dx f(0.520) = , f(0.521) = f(0.522) = , f(0.523) = No f( ) or f( ). How should we do? Census of population: There is no record for How to predict it? General questions: Let (x 0, y 0 ), (x 1, y 1 ),..., (x n, y n ) be given. Given a x which is not in {x 0, x 1,..., x n }, what is the corresponding y? Find a function f(x) such that y 0 = f(x 0 ), y 1 = f(x 1 ),..., y n = f(x n ). 3

4 It s hard. There are too many functions. One solution is to use polynomials since polynomials have nice properties. Polynomial Interpolation: find a polynomial p(x) such that p(x 0 ) = y 0, p(x 1 ) = y 1,..., p(x n ) = y n Theorem 1 (Weierstrass approximation theorem) Suppose that f is defined and continuous on [a, b]. For each ɛ > 0, there exists a polynomial p(x), with the property that f(x) p(x) < ɛ, for all x [a, b] Existence and Uniqueness of polynomial interpolation Questions on polynomial interpolation: Does such a polynomial exist? Generally, you can not find a linear function to interpolate 3 points. If yes, what is the degree? Is it unique? 2 points, linear; 3 points, quadratic; 4 points cubic;... What is a formula for producing p(x) from the given coordinates? Given (x 0, y 0 ),..., (x n, y n ). Polynomial representation p(x) = a 0 + a 1 x + a 2 x a m x m We want to find a 0, a 1,..., a m. m + 1 parameters, n + 1 conditions (p(x i ) = y i ) It is reasonable to try first with n = m. So we want to find a 0, a 1,..., a m such that a 0 + a 1 x 0 + a 2 x a n x n 0 = y 0 a 0 + a 1 x 1 + a 2 x a n x n 1 = y 1 a 0 + a 1 x n + a 2 x 2 n a n x n n = y n Write it into a system of linear equations 1 x 0 x x n 0 a 0 y 0 1 x 1 x x n 1 a 1 y 1 1 x 2 x x n 2 a 2 = y x n x 2 n... x n n a n y n 4.

5 X a = y X Vandermonde matrix. There exists a unique vector such that X a = y is equivalent to det(x) 0. Some fundamental theorems of Algebra (refer to Section 2.6 in the textbook) Theorem 2 If P (x) is a polynomial of degree n 1 with real or complex coefficients, then there exist unique constants x 1,, x k, possibly complex, and unique positive integers m 1, m 2, m k such that k i=1 m i = n and P (x) = a n (x x 1 ) m1 (x x k ) m k Theorem 3 Let P (x) and Q(x) be polynomials of degree at most n. If x 1,, x k, with k > n are distinct numbers with P (x i ) = Q(x i ) for i = 1, 2,, k, then P (x) = Q(x) for all values of x. Theorem 4 Given n + 1 distinct points x 0, x 1,..., x n and the corresponding y 0, y 1,..., y n, there is a polynomial p(x) of degree n such that p(x 0 ) = y 0, p(x 1 ) = y 1,..., p(x n ) = y n. This polynomial is unique among the set of all polynomials of degree n. Why degree n and not n? Why this set? Proof. We will prove that det(x) 0. Let 1 x 0 x x n 0 1 x 1 x x n 1 1 x 2 x x n 2 V n (x) =... 1 x n 1 x 2 n 1... x n n 1 1 x x 2... x n so that X = V n (x n ). We have the claims: 1. V n (x) is a polynomial of degree n. 2. The roots are x 0, x 1,..., x n The coefficients of the term x n is V n 1 (x n 1 ). by 5

6 1. Expand the last row by minor. 2. If two row are the same then det(x) = 0. So V n (x) = (x x 0 )(x x 1 )... (x x n 1 )V n 1 (x n 1 ). By induction, [ ] 1 x0 V 1 (x 1 ) = det = (x 1 x 1 x 0 ) 1 V 2 (x 2 ) = (x 2 x 0 )(x 2 x 1 )(x 1 x 0 ) V 3 (x 3 ) = (x 3 x 0 )(x 3 x 1 )(x 3 x 2 )... V n (x n ) = Π 0 i<j n (x j x i ). Since x 0,..., x n are distinct, det(x) = V n (X n ) Lagrange Formula Find a polynomial P n (x) of order n passes through Method of undetermined coefficients: Need to solve (x 0, y 0 ), (x 1, y 1 ), (x 2, y 2 ),... (x n, y n ). P n (x) = a 0 + a 1 x + a 2 x a n x n. X a = y. Computational cost is high. Gaussian Elimination O(n 3 ). Find fast solvers of the linear equation or explicit expression of a. Use bases other than {1, x, x 2,..., x n }. Two points case: (x 0, y 0 ), (x 1, y 1 ). Construct two linear functions (polynomials of order 1) L 1,0 (x) and L 1,1 (x) such that: L 1,0 (x 0 ) = 1 L 1,0 (x 1 ) = 0 and Then, let We have L 1,1 (x 0 ) = 0 L 1,1 (x 1 ) = 1. P 1 (x) = y 0 L 1,0 (x) + y 1 L 1,1 (x) P 1 (x 0 ) = y 0 L 1,0 (x 0 )+y 1 L 1,1 (x 0 ) = y 0 P 1 (x 1 ) = y 0 L 1,0 (x 1 )+y 1 L 1,1 (x 1 ) = y 1. 6

7 Construct L 1,0 (x): L 1,0 (x) = x x 1 x 0 x 1 ; L 1,1 (x) = x x 0 x 1 x 0. Generalizing this idea to more points, we get Lagrange formula. Given (x 0, y 0 ), (x 1, y 1 ),... (x n, y n ). Construct polynomials L 0 (x), L 1 (x),..., L n (x) of order n such that L n,0 (x 0 ) = 1, L n,0 (x 1 ) = 0, L n,0 (x 2 ) = 0,... L n,0 (x n ) 0. L n,1 (x 0 ) = 0, L n,1 (x 1 ) = 1, L n,1 (x 2 ) = 0,... L n,1 (x n ) 0... L n,i (x i ) = 1, L n,i (x j ) = 0, j i. L n,n (x 0 ) = 0, L n,n (x 1 ) = 0,... L n,n (x n 1 ) = 0, L n,n (x n ) 1. Then construct P n (x) by n P n (x) = y i L n,i (x). i=0 We have P n (x i ) = y i. x 1, x 2,..., x n are the n roots of L n,0 (x), so where C is a constant. To find C, we use L n,0 (x 0 ) = 1. L n,0 (x) = C(x x 1 )(x x 2 )... (x x n ), 1 = L n,0 (x 0 ) = C(x x 1 )(x x 2 )... (x x n ). So Therefore, C = 1 (x 0 x 1 )(x 0 x 2 )... (x 0 x n ) L n,0 (x) = (x x 1)(x x 2 )... (x x n ) (x 0 x 1 )(x 0 x 2 )... (x 0 x n ) = n j=1 (x x j) n j=1 (x 0 x j ) Similarly, n j=0,j i L n,i (x) = (x x j) n j=0,j i (x i x j ) 7

8 Use a graph to illustrate it. Lagrange formula: Given (x 0, y 0 ), (x 1, y 1 ),..., (x n, y n ). Define n n j=0,j i P n (x) = y i (x x j) n j=0,j i (x i x j ). i=0 Example: x 0 = 1, x 1 = 2, x 2 = 4 and the correspondences y 0 = 8, y 1 = 1 and y 2 = 5. Find the polynomial p(x) of order 2 such that y 0 = p(x 0 ), y 1 = p(x 1 ), y 2 = p(x 2 ). (x 2)(x 4) P 2 (x) = 8 (1 2)(1 4) Drawbacks of Lagrange interpolation. 1. Given x, need O(n 2 ) to get P n (x). 1)(x 4) 1)(x 2) +1(x +5(x (2 1)(2 4) (4 1)(4 2) = 3x2 16x No part of the previous calculation can be used. Interpolation for additional values of x requires the same amount of effort as the first value. 3. If we want to add a new point (x n+1, y n+1 ) or delete a point, all the basis L n,i (x) should be changed. 1.3 Neville s method Idea: use previous calculation and generate recursively Lagrange polynomial approximations. Definition 1 Let f be a function defined at x 0, x 1,, x 2,, x n, and suppose that m 1, m 2,, m k are k distinct integers, with 0 m i n for each i. The Lagrange polynomial that agrees with f(x) at the k points x m1, x m2,, x mk is denoted P m1,,m k (x). Theorem 5 Let f be defined at x 0, x 1,, x k, and let x j and x i be two distinct numbers in this set. Then P (x) = (x x j)p 0,1,,j 1,j+1,,k (x) (x x i )P 0,1,,i 1,i+1,,k (x) x i x j (1.1) describes the k-th Lagrange polynomial that interpolates f at the k + 1 points x 0, x 1,, x k. Proof.: Main idea: check the two conditions 1. If P (x) is a polynomial of degree at most k. 8

9 2. If P (x i ) = y i for any i = 0,, k. Remarks The formula (1.1) is generated as an interpolation of two points (x j, P 0,1,,j 1,j+1,,k (x)) and (x i, P 0,1,,i 1,i+1,,k (x)). For ease of notation, let Q i,j = P i j,i j+1,,i denotes the interpolating polynomial of degree j on the j + 1 numbers x i j,, x i 1, x i. Neville s table x 0 P 0 = Q 0,0 x 1 P 1 = Q 1,0 P 0,1 = Q 1,1 x 2 P 2 = Q 2,0 P 1,2 = Q 2,1 P 0,1,2 = Q 2,2 x 1 P 3 = Q 3,0 P 2,3 = Q 3,1 P 1,2,3 = Q 3,2 P 0,1,2,3 = Q 3,3 x 1 P 4 = Q 4,0 P 3,4 = Q 4,1 P 2,3,4 = Q 4,2 P 1,2,3,4 = Q 4,3 P 0,1,2,3,4 = Q 4,4 Neville s Algorithm INPUT: numbers x, x 0,, x n ; values f(x 0 ),, f(x n ) as the first column Q 0,0, Q 1,0,, Q n,0 of Q. OUTPUT: the table Q with P (x) = Q n,n. For i = 1, 2,, n for j = 1, 2,, i Output (Q). Stop. set Q i,j = (x xi j)qi,j 1 (x xi)qi 1,j 1 x i x i j. 1.4 Newton s divided difference method of undetermined coefficient: bases {1, x, x 2,..., x n }. Expand P n (x) = a 0 + a 1 x + a 2 x a n x n. Need to solve a system linear equation to get a i. Each basis doesn t depend on given points. Lagrange: bases {L n,i (x)}, L i (x) are polynomials of degree n and L n,i (x i ) = 1, L n,i (x j ) = 0, j i. 9

10 L n,i (x) = n j=0,j i (x xj) n j=0,j i (xi xj). The corresponding coefficient is y i. Each basis depends on x 0, x 1,..., x i 1, x i+1,..., x n. Less flexibility when a new point (x i+1, y i+1 ) is added. Newton s divided difference Each basis depends on part of the given points. More flexibility when a new point (x i+1, y i+1 ) is added. Newton s divided difference: bases {1, x x 0, (x x 0 )(x x 1 ),..., (x x 0 )(x x 1 )... (x x n 1 )}. We assume P n (x) = c 0 +c 1 (x x 0 )+c 2 (x x 0 )(x x 1 )+...+c n (x x 0 )(x x 1 )... (x x n 1 ). We need to find c i. For c 0, Then, For c 1, So y 0 = P n (x 0 ) = c 0 = c 0 = y 0. P n (x) = y 0 + c 1 (x x 0 ) +... y 1 = P n (x 1 ) = y 0 + c 1 (x 1 x 0 ) c 1 = y 1 y 0 x 1 x 0 For c 2, y 2 = P n (x 2 ) = y 0 + c 1 (x 2 x 0 ) + c 2 (x 2 x 0 )(x 2 x 1 ) So c 2 = y 2 y 0 c 1 (x 2 x 0 ) (x 2 x 0 )(x 2 x 1 ) And so on. Example: (x 0, y 0 ) = (1, 8), (x 1, y 1 ) = (2, 1), (x 2, y 2 ) = (4, 5). c 0 = y 0 = 8. c 1 = (y 1 b 0 )/(x 1 x 0 ) = 7 c 2 = y 2 y 0 b 1 (x 2 x 0 ) (x 2 x 0 )(x 2 x 1 ) = 3. P n (x) = 8 7(x 1) + 3(x 1)(x 2) 10

11 There exists a closed form for c i, i = 0,..., n. Define f[x i ] = y i f[x i, x i+1 ] = f[x i+1] f[x i ] x i+1 x i f[x i, x i+1, x i+2 ] = f[x i+1, x i+2 ] f[x i, x i+1 ] x i+2 x i f[x i, x i+1, x i+2, x i+3 ] = f[x i+1, x i+2, x i+3 ] f[x i, x i+1, x i+2 ] x i+3 x i The proof will be delayed... c 0 = f[x 0 ] c 1 = f[x 0, x 1 ] c i = f[x 0, x 1,..., x i ] c n = f[x 0, x 1,..., x n ] Divided difference table: x 1 f[x 1 ] f[x 1, x 2 ] x 2 f[x 2 ] f[x 1, x 2, x 3 ] f[x 2, x 3 ] f[x 1, x 2, x 3, x 4 ] x 3 f[x 3 ] f[x 2, x 3, x 4 ] f[x 1, x 2, x 3, x 4, x 5 ] f[x 3, x 4 ] f[x 2, x 3, x 4, x 5 ] x 4 f[x 4 ] f[x 3, x 4, x 5 ] f[x 4, x 5 ] x 5 f[x 5 ] Example: Example: Give the example of interpolating f(x) = x on 2, 2.1, 2.2, 2.3,

12 1.4.1 Properties and Derivation of Newton s divided difference We recall Newton s divided difference formula: P n (x) = f[x 0 ] + f[x 0, x 1 ](x x 0 ) + f[x 0, x 1, x 2 ](x x 0 )(x x 1 ) f[x 0,..., x n ](x x 0 )(x x 1 )... (x x n 1 ) Note that adding a new point (x n+1, y n+1 ) we have to add a new line in the divided difference table to get f[x 0,..., x n+1 ]. add a new term f[x 0,..., x n+1 ](x x 0 )(x x 1 )... (x x n ) into the expression of P n (x) to get P n+1. The derivation of Newton divided difference formula is given in the the following theorem Theorem 6 The unique polynomial of order n that passes through (x 0, y 0 ), (x 1, y 1 ),..., (x n, y n ) is given by P n (x) = f[x 0 ] + f[x 0, x 1 ](x x 0 ) + f[x 0, x 1, x 2 ](x x 0 )(x x 1 ) f[x 0,..., x n ](x x 0 )(x x 1 )... (x x n 1 ) Proof. We prove it by induction. The unique polynomial of order 0 that passes through (x 0, y 0 ) is obviously P 0 (x) = y 0 = f[x 0 ]. is Suppose that the polynomial P k (x) of order k that passes through (x 0, y 0 ),(x 1, y 1 ),..., (x k, y k ) P k (x) = f[x 0 ] + f[x 0, x 1 ](x x 0 ) + f[x 0, x 1, x 2 ](x x 0 )(x x 1 ) f[x 0,..., x k ](x x 0 )(x x 1 )... (x x k 1 ) Let P k+1 (x) be the unique polynomial of order k that passes through (x 0, y 0 ), (x 1, y 1 ),..., (x k, y k ), (x k+1, y k+1 ). We claim that P k+1 (x) P k (x) = C(x x 0 )... (x x k ). In fact since both P k+1 (x) and P k (x) pass through the points (x 0, y 0 ),... (x k, y k ), thus x 0,..., x k are zeros of P k+1 (x) P k (x). By the fundamental theorem of algebra, we obtain the above equality. Thus P k+1 (x) = f[x 0 ] + f[x 0, x 1 ](x x 0 ) + f[x 0, x 1, x 2 ](x x 0 )(x x 1 ) f[x 0,..., x k ](x x 0 )(x x 1 )... (x x k 1 ) + C(x x 0 )(x x 1 )... (x x k 1 )(x x k ) 12

13 We only need to show that C = f[x 0, x 1,..., x k, x k+1 ]. For this, let Q k (x) be the unique polynomial of order k that passes through (x 1, y 1 ),..., (x k, y k ), (x k+1, y k+1 ). Define R(x) = P k (x) + x x 0 x k+1 x 0 (Q k (x) P k (x)) Then, R(x) is a polynomial. The order of R(x) is k + 1. R(x 0 ) = P k (x 0 ) = y 0, R(x i ) = P k (x i )+ xi x0 x k+1 x 0 (Q k (x i ) P k (x i )) = P k (x i ) = y i, i = 1,..., k, R(x k+1 ) = Q k (x k+1 ) = y k+1. By the uniqueness, R(x) = P k+1 (x). The leading coefficient of P k+1 (x) is C, while the leading coefficient of R(x) is x x the leading coefficient of 0 x k+1 x 0 (Q k (x) P k (x)), which is 1 x k+1 x 0 (leading coefficient of Q k (x) leading coefficient of P k (x)). On the other hand, the leading coefficient of Q k (x) is f[x 1,..., x k+1 ], and the leading coefficient of P k (x) is f[x 0,..., x k ]. So C = f[x 1,..., x k+1 ] f[x 0,..., x k ] x k+1 x 0 = f[x 0, x 1,..., x k+1 ] Note: f[x 0, x 1,..., x n ] is independent of the order of x 0,..., x n, since it is the leading coefficient of the polynomial P n (x) Newton s divided difference formula with equi-spaced nodes Let h = x i+1 x i, for each i = 0, 1,, n 1 and let x = x 0 + sh. Then the difference x x i = (s i)h. Thus the formula becomes P n (x) =P n (x 0 + sh) = f[x 0 ] + shf[x 0, x 1 ] + s(s 1)h 2 f[x 0, x 1, x 2 ] + + s(s 1)(s n + 1)h n f[x 0, x 1,, x k ] n = s(s 1) (s k + 1)h k f[x 0, x 1,, x k ] k=0 =f[x 0 ] + n k=1 ( s k) k!h k f[x 0, x i,, x k ] (1.2) 13

14 where ( ) s s(s 1) (s k + 1) = k k! is the generalized binomial coefficient notation. This formula (1.2) is called the Newton forward divided difference formula. Now we define Forward difference operator f(x i ) = f(x i+1 ) f(x i ) Higher power k f(x i ) are defined recursively by k f(x i ) = ( k 1 f(x i )), for k 2. Using the notation, the forward divided difference is denoted as and in general f[x 0, x 1 ] = f(x 1) f(x 0 ) x 1 x 0 = 1 h f(x 0) f[x 0, x 1, x 2 ] = 1 f(x 1 ) f(x 0 ) = 1 2h x 1 x 0 2h 2 2 f(x 0 ) f[x 0, x 1,, x k ] = 1 k!h k k f(x 0 ) Newton forward difference formula P n (x) = f(x 0 ) + n k=1 ( s k) k f(x 0 ) If the interpolating nodes are reordered, we can get the back divided difference formula and center-difference formula similarly. Backward difference operator: f(x i ) = f(x i ) f(x i 1 ) for i 1. Similarly k f(x i ) = ( k 1 f(x i )) and P n (x) = f(x n ) + n ( ) ( 1) k s k f(x k n ) k=1 14

15 1.4.3 Error Analysis of Polynomial interpolation We are given x 0, x 1,..., x n, and the corresponding function values f(x 0 ), f(x 1 ),..., f(x n ), but we do not know the expression for the function. Let P n (x) be the polynomial of order n that passes through the n + 1 points (x 0, f(x 0 )), (x 1, f(x 1 )),..., (x n, f(x n )). Questions: What is the error between f(x) and P (x) even we don t know f(x) in advance? Lemma 1 Suppose that x 0, x 1,..., x m are distinct numbers. Let a = min i x i and b = max i x i. Suppose f C m [a, b]. Then, there exist ξ (a, b) such that f[x 0, x 1, x 2,..., x m ] = f (m) (ξ) m! Proof. Let P m (x) be the polynomial that passes through (x 0, f(x 0 )),..., (x m, f(x m )). Then, the function f(x) P m (x) has m + 1 zeros at x 0, x 1,..., x m. So, has m zeros. has m 1 zeros, and so on. has one zero. Denote that zero by ξ. f (x) P m(x) f (x) P m(x) f (m) (x) P m (m) (x) f (m) (ξ) = P m (m) (ξ) P m (x) is a polynomial of order m. Therefore, P (m) m (x) = m!f[x 0,..., x m ] (Recall f[x 0,..., x m ] is the leading coefficient.) We get f (m) (ξ) = P (m) m (ξ) = m!f[x 0,..., x m ]. 15

16 Theorem 7 Suppose that x 0, x 1,..., x n are distinct numbers in [a, b] and f C n+1 [a, b]. Let P n (x) be the unique polynomial of order n that passes through Then, such that (x 0, f(x 0 )), (x 1, f(x 1 )),..., (x n, f(x n )) x [a, b], ξ(x) (a, b) f(x) P n (x) = f (n+1) (ξ(x)) (x x 0 )(x x 1 )... (x x n ). (n + 1)! Proof. We use Newton s divided difference formula to prove it. You can also use Lagrange formula to prove it as shown in the book. If x = x i, i = 0,..., n, it obviously holds. For any z x i, i = 0,..., n, the polynomial of order n+1 that passes through is (x 0, f(x 0 )), (x 1, f(x 1 )),..., (x n, f(x n )), (z, f(z)) Q(x) =f[x 0 ] + f[x 0, x 1 ](x x 0 ) f[x 0, x 1,..., x n ](x x 0 )(x x 1 )... (x x n 1 ) + f[x 0, x 1,..., x n, z](x x 0 )(x x 1 )... (x x n 1 )(x x n ) The polynomial Q(x) passes through (z, f(z)), so f(z) = Q(z) =f[x 0 ] + f[x 0, x 1 ](z x 0 ) f[x 0, x 1,..., x n ](z x 0 )(z x 1 )... (z x n 1 ) + f[x 0, x 1,..., x n, z](z x 0 )(z x 1 )... (z x n 1 )(z x n ) Replace z by x, we get another expression for f(x) as f(x) =f[x 0 ] + f[x 0, x 1 ](x x 0 ) f[x 0, x 1,..., x n ](x x 0 )(x x 1 )... (x x n 1 ) + f[x 0, x 1,..., x n, x](x x 0 )(x x 1 )... (x x n 1 )(x x n ) = P n (x) + f[x 0, x 1,..., x n, x](x x 0 )(x x 1 )... (x x n 1 )(x x n ). By the lemma, there exists ξ (a, b) So, f[x 0, x 1,..., x n, x] = f (n+1) (ξ) (n + 1)!. f(x) = P n (x) + f (n+1) (ξ) (n + 1)! (x x 0)(x x 1 )... (x x n ) Note that the error is related to The maximum value of f (n+1) (x). This can be very large. (Runge Phenomenon) When x is out of [a, b], the error can be very large. (Interpolation vs extrapolation) 16

17 1.4.4 Runge Phenomenon Polynomial approximation may be very poor. 1 Example: f(x) = 1+25x on [ 1, 1]. It is in C. See the plot of f and the 2 interpolation polynomial P 12 (x) with 13 equispaced data in [ 1, 1]. We can see that Figure 1.1: Runge Pheonmenon 1. The error around 1 and 1 becomes larger and larger as n increases. P 12 (0.96) , but f(0.96) The polynomial becomes more oscillating as n increases. This is called Runge s Phenomenon. In practice, the highest degree to be used is 3. Solution: piecewise interpolation (Hermit interpolation, spline interpolation), Chebyshev nodes (Gaussian quadrature). 1.5 Hermit interpolation Osculating polynomials generalize both Taylor polynomials and the Lagrange polynomials. Definition 2 (Osculating interpolation) Suppose that we are given n + 1 distinct numbers x 0, x 1, x n in [a, b] and nonnegative integers m 0, m 1,, m n, and m = max{m 0,, m n }. The osculating polynomial approximating a function f C m [a, b] at x i, for each i = 0,, n, is the polynomial of least degree such that d k P (x i ) dx k = dk f(x i ) dx k 17

18 for each i = 0,, n and k = 0,, m i. If n = 0, the polynomial approximating f is m 0 -th Taylor polynomial for f at x 0. When m i = 0 for each i, the osculating polynomial is the n-th Lagrange polynomial interpolating f on x 0, x 1, x n. The case when m i = 1 for each i = 0, 1, n gives the Hermite polynomials: agree with f and f at x 0,, x n. Theorem 8 If f C 1 [a, b] and x 0,, x n [a, b] are distinct, the unique polynomial of degree at most 2n + 1 given by H 2n+1 (x) = n f(x j )H n,j (x) + j=0 n f (x j )Ĥn,j(x) where H n,j (x) = [1 2(x x j )L n,j (x j)]l n,j (x) 2 and Ĥn,j(x) = (x x j )L n,j (x) 2. In this context, L n,j denotes the j-th Lagrange coefficients polynomial. Moreover, if f C 2n+2 [a, b], then for some ξ with a < ξ < b. j=0 f(x) = H 2n+1 (x) + (x x 0) 2 (x x n ) 2 f (2n+2) (ξ) (2n + 2)! Scratch of proof: 1) show that H n,j (x i ) = δ ij and Ĥn,j(x i ) = 0 for any i, j. 2) Show that H n,j (x i) = 0 and Ĥ n,j (x i) = δ i,j. Although the above theorem provides a complete description of the Hermite polynomials, the computation is too tedious even for small n. Alternative method: use Newton divided difference formula Hermite interpolation by Newton divided difference Suppose that the distinct numbers (x i, f(x i ), f (x i )) for i = 0,, n are given. Procedure: Define a new sequence z 0, z 1, z 2n+1 by z 2i = z 2i+1 = x i, for each i = 0,, 1, n Compute first order divided difference for z i. Since z 2i = z 2i+1 = x i, f[z 2i, z 2i+1 ] is not defined. Instead, set f[z 2i, z 2i+1 ] = f (z 2i ) = f (x i )for each i = 0,, 1, n The remainning divided differences are produced as usual divided difference. 18

19 The Hermite polynomial is given by 2n+1 H 2n+1 = f[z 0 ] + f[z 0,, z k ](x x 0 )(x z 1 ) (x z k 1 ) k=1 See divided difference table for n = 2. z f(z) 1st divided differences 2nd divided z 0 = x 0 f[z 0 ] = f(x 0 ) f[z 0, z 1 ] = f (x 0 ) z 1 = x 0 f[z 1 ] = f(x 0 ) f[z 0, z 1, z 2 ] = f[z1,z2] f[z0,z1] z 2 z 0 f[z 1, z 2 ] = f[z2] f[z1] z 2 z 1 z 2 = x 1 f[z 2 ] = f(x 1 ) f[z 1, z 2, z 3 ] = f[z2,z3] f[z1,z2] z 3 z 1 f[z 2, z 3 ] = f (x 1 ) z 3 = x 1 f[z 3 ] = f(x 1 ) f[z 2, z 3, z 4 ] = f[z3,z4] f[z2,z3] z 4 z 2 f[z 3, z 4 ] = f[z4] f[z3] z 4 z 3 z 4 = x 2 f[z 4 ] = f(x 2 ) f[z 3, z 4, z 5 ] = f[z4,z5] f[z3,z4] z 5 z 3 f[z 4, z 5 ] = f (x 2 ) z 5 = x 2 f[z 5 ] = f(x 2 ) 1.6 Cubic spline interpolation Oscillatory nature of high degree polynomial, and a fluctuation over a small portion can induce large error over the entire range, restricts their use. Alternative approach is to divide the interval into a collection of subintervals and construct different approximating polynomial on each subinterval. Approximation of this type is called piecewise-polynomial approximation. The most commmon piecewise polynomial approximation uses cubic polynomials between each successive pair of nodes and is called cubic spline interpolation. Definition 3 Given a function f defined on [a, b] and a set of nodes a = x 0 < x 1 < < x n = b, a cubic spline interpolant S for f is a function that satisfies the following conditions S(x) a cubic polynomial, denotes S j (x), on the subinterval [x j, x j+1 ] for each j = 0, 1,, n 1. (piecewise cubic polynomails) S j (x j ) = f(x j ) and S j (x j+1 ) = f(x j+1 ) for each j = 0, 1, n 1. (interpolate on each interval). This also implies S j+1 (x j+1 ) = S j (x j+1 ) for each j = 0, 1, n 2. S j+1 (x j+1) = S j (x j+1) for each j = 0, 1,, n 2 S j+1 (x j+1) = S j (x j+1) for each j = 0, 1,, n 2 One of the following sets of boundary conditions is satisfies : 19

20 S (x 0 ) = S (x n ) = 0 (free or natural boundary) S (x 0 ) = f (x 0 ) and S (x n ) = f (x n ) (clamped boundary) Remark: Cubic spline can be constructed as S j (x) = a j + b j (x x j ) + c j (x x j ) 2 + d j (x x j ) 2 for j = 0,, n 1. Determine the coefficients by using the conditions listed above. Theorem 9 If f is defined at a = x 0 < x 1 < < x n = b, then f has a unique natural spline interpolant S on the nodes x 0, x 1,, x n. Theorem 10 If f is defined at a = x 0 < x 1 < < x n = b, then f has a unique clamped spline interpolant S on the nodes x 0, x 1,, x n. 1.7 Further reading Parametric curves: represent general curves by using a parameter to express both the x- and y- coordinate variables. Bezier curves: cubic spline for both x and y coordinates Survey of methods and software: spline functions. Matlab and Maple interp, polyfit, 20

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

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

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

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

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

CHAPTER 4. Interpolation

CHAPTER 4. Interpolation CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given

More information

(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

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

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

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

MA2501 Numerical Methods Spring 2015

MA2501 Numerical Methods Spring 2015 Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive

More information

Chapter 4: Interpolation and Approximation. October 28, 2005

Chapter 4: Interpolation and Approximation. October 28, 2005 Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error

More information

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

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

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

More information

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

We consider the problem of finding a polynomial that interpolates a given set of values: Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.

More information

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

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

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

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

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

BSM510 Numerical Analysis

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

More information

Interpolation 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

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. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning

Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning 76 Chapter 7 Interpolation 7.1 Interpolation Definition 7.1.1. Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t

More information

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

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by 1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How

More information

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

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

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

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

Outline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data

More information

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

3 Interpolation and Polynomial Approximation

3 Interpolation and Polynomial Approximation CHAPTER 3 Interpolation and Polynomial Approximation Introduction A census of the population of the United States is taken every 10 years. The following table lists the population, in thousands of people,

More information

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

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

More information

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

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

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018 Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start

More information

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

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

University of Houston, Department of Mathematics Numerical Analysis, Fall 2005 4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i

More information

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

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

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

More information

Chapter 2 Interpolation

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

NUMERICAL ANALYSIS I. MARTIN LOTZ School of Mathematics The University of Manchester. May 2016

NUMERICAL ANALYSIS I. MARTIN LOTZ School of Mathematics The University of Manchester. May 2016 NUMERICAL ANALYSIS I by MARTIN LOTZ School of Mathematics The University of Manchester May 06 Contents Contents ii Week. Computational Complexity....................... Accuracy...............................

More information

On the positivity of linear weights in WENO approximations. Abstract

On the positivity of linear weights in WENO approximations. Abstract On the positivity of linear weights in WENO approximations Yuanyuan Liu, Chi-Wang Shu and Mengping Zhang 3 Abstract High order accurate weighted essentially non-oscillatory (WENO) schemes have been used

More information

Applied Math 205. Full office hour schedule:

Applied Math 205. Full office hour schedule: Applied Math 205 Full office hour schedule: Rui: Monday 3pm 4:30pm in the IACS lounge Martin: Monday 4:30pm 6pm in the IACS lounge Chris: Tuesday 1pm 3pm in Pierce Hall, Room 305 Nao: Tuesday 3pm 4:30pm

More information

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

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

Interpolation and extrapolation

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

Polynomial Interpolation

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

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

Integration, differentiation, and root finding. Phys 420/580 Lecture 7 Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:

More information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted

More information

Computational Physics

Computational Physics Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function

More information

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

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

More information

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

Section 0.2 & 0.3 Worksheet. Types of Functions

Section 0.2 & 0.3 Worksheet. Types of Functions MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2

More information

Review. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn

Review. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations

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

Applied Math for Engineers

Applied Math for Engineers Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method

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

Introductory Numerical Analysis

Introductory Numerical Analysis Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection

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

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

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

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

More information

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

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

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

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b) Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)

More information

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

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)

More information

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

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

Notes on the Matrix-Tree theorem and Cayley s tree enumerator Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will

More information

Numerical interpolation, extrapolation and fi tting of data

Numerical interpolation, extrapolation and fi tting of data Chapter 6 Numerical interpolation, extrapolation and fi tting of data 6.1 Introduction Numerical interpolation and extrapolation is perhaps one of the most used tools in numerical applications to physics.

More information

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

Lösning: Tenta Numerical Analysis för D, L. FMN011, Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......

More information

2

2 1 Notes for Numerical Analysis Math 54 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 2 Contents 1 Polynomial Interpolation 5 1.1 Review...............................

More information

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016 Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying

More information

MA 3021: Numerical Analysis I Numerical Differentiation and Integration

MA 3021: Numerical Analysis I Numerical Differentiation and Integration MA 3021: Numerical Analysis I Numerical Differentiation and Integration Suh-Yuh Yang ( 楊肅煜 ) Department of Mathematics, National Central University Jhongli District, Taoyuan City 32001, Taiwan syyang@math.ncu.edu.tw

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

Scientific Computing: Numerical Integration

Scientific Computing: Numerical Integration Scientific Computing: Numerical Integration Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Fall 2015 Nov 5th, 2015 A. Donev (Courant Institute) Lecture

More information

Math 660-Lecture 15: Finite element spaces (I)

Math 660-Lecture 15: Finite element spaces (I) Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of

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

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc

More information

Intro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University

Intro 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 July, 2012 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic Spline

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

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx, Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the

More information

CHAPTER 10 Shape Preserving Properties of B-splines

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

More information

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

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and

More information

' Liberty and Umou Ono and Inseparablo "

' Liberty and Umou Ono and Inseparablo 3 5? #< q 8 2 / / ) 9 ) 2 ) > < _ / ] > ) 2 ) ) 5 > x > [ < > < ) > _ ] ]? <

More information

Review I: Interpolation

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

More information

Approximation theory

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

More information

Lecture 3: Basics of set-constrained and unconstrained optimization

Lecture 3: Basics of set-constrained and unconstrained optimization Lecture 3: Basics of set-constrained and unconstrained optimization (Chap 6 from textbook) Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 9, 2018 Optimization basics Outline Optimization

More information

Exam in TMA4215 December 7th 2012

Exam in TMA4215 December 7th 2012 Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed

More information

Numerical Methods I Orthogonal Polynomials

Numerical Methods I Orthogonal Polynomials Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)

More information

Fixed point iteration and root finding

Fixed point iteration and root finding Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given

More information

Application of modified Leja sequences to polynomial interpolation

Application of modified Leja sequences to polynomial interpolation Special Issue for the years of the Padua points, Volume 8 5 Pages 66 74 Application of modified Leja sequences to polynomial interpolation L. P. Bos a M. Caliari a Abstract We discuss several applications

More information

Math Numerical Analysis

Math Numerical Analysis Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University

More information

Finite Elements. Colin Cotter. January 18, Colin Cotter FEM

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

APPM/MATH Problem Set 6 Solutions

APPM/MATH Problem Set 6 Solutions APPM/MATH 460 Problem Set 6 Solutions This assignment is due by 4pm on Wednesday, November 6th You may either turn it in to me in class or in the box outside my office door (ECOT ) Minimal credit will

More information

Numerical Programming I (for CSE)

Numerical Programming I (for CSE) Technische Universität München WT / Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer February 7, Numerical Programming I (for CSE) Repetition ) Floating Point Numbers and Rounding a) Let f : R R

More information

Spring 2012 Introduction to numerical analysis Class notes. Laurent Demanet

Spring 2012 Introduction to numerical analysis Class notes. Laurent Demanet 18.330 Spring 2012 Introduction to numerical analysis Class notes Laurent Demanet Draft April 25, 2014 2 Preface Good additional references are Burden and Faires, Introduction to numerical analysis Suli

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

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

Applied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................

More information