1 / 23

Chapter 3, Interpolation and Extrapolation

Chapter 3, Interpolation and Extrapolation. Interpolation & Extrapolation. (x i ,y i ). Find an analytic function f ( x ) that passes through the given N points exactly. Polynomial Interpolation.

lindo
Download Presentation

Chapter 3, Interpolation and Extrapolation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 3, Interpolation and Extrapolation

  2. Interpolation & Extrapolation (xi,yi) Find an analytic function f(x) that passes through the given N points exactly.

  3. Polynomial Interpolation • Use polynomial of degree N-1 to fit exactly with N data points (xi,yi), i=1, 2, …, N. • The coefficient ci is determined by a system of linear equations

  4. Vandermonde Matrix Equation • But it is not advisable to solve this system numerically because of ill-conditioning.

  5. Condition Number • cond(A) = ||A|| · ||A-1|| • For singular matrix, cond(A) = ∞ • A linear system is ill-conditioned if cond(A) is very large. • Norm || . ||: a real function that satisfies (1) f(A) ≥ 0, (2) f(A+B) ≤ f(A) + f(B), (3) f(A) = || f(A).

  6. Norms • Vector p-norm (p ≥ 1) • Matrix norm sup: supremum

  7. Commonly Used Norms • Vector norm • Matrix norm Where μ is the maximum eigenvalue of matrix ATA.

  8. Lagrange’s Formula • It can be verified that the solution to the Vandermonde equation is given by the formula below: • li(x) has the property li(xj) = δij.

  9. Joseph-Louis Lagrange (1736-1813) Italian-French mathematician associated with many classic mathematics and physics – Lagrange multipliers in minimization of a function, Lagrange’s interpolation formula, Lagrange’s theorem in group theory and number theory, and the Lagrangian (L=T-V) in mechanics and Euler-Lagrange equations.

  10. Neville’s Algorithm • Evaluate Lagrange’s interpolation formula f(x) at x, given the data points (xi,yi). • Interpolation tableau P x1: y1 = P1 P12 x2: y2 = P2P123 P23P1234 x3: y3 = P3P234 P34 x4: y4 = P4 Pi,i+1,i+2,…,i+n is a polynomial of degree n in x that passes through the points (xi,yi), (xi+1,yi+1), …, (xi+n,yi+n) exactly.

  11. Determine P12 from P1 & P2 • Given the value P1 and P2 at x=x1 and x2, we find linear interpolation P12(x) = λ(x) P1+[1-λ(x)] P2 Since P12(x1) = P1 and P12(x2) = P2, we must have λ(x1) = 1, λ(x2) = 0 so λ(x) = λ12= (x-x2)/(x1-x2)

  12. Determine P123 from P12 & P23 • We write P123(x) = λ(x) P12(x) + [1-λ(x)] P23(x) P123(x2) = P2 already for any choice of λ(x). We require that P123(x1)=P12(x1) =P1 and P123(x3)=P23(x3) =P3, thus λ(x1) = 1, λ(x3) = 0 or

  13. Recursion Relation for P • Given two m-point interpolated value P constructed from point i,i+1,i+2,…,i+m-1, and i+1,i+2,…,i+m, the next level m+1 point interpolation from i to i+m is a convex combination:

  14. Use Small Difference C & D P1 C1,1 = P12-P1 P12 D1,1 C2,1=P123-P12 P123 P2 D2,1 C1,2 C3,1=P1234-P123 P23 P1234 D1,2 C2,2 P234 D3,1=P1234-P234 P3 C1,3 D2,2=P234-P34 P34 D1,3 P4

  15. Deriving the Relation among C & D PA D1=PA–P0 C2=P-PA P0 P =λPA + (1-λ)PB C1=PB–P0 D2=P-PB PB

  16. C0,1=1 x1=0, y1=1 =P1 Evaluate f(3) given 4-points (0,1), (1,2), (2,3),(4,0). C1,1 = 3 D0,1=1 C2,1= 0 D1,1= 2 C0,2=2 x2=1, y2=2 =P2 C1,2= 2 C3,1= - 5/4 D2,1= 0 D0,2=2 P1234= 11/4 D1,2= 1 C2,2= -5/3 C0,3=3 D3,1=5/12 x3=2, y3=3 =P3 C1,3= -3/2 D2,2=5/6 D0,3=3 D1,3 = 3/2 C0,4=0 x4=4, y4=0 =P4 D0,4=0

  17. polint( ) Program import math defpolint(xa, ya, n, x, y, dy): c = ya.copy() d = ya.copy() ns = 0 dif = math.fabs(x-xa[0]) for i in range(1,n): dift = math.fabs(x-xa[i]) if (dift < dif): ns = i dif = dift y[0] = ya[ns] ns -= 1

  18. polint(), continued • for m in range(1,n): • for i in range(0,n-m): • ho = xa[i]-x • hp = xa[i+m]-x • w = c[i+1]-d[i] • den = ho - hp • den = w/den • d[i] = hp*den • c[i] = ho*den • if(2*(ns+1) < (n-m)): • dy[0] = c[ns+1] • else: • dy[0] = d[ns] • ns -= 1 • y[0] += dy[0]

  19. Piecewise Linear Interpolation y P23(x) P12(x) (x3,y3) (x2,y2) P34(x) (x4,y4) (x1,y1) P45(x) (x5,y5) x

  20. Piecewise Polynomial Interpolation y Discontinuous derivatives across segment P1234(x) P1234(x) (x3,y3) (x2,y2) P2345(x) (x4,y4) (x1,y1) P2345(x) (x5,y5) x

  21. Cubic Spline • Given N points (xi,yi), i=1,2,…,N, for each interval between points i to i+1, fit to cubic polynomials such that Pi(xi)=yi and Pi(xi+1)=yi+1. • Make 1st and 2nd derivatives continuous across intervals, i.e., Pi(n)(xi+1) = P(n)i+1(xi+1), n = 1 and 2. • Fix boundary condition to P’’(x1 or N)=0, or P’(x1 or N ) = const, to completely specify.

  22. Reading • NR, Chapter 3 • See also J. Stoer and R. Bulirsch, “Introduction to Numerical Analysis,” Chapter 2.

  23. Problems for Lecture 3 (Interpolation) • Use Neville’s algorithm to find the interpolation value at x = 0, for a cubic polynomial interpolation with 4 points (x,y) = (-1,1.25), (1,2), (2,3), (4,0). Also write out the Lagrange’s formula and compute f(0). • 2. Given the same 4 points as above, determine the cubic splines with natural boundary condition (second derivatives equal to 0 at the boundaries). Give the cubic polynomials in each of the three intervals. Use the method outlined in NR page 113 to 116, or a direct fit to cubic polynomials with proper conditions.

More Related