Curve-Fitting Spline Interpolation

Slides:



Advertisements
Similar presentations
Splines and Piecewise Interpolation
Advertisements

Mark Trew CT Halfway Down Halfway down the stairs Is a stair Where I sit. There isn't any Other stair Quite like It. I'm not at the bottom, I'm.
Interpolation A method of constructing a function that crosses through a discrete set of known data points. .
CS 445/645 Fall 2001 Hermite and Bézier Splines. Specifying Curves Control Points –A set of points that influence the curve’s shape Knots –Control points.
Data mining and statistical learning - lecture 6
MATH 685/ CSI 700/ OR 682 Lecture Notes
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
Chapter 18 Interpolation The Islamic University of Gaza
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
1 Curve-Fitting Spline Interpolation. 2 Curve Fitting Regression Linear Regression Polynomial Regression Multiple Linear Regression Non-linear Regression.
Computational Methods in Physics PHYS 3437
ES 240: Scientific and Engineering Computation. InterpolationPolynomial  Definition –a function f(x) that can be written as a finite series of power functions.
Curve-Fitting Interpolation
CURVE FITTING ENGR 351 Numerical Methods for Engineers
Engineering Computation Curve Fitting: Interpolation 1
Curve-Fitting Polynomial Interpolation
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 181 Interpolation Chapter 18 Estimation of intermediate.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 23 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 24 Regression Analysis-Chapter 17.
ECIV 301 Programming & Graphics Numerical Methods for Engineers REVIEW II.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 181 Interpolation.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Interpolation Chapter 18.
Chapter 6 Numerical Interpolation
ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 21 CURVE FITTING Chapter 18 Function Interpolation and Approximation.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 171 Least.
Scientific Computing Linear and Quadratic Splines.
Regression analysis Control of built engineering objects, comparing to the plan Surveying observations – position of points Linear regression Regression.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Today’s class Spline Interpolation Quadratic Spline Cubic Spline Fourier Approximation Numerical Methods Lecture 21 Prof. Jinbo Bi CSE, UConn 1.
CS559: Computer Graphics Lecture 19: Curves Li Zhang Spring 2008.
Lecture 22 Numerical Analysis. Chapter 5 Interpolation.
Computers in Civil Engineering 53:081 Spring 2003 Lecture #15 Spline Interpolation.
Lecture 16 - Approximation Methods CVEN 302 July 15, 2002.
Introduction to Numerical Analysis I MATH/CMPSC 455 Splines.
Mohiuddin Ahmad SUNG-BONG JANG Interpolation II (8.4 SPLINE INTERPOLATION) (8.5 MATLAB’s INTERPOLATION Functions)
Cubic Spline Interpolation. Cubic Splines attempt to solve the problem of the smoothness of a graph as well as reduce error. Polynomial interpolation.
Spline Interpolation A Primer on the Basics by Don Allen.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 4 Chapter 15 General Least Squares and Non- Linear.
CSE 2813 Discrete Structures Solving Recurrence Relations Section 6.2.
By: Mark Coose Joetta Swift Micah Weiss. What Problems Can Interpolation Solve? Given a table of values, find a simple function that passes through the.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 4 Chapter 17 and 18 Interpolation.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Interpolation - Introduction
Computational Methods CMSC/AMSC/MAPL 460 Polynomial Interpolation Ramani Duraiswami, Dept. of Computer Science.
CHAPTER 3 NUMERICAL METHODS
Piecewise Polynomials and Splines
NUMERICAL DIFFERENTIATION Forward Difference Formula
NON LINEAR FUNCTION Quadratic Function.
EEE 244-7: Curve Fitting.
Numerical Analysis Lecture 25.
Interpolation.
Interpolation Estimation of intermediate values between precise data points. The most common method is: Although there is one and only one nth-order.
Chapter 18.
Solving Polynomial Functions
Chapter 15 Curve Fitting : Splines
Reading Between the Lines
Chapter 18.
Today’s class Multiple Variable Linear Regression
Chapter 27.
Spline Interpolation Class XVII.
Linear regression Fitting a straight line to observations.
Numerical Analysis Lecture 23.
Splines and Piecewise Interpolation
Numerical Analysis Lecture 26.
MATH 174: Numerical Analysis
MATH 174: Numerical Analysis I
Splines There are cases where polynomial interpolation is bad
SKTN 2393 Numerical Methods for Nuclear Engineers
Numerical Analysis Lecture 24.
Theory of Approximation: Interpolation
Presentation transcript:

Curve-Fitting Spline Interpolation

Curve Fitting Regression Interpolation Linear Regression Polynomial Regression Multiple Linear Regression Non-linear Regression Interpolation Newton's Divided-Difference Interpolation Lagrange Interpolating Polynomials Spline Interpolation

Spline Interpolation For some cases, polynomials can lead to erroneous results because of round off error and overshoot. Alternative approach is to apply lower-order polynomials to subsets of data points. Such connecting polynomials are called spline functions.

Linear spline (b) Quadratic spline (c) Cubic spline Derivatives are not continuous Not smooth (b) Quadratic spline Continuous 1st derivatives (c) Cubic spline Continuous 1st & 2nd derivatives Smoother

Quadratic Spline

Quadratic Spline Spline of Degree 2 A function Q is called a spline of degree 2 if The domain of Q is an interval [a, b]. Q and Q' are continuous functions on [a, b]. There are points xi (called knots) such that a = x0 < x1 < … < xn = b and Q is a polynomial of degree at most 2 on each subinterval [xi, xi+1]. A quadratic spline is a continuously differentiable piecewise quadratic function.

Exercise Which of the following is a quadratic spline?

Exercise (Solution)

Quadratic Interpolation Observations n+1 points n intervals Each interval is connected by a 2nd-order polynomial Qi(x) = aix2 + bix + ci, i = 0, …, n–1 . Each polynomial has 3 unknowns Altogether there are 3n unknowns Need 3n equations (or conditions) to solve for 3n unknowns

Quadratic Interpolation (3n conditions) Interpolating conditions On each sub interval [xi, xi+1], the function Qi(x) must satisfy the conditions Qi(xi) = f(xi) and Qi(xi+1) = f(xi+1) These conditions yield 2n equations

Quadratic Interpolation (3n conditions) Continuous first derivatives The first derivatives at the interior knots must be equal. This adds n-1 more equations: We now have 2n + (n – 1) = 3n – 1 equations. We need one more equation.

Quadratic Interpolation (3n conditions) Assume the 2nd derivatives is zero at the first point. This gives us the last condition as With this condition selected, the first two points are connected by a straight line. Note: This is not the only possible choice or assumption we can make.

Example Fit quadratic splines to the given data points. i 1 2 3 xi 4.5 1 2 3 xi 4.5 7 9 f(xi) 2.5 0.5 Fit quadratic splines to the given data points.

Example (Solution) 1. Interpolating conditions 2. Continuous first derivatives 3. Assume the 2nd derivatives is zero at the first point.

Example (Solution) We can write the system of equations in matrix form as Notice that the coefficient matrix is sparse.

The system of equations can be solved to yield Example (Solution) The system of equations can be solved to yield Thus the quadratic spline that interpolates the given points is

Efficient way to derive quadratic spline

Efficient way to derive quadratic spline

Efficient way to derive quadratic spline

Cubic Spline Spline of Degree 3 A function S is called a spline of degree 3 if The domain of S is an interval [a, b]. S, S' and S" are continuous functions on [a, b]. There are points ti (called knots) such that a = t0 < t1 < … < tn = b and Q is a polynomial of degree at most 3 on each subinterval [ti, ti+1].

Cubic Spline (4n conditions) Interpolating conditions (2n conditoins). Continuous 1st derivatives (n-1 conditions) The 1st derivatives at the interior knots must be equal. Continuous 2nd derivatives (n-1 conditions) The 2nd derivatives at the interior knots must be equal. Assume the 2nd derivatives at the end points are zero (2 conditions). This condition makes the spline a "natural spline".

Efficient way to derive cubic spline

Summary Advantages of spline interpolation over polynomial interpolation The conditions that are used to derive the quadratic and cubic spline functions Characteristics of cubic spline Overcome the problem of "overshoot" Easier to derive (than high-order polynomial) Smooth (continuous 2nd-order derivatives)