Handout 4 - Interpolation Examples
|
|
- Matilda Cobb
- 5 years ago
- Views:
Transcription
1 Handout 4 - Interpolation Examples Middle East Technical University Example 1: Obtaining the n th Degree Newton s Interpolating Polynomial Passing through (n+1) Data Points Obtain the 4 th degree Newton s interpolating polynomial that passes through the following 5 data points. Interpolate for f(1) and extrapolate for f(6). x : f : Solution: f n (x) = f(x 0 ) + (x x 0 ) f[x 1, x 0 ] + This is value A of the table This is value E of the table (x x 0 )(x x 1 ) f[x 2, x 1, x 0 ] + This is value H of the table (x x 0 )(x x 1 )(x x 2 ) f[x 3, x 2, x 1, x 0 ] + This is value J of the table (x x 0 )(x x 1 )(x x 2 )(x x 3 ) f[x 4, x 3, x 2, x 1, x 0 ] Let s construct the FDD table x f(x) f [, ] f [,, ] f [,,, ] f [,,,, ] x 0 = A E H J x 1 = B F I x 2 = C G x 3 = D x 4 = A = f[x 1, x 0 ] = f(x 1) f(x 0 ) = = x 1 x B = f[x 2, x 1 ] = f(x 2) f(x 1 ) = = x 2 x C = f[x 3, x 2 ] = f(x 3) f(x 2 ) = = x 3 x D = f[x 4, x 3 ] = f(x 4) f(x 3 ) = = x 4 x E = f[x 2, x 1, x 0 ] = F = f[x 3, x 2, x 1 ] = B A x 2 x 0 = C B x 3 x 1 =
2 G = f[x 4, x 3, x 2 ] = H = f[x 3, x 2, x 1, x 0 ] = I = f[x 4, x 3, x 2, x 1 ] = J = f[x 4, x 3, x 2, x 1, x 0 ] = D C x 4 x 2 = F E x 3 x 0 = G F x 4 x 1 = I H = x 4 x 0 The 4 th degree interpolating polynomial is constructed using the 1 st row of the table as follows f 4 (x) = f(x 0 ) + (x x 0 ) A + (x x 0 )(x x 1 ) E + (x x 0 )(x x 1 )(x x 2 ) H + which simplifies to (x x 0 )(x x 1 )(x x 2 )(x x 3 ) J f 4 (x) = x x x x Following plot shows the 5 data points and the 4 th order interpolating polynomial passing through them. Using the obtained f 4 (x), the required interpolation and extrapolation can be done as f 4 (1) = (1) (1) (1) (1) = f 4 (6) = (6) (6) (6) (6) =
3 Important: At this point we can reveal the fact that the provided 5 data points were actually obtained using f = sin(x) function. The following plot compares sin(x) function with the obtained f 4 (x). As seen, in the range [0, 3.5], which is the range of the provided x values, the two functions are almost identical. However, outside this range, where we do extrapolation, the functions deviate from each other considerably. So the conclusion is that extrapolation might yield unexpected results and requires special caution. Example 2: Performing Different Order Interpolations using an Already Constructed FDD Table The following is the FDD table constructed in the previous example. x f f[,] f[,,] f[,,,] f[,,,,] a) Interpolate f(1) using all 5 points, i.e. using a 4 th order polynomial. b) Interpolate f(0.7) using 2 points, i.e. using a 1 st order polynomial. b) Interpolate f(2.8) using 3 points, i.e. using a 2 nd order polynomial. c) Interpolate f(3.2) using 4 points, i.e. using a 3 rd order polynomial. 3
4 Solution: a) This was already done in the previous example. Here x 0 = 0 and the values of the 1 st row of the FDD table is used as shown below. f 4 (1) = (1 x 0 )( ) + (1 x 0 )(1 x 1 )( ) + = (1 x 0 )(1 x 1 )(1 x 2 )( ) + (1 x 0 )(1 x 1 )(1 x 2 )(1 x 3 )( ) b) Two points that surround x = 0.7 are x 0 = 0.5 and x 1 = 1.5. Important: The first point we use for the interpolation is always called x 0. To perform interpolation with these two points, the second row of the table is used. Two-point interpolation only needs the values shown below in the blue box and to get those values only the part of the table inside the red border needs to be constructed. With two points, the following 1 st order polynomial can be used to interpolate f(0.7) f 1 (0.7) = (0.7 x 0 )( ) = Exercise: Show that if we had used all 5 points to interpolate f(0.7) the result would be c) Three points that are closest to x = 2.8 are x 0 = 1.5, x 1 = 3 and x 2 = 3.5. Once again the first point used in the interpolation is called x 0. This time we use the third row of the table. Three-point interpolation only needs the values shown below in the blue box and to get those values only the part of the table inside the red border needs to be constructed. 4
5 With three points, the following 2 nd order polynomial can be used to interpolate f(2.8) f 2 (2.8) = (2.8 x 0 )( ) + (2.8 x 0 )(2.8 x 1 )( ) = Exercise: Show that if we had used all 5 points to interpolate f(2.8) the result would be d) 4 points are the closest to x = 3.2 are x 0 = 0.5, x 1 = 1.5, x 2 = 3.0, x 3 = 3.5. Second row of the table will be used. Four-point interpolation only needs the values shown below in the blue box and to get those values only the part of the table inside the red border needs to be constructed. With four points, the following 3 rd order polynomial can be used to interpolate f(3.2) f 3 (3.2) = (3.2 x 0 )( ) + (3.2 x 0 )(3.2 x 1 )( ) + + (3.2 x 0 )(3.2 x 1 )(3.2 x 2 )( ) = Exercise: Show that if we had used all 5 points to interpolate f(3.2) the result would be Example 3: Lagrange Type Interpolating Functions The following data is given. It is not important here, but the f values are obtained by the function f = ln(x). x : f : a) Interpolate f(4.5) using 1 st order Lagrange type polynomial b) Interpolate f(8) using 2 nd order Lagrange type polynomial 5
6 Solution: a) 1 st order polynomial needs two points. Points that surround x = 4.5 are x 0 = 3 and x 1 = 5. f 1 (4.5) = 4.5 x 1 x 0 x 1 f(x 0 ) x 0 x 1 x 0 f(x 1 ) f 1 (4.5) = ( ) + ( ) = b) We need 3 points that surround x = 8. x 0 = 5, x 1 = 7 and x 2 = 10 can be used f 2 (8) = (8 x 1)(8 x 2 ) (x 0 x 1 )(x 0 x 2 ) f(x 0) + (8 x 0)(8 x 2 ) (x 1 x 0 )(x 1 x 2 ) f(x 1) + (8 x 0)(8 x 1 ) (x 2 x 0 )(x 2 x 1 ) f(x 2) f 2 (8) = (8 7)(8 10) (8 5)(8 10) (8 5)(8 7) ( ) + ( ) + (5 7)(5 10) (7 5)(7 10) (10 5)(10 7) ( ) = Exercise: Perform these interpolations by constructing FDD tables and show that identical results can be obtained. Example 4: Spline Interpolation Following data is given x : f : a) Interpolate f(13) and f(17) using linear splines. b) Interpolate f(13) and f(17) using quadratic splines. Solution: a) Linear splines are just straight lines joining the sequential points of the data set. To interpolate f(13), we need to use x 0 = 11 and x 1 = 15 f(13) = f(x 0 ) + f(x 1) f(x 0 ) (13 x x 1 x 0 ) = (13 11) = To interpolate f(17), we need to use x 0 = 15 and x 1 = 18 f(17) = f(x 0 ) + f(x 1) f(x 0 ) (17 x x 1 x 0 ) = (17 15) = Graphically these interpolations look like the following. Red dots are the data points and the blue ones are the interpolations. 6
7 b) There are n + 1 = 4 data points. In between there are n = 3 intervals with one quadratic polynomial in each. Each quadratic polynomial has 3 unknown coefficients to be determined. Totally there are 3n = 9 unknown coefficients. To find them we need to setup a system of 9 equations. Polynomials over the intervals are Interval 1 (8 x 11) : a 1 x 2 + b 1 x + c 1 Interval 2 (11 x 15) : a 2 x 2 + b 2 x + c 2 Interval 3 (15 x 18) : a 3 x 2 + b 3 x + c 3 At the knots (x = 8, 11, 15, 18), the splines must take the provided f values. At knot 0 (x = 8) : a 1 (8 2 ) + b 1 (8) + c 1 = 5 Eqn (1) At knot 1 (x = 11) : a 1 (11 2 ) + b 1 (11) + c 1 = 9 Eqn (2) a 2 (11 2 ) + b 2 (11) + c 2 = 9 Eqn (3) At knot 2 (x = 15) : a 2 (15 2 ) + b 2 (15) + c 2 = 10 Eqn (4) a 3 (15 2 ) + b 3 (15) + c 3 = 10 Eqn (5) At knot 3 (x = 18) : a 3 (18 2 ) + b 3 (18) + c 3 = 9 Eqn (6) At the interior knots (x = 11, 15), first derivatives of the right and left splines must be equal. At knot 1 (x = 11) : 2a 1 (11) + b 1 = 2a 2 (11) + b 2 Eqn (7) At knot 2 (x = 15) : 2a 2 (15) + b 2 = 2a 3 (15) + b 3 Eqn (8) For the last equation we set a 1 = 0, i.e. we force the first spline to be a straight line. Therefore, actually there are not 9 but 8 unknowns and 8 equations. The equations system that needs to be solved and the solution are shown below 7
8 b 1 c 1 a 2 b 2 c 2 a b 3 [ ] { c 3 } = { 0 } Middle East Technical University b 1 c 1 a 2 b 2 c 2 a 3 b 3 { c 3 } = { } With this solution, the equations of the splines in each interval are Spline 1 (8 x 11) : x Spline 2 (11 x 15) : x x Spline 3 (15 x 18) : x x + 60 To interpolate f(13) we need to use the 2 nd spline f(13) = (13) (13) = To interpolate f(17) we need to use the 3 rd spline f(17) = (17) (17) + 60 = The splines and the interpolated values are as follows. Red dots are the given data points and the blue ones are the interpolations. 8
9 Exercise: Repeat the solution with cubic splines and obtain the following results f(13) = , f(17) = Middle East Technical University The cubic splines that you are asked to determine are shown below. The overshoot of the quadratic splines in the 2 nd interval seen before does not exist here. Also this one behaves considerably different in the 3 rd interval. In general, it oscillates less. Exercise: Obtain the 3 rd order interpolating polynomial and draw it. Also calculate f(13) and f(17) with it. 9
ME 261: Numerical Analysis Lecture-12: Numerical Interpolation
1 ME 261: Numerical Analysis Lecture-12: Numerical Interpolation Md. Tanver Hossain Department of Mechanical Engineering, BUET http://tantusher.buet.ac.bd 2 Inverse Interpolation Problem : Given a table
More informationInterpolation by Spline Functions
Interpolation by Spline Functions Com S 477/577 Sep 0 007 High-degree polynomials tend to have large oscillations which are not the characteristics of the original data. To yield smooth interpolating curves
More informationFour equations are necessary to evaluate these coefficients. Eqn
1.2 Splines 11 A spline function is a piecewise defined function with certain smoothness conditions [Cheney]. A wide variety of functions is potentially possible; polynomial functions are almost exclusively
More informationConsider functions such that then satisfies these properties: So is represented by the cubic polynomials on on and on.
1 of 9 3/1/2006 2:28 PM ne previo Next: Trigonometric Interpolation Up: Spline Interpolation Previous: Piecewise Linear Case Cubic Splines A piece-wise technique which is very popular. Recall the philosophy
More informationEngineering Analysis ENG 3420 Fall Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00
Engineering Analysis ENG 3420 Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 11:00-12:00 1 Lecture 24 Attention: The last homework HW5 and the last project are due on Tuesday November
More informationlecture 10: B-Splines
9 lecture : -Splines -Splines: a basis for splines Throughout our discussion of standard polynomial interpolation, we viewed P n as a linear space of dimension n +, and then expressed the unique interpolating
More information8 Piecewise Polynomial Interpolation
Applied Math Notes by R. J. LeVeque 8 Piecewise Polynomial Interpolation 8. Pitfalls of high order interpolation Suppose we know the value of a function at several points on an interval and we wish to
More informationLecture 8. Divided Differences,Least-Squares Approximations. Ceng375 Numerical Computations at December 9, 2010
Lecture 8, Ceng375 Numerical Computations at December 9, 2010 Computer Engineering Department Çankaya University 8.1 Contents 1 2 3 8.2 : These provide a more efficient way to construct an interpolating
More informationLecture 9. Curve fitting. Interpolation. Lecture in Numerical Methods from 28. April 2015 UVT. Lecture 9. Numerical. Interpolation his o
Curve fitting. Lecture in Methods from 28. April 2015 to ity Interpolation FIGURE A S Splines Piecewise relat UVT Agenda of today s lecture 1 Interpolation Idea 2 3 4 5 6 Splines Piecewise Interpolation
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationLECTURE NOTES - SPLINE INTERPOLATION. 1. Introduction. Problems can arise when a single high-degree polynomial is fit to a large number
LECTURE NOTES - SPLINE INTERPOLATION DR MAZHAR IQBAL 1 Introduction Problems can arise when a single high-degree polynomial is fit to a large number of points High-degree polynomials would obviously pass
More informationAPPM/MATH Problem Set 4 Solutions
APPM/MATH 465 Problem Set 4 Solutions This assignment is due by 4pm on Wednesday, October 16th. You may either turn it in to me in class on Monday or in the box outside my office door (ECOT 35). Minimal
More informationES 240: Scientific and Engineering Computation. a function f(x) that can be written as a finite series of power functions like
Polynomial Deinition a unction () that can be written as a inite series o power unctions like n is a polynomial o order n n ( ) = A polynomial is represented by coeicient vector rom highest power. p=[3-5
More informationInterpolation - 2D mapping Tutorial 1: triangulation
Tutorial 1: triangulation Measurements (Zk) at irregular points (xk, yk) Ex: CTD stations, mooring, etc... The known Data How to compute some values on the regular spaced grid points (+)? The unknown data
More informationInterpolation. TANA09 Lecture 7. Error analysis for linear interpolation. Linear Interpolation. Suppose we have a table x x 1 x 2...
TANA9 Lecture 7 Interpolation Suppose we have a table x x x... x n+ Interpolation Introduction. Polynomials. Error estimates. Runge s phenomena. Application - Equation solving. Spline functions and interpolation.
More informationAssignment 2. with (a) (10 pts) naive Gauss elimination, (b) (10 pts) Gauss with partial pivoting
Assignment (Be sure to observe the rules about handing in homework). Solve: with (a) ( pts) naive Gauss elimination, (b) ( pts) Gauss with partial pivoting *You need to show all of the steps manually.
More informationHomework #6 Brief Solutions 2012
Homework #6 Brief Solutions %page 95 problem 4 data=[-,;-,;,;4,] data = - - 4 xk=data(:,);yk=data(:,);s=csfit(xk,yk,-,) %Using the program to find the coefficients S =.456 -.456 -.. -.5.9 -.5484. -.58.87.
More informationInteractive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1
Interactive Graphics Lecture 9: Introduction to Spline Curves Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 13: Slide 2 Splines The word spline comes from the ship building trade
More informationHandout 2 - Root Finding using MATLAB
Handout 2 - Root Finding using MATLAB Middle East Technical University MATLAB has couple of built-in root finding functions. In this handout we ll have a look at fzero, roots and solve functions. It is
More informationMultiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET
Multiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET 1. The ollowing n data points, ( x ), ( x ),.. ( x, ) 1, y 1, y n y n quadratic spline interpolation the x-data needs to be (A) equally
More informationMaximizing an interpolating quadratic
Week 11: Monday, Apr 9 Maximizing an interpolating quadratic Suppose that a function f is evaluated on a reasonably fine, uniform mesh {x i } n i=0 with spacing h = x i+1 x i. How can we find any local
More informationRemark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331
Remark Reconsidering the motivating example, we observe that the derivatives are typically not given by the problem specification. However, they can be estimated in a pre-processing step. A good estimate
More information99 International Journal of Engineering, Science and Mathematics
Journal Homepage: Applications of cubic splines in the numerical solution of polynomials Najmuddin Ahmad 1 and Khan Farah Deeba 2 Department of Mathematics Integral University Lucknow Abstract: In this
More informationPolynomials tend to oscillate (wiggle) a lot, even when our true function does not.
AMSC/CMSC 460 Computational Methods, Fall 2007 UNIT 2: Spline Approximations Dianne P O Leary c 2001, 2002, 2007 Piecewise polynomial interpolation Piecewise polynomial interpolation Read: Chapter 3 Skip:
More informationNatural Quartic Spline
Natural Quartic Spline Rafael E Banchs INTRODUCTION This report describes the natural quartic spline algorithm developed for the enhanced solution of the Time Harmonic Field Electric Logging problem As
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationPolynomial Approximation and Interpolation Chapter 4
4.4 LAGRANGE POLYNOMIALS The direct fit polynomial presented in Section 4.3, while quite straightforward in principle, has several disadvantages. It requires a considerable amount of effort to solve the
More informationThis expression is known as the Newton form of the interpolating polynomial. How do we go about finding the coefficients c i?
Chapter 1 Polynomial Interpolation When you are wrestling for possession of a sword, the man with the handle always wins. Neal Stephenson, Snow Crash The goal of interpolation is to fit a function exactly
More informationCubic spline interpolation
Cubic spline interpolation In the following, we want to derive the collocation matrix for cubic spline interpolation. Let us assume that we have equidistant knots. To fulfill the Schoenberg-Whitney condition
More informationf( x ), or a solution to the equation f( x) 0. You are already familiar with ways of solving
The Bisection Method and Newton s Method. If f( x ) a function, then a number r for which f( r) 0 is called a zero or a root of the function f( x ), or a solution to the equation f( x) 0. You are already
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationSection 5.5 Piecewise Interpolation
Section 5.5 Piecewise Interpolation Key terms Runge phenomena polynomial wiggle problem Piecewise polynomial interpolation We have considered polynomial interpolation to sets of distinct data like {( )
More informationSplines and Piecewise Interpolation. Hsiao-Lung Chan Dept Electrical Engineering Chang Gung University, Taiwan
Splines and Piecewise Interpolation Hsiao-Lung Chan Dept Electrical Engineering Chang Gung University, Taiwan chanhl@mail.cgu.edu.tw Splines n 1 intervals and n data points 2 Splines (cont.) Go through
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationNumerical Integration
Numerical Integration Numerical Integration is the process of computing the value of a definite integral, when the values of the integrand function, are given at some tabular points. As in the case of
More informationJustify all your answers and write down all important steps. Unsupported answers will be disregarded.
Numerical Analysis FMN011 2017/05/30 The exam lasts 5 hours and has 15 questions. A minimum of 35 points out of the total 70 are required to get a passing grade. These points will be added to those you
More informationWarm-Up Exercises. Find the x-intercept and y-intercept 1. 3x 5y = 15 ANSWER 5; y = 2x + 7 ANSWER ; 7
Warm-Up Exercises Find the x-intercept and y-intercept 1. 3x 5y = 15 ANSWER 5; 3 2. y = 2x + 7 7 2 ANSWER ; 7 Chapter 1.1 Graph Quadratic Functions in Standard Form A quadratic function is a function that
More informationImportant Properties of B-spline Basis Functions
Important Properties of B-spline Basis Functions P2.1 N i,p (u) = 0 if u is outside the interval [u i, u i+p+1 ) (local support property). For example, note that N 1,3 is a combination of N 1,0, N 2,0,
More informationQUADRATIC FUNCTIONS. PROTOTYPE: f(x) = ax 2 + bx + c. (1) The leading coefficient a 0 is called the shape parameter.
QUADRATIC FUNCTIONS PROTOTYPE: f(x) = ax 2 + bx + c. (1) The leading coefficient a 0 is called the shape parameter. SHAPE-VERTEX FORMULA One can write any quadratic function (1) as f(x) = a(x h) 2 + k,
More informationCS348a: Computer Graphics Handout #24 Geometric Modeling Original Handout #20 Stanford University Tuesday, 27 October 1992
CS348a: Computer Graphics Handout #24 Geometric Modeling Original Handout #20 Stanford University Tuesday, 27 October 1992 Original Lecture #9: 29 October 1992 Topics: B-Splines Scribe: Brad Adelberg 1
More informationCentral issues in modelling
Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction includes: manual modelling; fitting to
More informationCS 450 Numerical Analysis. Chapter 7: Interpolation
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 informationCubic Spline Questions
Cubic Spline Questions. Find natural cubic splines which interpolate the following dataset of, points:.0,.,.,.0, 7.0,.,.0,0.; estimate the value for. Solution: Step : Use the n- cubic spline equations
More informationHomework #6 Brief Solutions 2011
Homework #6 Brief Solutions %page 95 problem 4 data=[-,;-,;,;4,] data = - - 4 xk=data(:,);yk=data(:,);s=csfit(xk,yk,-,) %Using the program to find the coefficients S =.456 -.456 -.. -.5.9 -.5484. -.58.87.
More informationFebruary 23 Math 2335 sec 51 Spring 2016
February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.
More informationUsing LoggerPro. Nothing is more terrible than to see ignorance in action. J. W. Goethe ( )
Using LoggerPro Nothing is more terrible than to see ignorance in action. J. W. Goethe (1749-1832) LoggerPro is a general-purpose program for acquiring, graphing and analyzing data. It can accept input
More informationRunge Example Revisited for Splines
Runge Example Revisited for Splines The Runge function f(x) = +25x on [, ] provided an very nice function that was not wellapproximated by its polynomials of interpolation. In fact, a higher degree (more
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationan interpolating polynomial P (x) for f(x) Issues: how to find, represent, compute P (x); errors?
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 informationComputer Graphics. Curves and Surfaces. Hermite/Bezier Curves, (B-)Splines, and NURBS. By Ulf Assarsson
Computer Graphics Curves and Surfaces Hermite/Bezier Curves, (B-)Splines, and NURBS By Ulf Assarsson Most of the material is originally made by Edward Angel and is adapted to this course by Ulf Assarsson.
More informationDerivative. Bernstein polynomials: Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 313
Derivative Bernstein polynomials: 120202: ESM4A - Numerical Methods 313 Derivative Bézier curve (over [0,1]): with differences. being the first forward 120202: ESM4A - Numerical Methods 314 Derivative
More informationSplines, or: Connecting the Dots. Jens Ogniewski Information Coding Group
Splines, or: Connecting the Dots Jens Ogniewski Information Coding Group Note that not all is covered in the book, especially Change of Interpolation Centripetal Catmull-Rom and other advanced parameterization
More informationComputational Physics PHYS 420
Computational Physics PHYS 420 Dr Richard H. Cyburt Assistant Professor of Physics My office: 402c in the Science Building My phone: (304) 384-6006 My email: rcyburt@concord.edu My webpage: www.concord.edu/rcyburt
More informationCubic Splines and Matlab
Cubic Splines and Matlab October 7, 2006 1 Introduction In this section, we introduce the concept of the cubic spline, and how they are implemented in Matlab. Of particular importance are the new Matlab
More informationUnit 1 Day 4 Notes Piecewise Functions
AFM Unit 1 Day 4 Notes Piecewise Functions Name Date We have seen many graphs that are expressed as single equations and are continuous over a domain of the Real numbers. We have also seen the "discrete"
More informationRational Bezier Curves
Rational Bezier Curves Use of homogeneous coordinates Rational spline curve: define a curve in one higher dimension space, project it down on the homogenizing variable Mathematical formulation: n P(u)
More informationCS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside Blending Functions Blending functions are more convenient basis than monomial basis canonical form (monomial
More informationData Table from an Equation
1 Data Table from an Equation How do you create a data table from an equation - to present and export the values - to plot the data We will look at these features in SigmaPlot 1. Linear Regression 2. Regression
More information. As x gets really large, the last terms drops off and f(x) ½x
Pre-AP Algebra 2 Unit 8 -Lesson 3 End behavior of rational functions Objectives: Students will be able to: Determine end behavior by dividing and seeing what terms drop out as x Know that there will be
More informationVideo 11.1 Vijay Kumar. Property of University of Pennsylvania, Vijay Kumar
Video 11.1 Vijay Kumar 1 Smooth three dimensional trajectories START INT. POSITION INT. POSITION GOAL Applications Trajectory generation in robotics Planning trajectories for quad rotors 2 Motion Planning
More informationMath 226A Homework 4 Due Monday, December 11th
Math 226A Homework 4 Due Monday, December 11th 1. (a) Show that the polynomial 2 n (T n+1 (x) T n 1 (x)), is the unique monic polynomial of degree n + 1 with roots at the Chebyshev points x k = cos ( )
More information1. How many white tiles will be in Design 5 of the pattern? Explain your reasoning.
Algebra 2 Semester 1 Review Answer the question for each pattern. 1. How many white tiles will be in Design 5 of the pattern Explain your reasoning. 2. What is another way to represent the expression 3.
More informationComputer Graphics. Unit VI: Curves And Fractals. By Vaishali Kolhe
Computer Graphics Unit VI: Curves And Fractals Introduction Two approaches to generate curved line 1. Curve generation algorithm Ex. DDA Arc generation algorithm 2. Approximate curve by number of straight
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken 24th May 2002 2 Contents 1 Splines and B-splines an introduction 3 1.1 Convex combinations and convex hulls..................... 3 1.1.1 Stable computations...........................
More informationNumerical Analysis Fall. Numerical Differentiation
Numerical Analysis 5 Fall Numerical Differentiation Differentiation The mathematical definition of a derivative begins with a difference approimation: and as is allowed to approach zero, the difference
More informationA New Look at Multivariable Interpolation
Page 1 A New Look at Multivariable Interpolation By Namir Shammas Introduction Interpolation using a single independent variable usually involves using legacy algorithm such as the Lagrangian Interpolation,
More informationChapter 12: Quadratic and Cubic Graphs
Chapter 12: Quadratic and Cubic Graphs Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2y 2 + 9y + 2 All the above equations contain a squared number. They are therefore called quadratic
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken January 5, 2005 2 Contents 1 Splines and B-splines an Introduction 3 1.1 Convex combinations and convex hulls.................... 3 1.1.1 Stable computations...........................
More informationSplines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes
CSCI 420 Computer Graphics Lecture 8 Splines Jernej Barbic University of Southern California Hermite Splines Bezier Splines Catmull-Rom Splines Other Cubic Splines [Angel Ch 12.4-12.12] Roller coaster
More informationSpline Methods Draft. Tom Lyche and Knut Mørken. Department of Informatics Centre of Mathematics for Applications University of Oslo
Spline Methods Draft Tom Lyche and Knut Mørken Department of Informatics Centre of Mathematics for Applications University of Oslo January 27, 2006 Contents 1 Splines and B-splines an Introduction 1 1.1
More informationCHAOS Chaos Chaos Iterate
CHAOS Chaos is a program that explores data analysis. A sequence of points is created which can be analyzed via one of the following five modes: 1. Time Series Mode, which plots a time series graph, that
More informationEvaluating the polynomial at a point
Evaluating the polynomial at a point Recall that we have a data structure for each piecewise polynomial (linear, quadratic, cubic and cubic Hermite). We have a routine that sets evenly spaced interpolation
More informationEXAMPLE. 1. Enter y = x 2 + 8x + 9.
VI. FINDING INTERCEPTS OF GRAPHS As we have seen, TRACE allows us to find a specific point on the graph. Thus TRACE can be used to solve a number of important problems in algebra. For example, it can be
More information08 - Designing Approximating Curves
08 - Designing Approximating Curves Acknowledgement: Olga Sorkine-Hornung, Alexander Sorkine-Hornung, Ilya Baran Last time Interpolating curves Monomials Lagrange Hermite Different control types Polynomials
More informationB-Spline Polynomials. B-Spline Polynomials. Uniform Cubic B-Spline Curves CS 460. Computer Graphics
CS 460 B-Spline Polynomials Computer Graphics Professor Richard Eckert March 24, 2004 B-Spline Polynomials Want local control Smoother curves B-spline curves: Segmented approximating curve 4 control points
More informationLecture 4.5: Interpolation and Splines
Lecture 4.5: Interpolation and Splines D. Jason Koskinen koskinen@nbi.ku.dk Photo by Howard Jackman University of Copenhagen Advanced Methods in Applied Statistics Feb - Apr 2018 Niels Bohr Institute 2
More informationCurves and Surfaces 1
Curves and Surfaces 1 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized Modeling Techniques 2 The Teapot 3 Representing
More informationCubic Splines By Dave Slomer
Cubic Splines By Dave Slomer [Note: Before starting any example or exercise below, press g on the home screen to Clear a-z.] Curve fitting, the process of finding a function that passes through (or near)
More informationI. Function Characteristics
I. Function Characteristics Interval of possible x values for a given function. (Left,Right) Interval of possible y values for a given function. (down, up) What is happening at the far ends of the graph?
More informationKnow it. Control points. B Spline surfaces. Implicit surfaces
Know it 15 B Spline Cur 14 13 12 11 Parametric curves Catmull clark subdivision Parametric surfaces Interpolating curves 10 9 8 7 6 5 4 3 2 Control points B Spline surfaces Implicit surfaces Bezier surfaces
More informationMA 323 Geometric Modelling Course Notes: Day 10 Higher Order Polynomial Curves
MA 323 Geometric Modelling Course Notes: Day 10 Higher Order Polynomial Curves David L. Finn December 14th, 2004 Yesterday, we introduced quintic Hermite curves as a higher order variant of cubic Hermite
More informationYear 10 General Mathematics Unit 2
Year 11 General Maths Year 10 General Mathematics Unit 2 Bivariate Data Chapter 4 Chapter Four 1 st Edition 2 nd Edition 2013 4A 1, 2, 3, 4, 6, 7, 8, 9, 10, 11 1, 2, 3, 4, 6, 7, 8, 9, 10, 11 2F (FM) 1,
More informationFall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.
Fall 2014 CSCI 420: Computer Graphics 4.2 Splines Hao Li http://cs420.hao-li.com 1 Roller coaster Next programming assignment involves creating a 3D roller coaster animation We must model the 3D curve
More informationCurves and Surfaces Computer Graphics I Lecture 9
15-462 Computer Graphics I Lecture 9 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] February 19, 2002 Frank Pfenning Carnegie
More informationDesign considerations
Curves Design considerations local control of shape design each segment independently smoothness and continuity ability to evaluate derivatives stability small change in input leads to small change in
More informationa 2 + 2a - 6 r r 2 To draw quadratic graphs, we shall be using the method we used for drawing the straight line graphs.
Chapter 12: Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2 2 + 9 + 2 All the above equations contain a squared number. The are therefore called quadratic expressions or quadratic
More informationRepresenting Curves Part II. Foley & Van Dam, Chapter 11
Representing Curves Part II Foley & Van Dam, Chapter 11 Representing Curves Polynomial Splines Bezier Curves Cardinal Splines Uniform, non rational B-Splines Drawing Curves Applications of Bezier splines
More informationSee the course website for important information about collaboration and late policies, as well as where and when to turn in assignments.
COS Homework # Due Tuesday, February rd See the course website for important information about collaboration and late policies, as well as where and when to turn in assignments. Data files The questions
More informationNEW CONCEPTS LEARNED IN THIS LESSON INCLUDE: Fundamental Theorem of Algebra
2.5. Graphs of polynomial functions. In the following lesson you will learn to sketch graphs by understanding what controls their behavior. More precise graphs will be developed in the next two lessons
More informationIn this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include
Parametric Curves and Surfaces In this course we will need a set of techniques to represent curves and surfaces in 2-d and 3-d. Some reasons for this include Describing curves in space that objects move
More informationElementary Functions
Elementary Functions Part 1, Functions Lecture 1.2a, Graphs of Functions: Introduction Dr. Ken W. Smith Sam Houston State University Spring 2013 Smith (SHSU) Elementary Functions Spring 2013 1 / 37 Representing
More informationInformation Coding / Computer Graphics, ISY, LiTH. Splines
28(69) Splines Originally a drafting tool to create a smooth curve In computer graphics: a curve built from sections, each described by a 2nd or 3rd degree polynomial. Very common in non-real-time graphics,
More informationParametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell
Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c
More informationNatasha S. Sharma, PhD
Revisiting the function evaluation problem Most functions cannot be evaluated exactly: 2 x, e x, ln x, trigonometric functions since by using a computer we are limited to the use of elementary arithmetic
More informationAn introduction to plotting data
An introduction to plotting data Eric D. Black California Institute of Technology February 25, 2014 1 Introduction Plotting data is one of the essential skills every scientist must have. We use it on a
More informationUnit: Quadratic Functions
Unit: Quadratic Functions Learning increases when you have a goal to work towards. Use this checklist as guide to track how well you are grasping the material. In the center column, rate your understand
More informationNatural Numbers and Integers. Big Ideas in Numerical Methods. Overflow. Real Numbers 29/07/2011. Taking some ideas from NM course a little further
Natural Numbers and Integers Big Ideas in Numerical Methods MEI Conference 2011 Natural numbers can be in the range [0, 2 32 1]. These are known in computing as unsigned int. Numbers in the range [ (2
More informationBASIC LOESS, PBSPLINE & SPLINE
CURVES AND SPLINES DATA INTERPOLATION SGPLOT provides various methods for fitting smooth trends to scatterplot data LOESS An extension of LOWESS (Locally Weighted Scatterplot Smoothing), uses locally weighted
More informationCurve fitting using linear models
Curve fitting using linear models Rasmus Waagepetersen Department of Mathematics Aalborg University Denmark September 28, 2012 1 / 12 Outline for today linear models and basis functions polynomial regression
More informationLecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More information