# the points are called control points approximating curve

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces. The general approach is that the user enters a sequence of points, and a curve is constructed whose shape closely follows this sequence. The points are called control points. A curve that actually passes through each control point is called an interpolating curve; a curve that passes near to the control points but not necessarily through them is called an approximating curve. the points are called control points interpolating curve approximating curve Once we establish this interface, then to change the shape of the curve we just move the control points. y 2 The easiest example to help us to understand how this works is to examine a curve that is like the graph of a function, like y x 2. This is a special case of a polynomial function. - x 87

2 CHAPTER 4. SPLINE CURVES 4. Polynomial curves Polynomials have the general form: y a + bx + cx 2 + dx +... The degree of a polynomial corresponds with the highest coefficient that is nonzero. For example if c is non-zero but coefficients d and higher are all zero, the polynomial is of degree 2. The shapes that polynomials can make are as follows: degree : Constant, only a is non-zero. Example: y A constant, uniquely defined by one point. degree : Linear, b is highest non-zero coefficient. Example: y + 2x A line, uniquely defined by two points. degree 2: Quadratic, c is highest non-zero coefficient. Example: y 2x + x 2 A parabola, uniquely defined by three points. degree : Cubic, d is highest non-zero coefficient. Example: y 7/2x + /2x A cubic curve (which can have an inflection, at x in this example), uniquely defined by four points. The degree three polynomial known as a cubic polynomial is the one that is most typically chosen for constructing smooth curves in computer graphics. It is used because. it is the lowest degree polynomial that can support an inflection so we can make interesting curves, and 2. it is very well behaved numerically that means that the curves will usually be smooth like this: and not jumpy like this:.

3 4.. POLYNOMIAL CURVES 89 So, now we can write a program that constructs cubic curves. The user enters four control points, and the program solves for the four coefficients a, b, c and d which cause the polynomial to pass through the four control points. Below, we work through a specific example. Typically the interface would allow the user to enter control points by clicking them in with the mouse. For example, say the user has entered control points (, 2), (, ), (, 2), (2, ) as indicated by the dots in the figure to the left. Then, the computer solves for the coefficients a, b, c, d and might draw the curve shown going through the control points, using a loop something like this: glbegin(gl LINE STRIP); for(x -; x < ; x +.25) glvertex2f(x, a + b * x + c * x * x + d * x * x * x); glend(); Note that the computer is not really drawing the curve. Actually, all it is doing is drawing straight line segments through a sampling of points that lie on the curve. If the sampling is fine enough, the curve will appear to the user as a continuous smooth curve. The solution for a, b, c, d is obtained by simultaneously solving the 4 linear equations below, that are obtained by the constraint that the curve must pass through the 4 points: general form: a + bx + cx 2 + dx y point (, 2): a b + c d 2 point (, ): a point (, 2): a + b + c + d 2 point (2, ): a + 2b + 4c 8d This can be written in matrix form Ma y,

4 9 CHAPTER 4. SPLINE CURVES or (one row for each equation) a 2 b c d The solution is a M y, which is hard to do on paper but easy to do on the computer using matrix and vector routines. For example, using the code I have provided, you could write: Vector a(4), y(4); Matrix M(4, 4); y[ 2; y[ ; y[2-2; y[ ; // fill in all rows of M M[[ ; M[[ -; M[[2 ; M[[ -; // etc. to fill all 4 rows a M.inv() * y; After this computation, a[ contains the value of a, a[ of b, a[2 of c and a[ of d. For this example the correct values are a, b 2 2, c, and d Piecewise polynomial curves In the previous section, we saw how four control points can define a cubic polynomial curve, allowing the solution of four linear equations for the four coefficients of the curve. Here we will see how more complex curves can be made using two new ideas:. construction of piecewise polynomial curves, 2. parameterization of the curve. Suppose we wanted to make the curve shown to the right. We know that a single cubic curve can only have one inflection point, but this curve has three, marked with O s. We could make this curve by entering extra control points and using a 5th degree polynomial, with six coefficients, but polynomials with degree higher than three tend to be very sensitive to the positions of the control points and thus do not always make smooth shapes.

5 4.2. PIECEWISE POLYNOMIAL CURVES 9 The usual solution to this problem in computer graphics and computer aided design is to construct a complex curve, with a high number of inflection points, by piecing together several cubic curves: + Here is one way that this can be done. Let each pair of control points represent one segment of the curve. Each curve segment is a cubic polynomial with its own coefficients: y f (x) f (x) (x 5,y 5 ) (x 6,y 6 ) f 8 (x) x x x 2 x x 4 x 5 x 6 x 7 x 8 x 9 x In this example, the ten control points have ascending values for the x coordinate, and are numbered with indices through 9. Between each control point pair is a function, which is numbered identically to the index of its leftmost point. In general, f i (x) a i + b i x + c i x 2 + d i x is the function representing the curve between control points i and i +. Because each curve segment is represented by a cubic polynomial function, we have to solve for four coefficients for each segment. In this example we have coefficients to solve for. How shall we do this?

6 92 CHAPTER 4. SPLINE CURVES Here is one way:. We require that each curve segment pass through its control points. Thus, f i (x i ) y i, and f i (x i+ ) y i+. This enforces C continuity that is, where the curves join they meet each other. Note that for each curve segment this gives us two linear equations: a i + b i x i + c i x 2 i + d ix i y i, and a i + b i x i+ + c i x 2 i+ + d ix i+ y i+. But to solve for all four coefficients we need two more equations for each segment. 2. We require that the curve segments have the same slope where they join together. Thus, f i (x i+) f i+ (x i+). This enforces C continuity that is that slopes match where the curves join. Note that: f i (x) a i +b i x+c i x 2 +d i x, so that f i (x) b i +2c i x+d i x 2. And C continuity gives us one more linear equation for each segment b i + 2c i x i+ + d i x 2 i+ b i+ + 2c i+ x i+ + d i+ x 2 i+ or b i + 2c i x i+ + d i x 2 i+ b i+ 2c i+ x i+ d i+ x 2 i+.. To get the fourth equation we require that the curve segments have the same curvature where they join together. Thus, f i (x i+) f i+ (x i+). This enforces C 2 continuity that curvatures match at the join. Now: f i(x) 2c i + 6d i x And C 2 continuity gives us the additional linear equation that we need 2c i +6d i x i+ 2c i+ +6d i+ x i+ or 2c i +6d i x i+ 2c i+ 6d i+ x i+ 4. Now we are almost done, but you should note that at the left end of the curve we are missing the C and C 2 equations since there is no segment on the left. So, we are missing two equations needed to solve the entire system. We can get these by having the user supply the slopes at the two ends. Let us call these slopes s and s n. This gives f (x ) s, and f n (x n ) s n so that b + c x + 2d x 2 s, and b n + c n x n + 2d n x 2 n s n.

7 4.2. PIECEWISE POLYNOMIAL CURVES 9 As we did with the case of a single cubic spline, we have a set of linear equations to solve for a set of unknown coefficients. Once we have the coefficients we can draw the curve a segment at a time. Again the equation to solve is Ma y a M y, where each row of the matrix M is taken from the left-hand side of the linear equations, the vector a is the set of coefficients to solve for, and the vector y is the set of known right-hand values for each equation. Following is a worked example with three segments: Segment : f (x) Slope at : b 2 Curve through (, ): a Curve through (2, 2): a + 2b + 4c + 8d 2 Slopes match at join with f : b + 4c + 2d b 4c 2d Curvatures match at join with f : 2c + 2d 2c 2d Segment : f (x) Curve through (2, 2): a + 2b + 4c + 8d 2 Curve through (5, ): a + 5b + 25c + 25d Slopes match at join with f 2 : b + c + 75d b 2 c 2 75d 2 Curvatures match at join with f 2 : 2c + d 2c 2 d 2 Segment 2: f 2 (x) Curve through (5, ): a 2 + 5b c d 2 Curve through (8, ): a 2 + 8b c d 2 Slope at 8: b 2 + 6c d 2 Ma y, or

8 94 CHAPTER 4. SPLINE CURVES a b c d a b c d a 2 b 2 c 2 d , so a M y, Again, this is hard to solve by hand but easy on the computer. 4. Curve parameterization So far we have learned how a sequence of control points can define a piecewise polynomial curve, using cubic functions to define curve segments between control points and enforcing various levels of continuity where segments join. In particular, we employed C continuity, meaning that the two segments match values at the join. C continuity, meaning that they match slopes at the join. C 2 continuity, meaning that they match curvatures at the join. We were able to determine coefficients for the curve segments via a set of linear equations Ma y a M y, where a is the vector of all coefficients, y is the vector of constants on the right-hand side of the linear equations, and M is a matrix encoding the C, C and C 2 conditions. This approach can be modified to specify each curve segment in parametric form, as indicated in the figure below.

9 4.. CURVE PARAMETERIZATION 95 In the example, both curves are identical, however, the equations describing them will be different. In the parametric form on the right, we have defined parameters t, t and t 2 that vary between and as we step along the x axis between control points. We could write equations: t x/2, with dt dx /2 t (x 2)/, with dt dx / t 2 (x 5)/, with dt 2 dx / relating the t s to the original x coordinate. The derivatives indicate how quickly each t varies as we move in the x direction. Now we specify each curve segment by a parametric cubic curve f i (t i ) a i + b i t i + c i t 2 i + d i t i At the left side of segment i, t i and at the right t i, so C continuity is simply f i () a i y i f i () a i + b i + c i + d i y i+ Notice, that in this form the a i coefficients are simply the y coordinates of the ith control points, and do not have to be solved for. For C continuity we differentiate once with respect to x using the chain rule: D x f i f i dt i t i dx f i, x i+ x i and for C 2 continuity we differentiate twice: ( ) Dxf 2 f i dt i dt i i t i dx dx f i (x i+ x i ) 2.

10 96 CHAPTER 4. SPLINE CURVES It is important that these quantities be calculated in spatial (i.e. x), not in parametric coordinates, since we want the curves to join smoothly in space, not with respect to our arbitrary parameterization. We force f i and f i+ to match slopes by: or (D x f i )() (D x f i+ )(), (b i + 2c i + d i ) b i+, or finally x i+ x i x i+2 x i+ b i + 2c i + d i x i+ x i x i+2 x i+ b i+ We force f i and f i+ to match curvatures by: or (D 2 xf i )() (D 2 f i+ )() (2c i + 6d i ) (x i+ x i ) 2 2c i+, or finally (x i+2 x i+ ) 2 2c i + 6d i 2 (x i+ x i ) 2 (x i+2 x i+ ) 2 c i+. Remember that we provided two extra equations by specifying slopes at the 2 endpoints s and s n. So this gives f () x x s, f n () x n x n s n, or and b (x x )s, b n + 2c n + d n (x n x n )s n. Looking back at our previous example, which we did without parameterization, we can rewrite all of our equations, and the final linear system that we have to solve. On big advantage of this approach is that we reduce one row and one column from the matrix for each control point, since we already know the values of all of the a coefficients.

11 4.4. SPACE CURVES 97 Segment : f (t ) Slope at : b (2 )2 4 Curve through (, ): a Curve through (2, 2): a + b + c + d 2orb + c + d 2 Slopes match: b + 2c + d ( )b Curvatures match: 2c + 6d 2( 2 )2 c Segment : f (t ) Curve through (2, 2): a 2 Curve through (5, ): b + c + d 2 2 Slopes match: b + 2c + d ( )b 2 Curvatures match: 2c + 6d 2c 2 Segment 2: f 2 (t 2 ) Curve through (5, ): a 2 Curve through (8, ): b 2 + c 2 + d 2 Slope at 8: b 2 + 2c 2 + d 2 (8 5)2 6 so Ma y, or a M y b c d b c d b 2 c 2 d , Once you have understood the notion of piecewise parameterization, the rest follows in a straightforward way. 4.4 Space curves We now know how to make arbitrary functions from a set of control points and piecewise cubic curves, and we know how to use parameters to simplify their construction. Now we will extend these ideas to arbitrary curves in two and three dimensional space.

12 98 CHAPTER 4. SPLINE CURVES For the earlier examples, we used t for a parameter, but to distinguish the fact that we will now be looking at space curves, we will follow the usual notation in the literature and use the letter u. Suppose we have two functions x u2 +, and y 2u2 + u +. As u varies, both x and y vary. We can make a table and we can plot the points. We see that the curve is described in 2-dimensional space, and unlike the graph of a function it can wrap back on itself. By picking appropriate functions x f (u) and y g(u) we can describe whatever 2D shape we desire. Suppose, for example, that we have a sequence of control points. Then between each pair of points we can define two cubic curves as a function of a parameter that varies from to between the control points and get a smooth curve

13 4.4. SPACE CURVES 99 between the points by applying C, C, C 2 constraints, as indicated by the example in the following figure. In the figure, u is at point and at point 2. between points and 2 by A cubic curve is defined x a x + b x u + c x u 2 + d x u, and y a y + b y u + c y u 2 + d y u. We write two systems of linear equations for the x and y coordinates separately: M x a x x and M y a y y. Each system is solved following the same process we used in the previous sections; the only major difference being that we solve two linear systems instead of one. Note that there are some differences in the details that have to be attended to. First, instead of computing the single derivative dti dx for each segment as we did above, will now need the two derivatives ui ui x and y for the chain rule. If we let each u i vary linearly from to for a segment between its control points p i (x i, y i ) and p i+ (x i+, y i+ ) then u i x x i+ x i, and u i y. y i+ y i There is one more point to consider. Now that we have full space curves, it is quite possible for a curve to join back on itself to make a closed figure. If we have this situation, and we enforce C, C and C 2 continuity where the curves join, then we have all of the equations needed without requiring the user to enter any slopes.

14 CHAPTER 4. SPLINE CURVES 4.5 Interpolation methods In the notes we have worked through a method for building an interpolating spline curve through a set of control points by using continuity C, slope C and curvature C 2 constraints, where spline segments join. This is the method for computing natural cubic splines. It was very good for helping us to understand the basic approach to constructing piecewise cubic splines, but it is not a very good method for use in designing shapes. This is because the entire curve is determined by one set of linear equations Ma y. Therefore, moving just one control point will affect the shape of the entire curve. You can understand that if you are designing a shape, you would like to be able to have local control over the portion of the shape you are working on, without worry that changes you make in one place may affect distant parts of the shape. For piecewise cubic interpolating curves, there are various ways of obtaining local shape control. The most important of these are Hermite Splines, Catmull- Rom Splines, and Cardinal Splines. These are explained quite well in a number of computer graphics textbooks, but let us do a few examples to illustrate these methods. Note, for each example we will be looking at only one segment of a piecewise curve. For each of these methods, each segment is calculated separately, so to get the entire curve the calculations must be repeated over all control points Hermite cubic splines p i and p i+ are two successive control points. For Hermite Splines the user must provide a slope at each control point, in the form of a vector t i, tangent to the curve at control point i. Letting parameter u i vary from at p i to at p i+, we use continuity C and slope C constraints at the two control points. In the example to the left, p i (, ), and p i+ (4, ), thus dui dx 4, and du i dy 2. The tangent vectors are [ [ t i, and t.5 i+. The tangent vectors t are input by the user as direction vectors of the form

15 4.5. INTERPOLATION METHODS [ x y tangents and, but we need slopes in parametric form, so we compute the scaled Dp i Dp i+ [ [ x du i dx y dui dy x dui+ dx y dui+ dy [ ( 2 )( 2 ) [ ()( ) ( )( 2 ) [ 4, [ 2. Linear system for example Hermite Spline Curve passes through p i at u i : x() a x y() a y Curve passes through p i+ at u i : x() a x + b x + c x + d x 4 y() a y + b y + c y + d y Slope at p i : x () b x y () b y 4 Slope at p i+ : x () b x + 2c x + d x y () b y + 2c y + d y 2 Thus in matrix form: 2 a x b x c x d x a y b y c y d y Note, that the two matrices on the left-hand side of this equation are constant, and do not depend upon the control points or slopes. Only the matrix on the right varies with the configuration Catmul-Rom splines In the case of Catmul-Rom splines, p i and p i+ are again two successive control points. Now, instead of requiring the user to enter slopes at each control point, we use the previous point p i and the subsequent point p i+2 to determine slopes at p i and p i+. The vector between p i and p i+ is used to give the slope at p i and the vector between p i and p i+2 to give the slope at p i+. We set t i 2 (p i+ p i ) and t i+ 2 (p i+2 p i ).

16 2 CHAPTER 4. SPLINE CURVES In the example to the left, as in the previous example, p i (, ), and p i+ (4, ), thus again dui dx dui, and dy 2. In addition, we have p i (, ) and p i+2 (5, 2). Thus, the tangent [ vectors are t i 2 (p i+ p i ), and 2 [ 2 t i+ 2 (p i+2 p i ). 2 [ x Again, the tangent vectors t are in the form y parametric form, so we compute the scaled tangents Dp i [ x du i dx y dui dy [ ( 2 )( ) (2)( 2 ), but we need slopes in [ 2, and Dp i+ [ x dui+ dx y dui+ dy [ (2)( ) ( 2 )( 2 ) [ 2 4. Linear system for example Catmul-Rom Spline Curve passes through p i at u i : x() a x y() a y Curve passes through p i+ at u i : x() a x + b x + c x + d x 4 y() a y + b y + c y + d y Slope at p i : x () b x 2 y () b y Slope at p i+ : x () b x + 2c x + d x 2 y () b y + 2c y + d y 4 Thus in matrix form: 2 a x b x c x d x a y b y c y d y Cardinal splines Cardinal splines generalize the Catmul-Rom splines by providing a shape parameter t. With t we have Catmul-Rom. Values of t > tighten the curve, making curvatures higher at the joins and values of t < loosen the curve. For

17 4.5. INTERPOLATION METHODS Cardinal Splines: and t i 2 ( t)(p i+ p i ), t i+ 2 ( t)(p i+2 p i ).

### (Refer Slide Time: 1:42)

Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 10 Curves So today we are going to have a new topic. So far

### 3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

Solving Polynomial Equations 3.3 Introduction Linear and quadratic equations, dealt within Sections 3.1 and 3.2, are members of a class of equations, called polynomial equations. These have the general

### parametric spline curves

parametric spline curves 1 curves used in many contexts fonts (2D) animation paths (3D) shape modeling (3D) different representation implicit curves parametric curves (mostly used) 2D and 3D curves are

### Piecewise Cubic Splines

280 CHAP. 5 CURVE FITTING Piecewise Cubic Splines The fitting of a polynomial curve to a set of data points has applications in CAD (computer-assisted design), CAM (computer-assisted manufacturing), and

### CSE 167: Lecture 13: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011

CSE 167: Introduction to Computer Graphics Lecture 13: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011 Announcements Homework project #6 due Friday, Nov 18

### We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model

CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant

### November 16, 2015. Interpolation, Extrapolation & Polynomial Approximation

Interpolation, Extrapolation & Polynomial Approximation November 16, 2015 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

### Figure 2.1: Center of mass of four points.

Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

### 2013 MBA Jump Start Program

2013 MBA Jump Start Program Module 2: Mathematics Thomas Gilbert Mathematics Module Algebra Review Calculus Permutations and Combinations [Online Appendix: Basic Mathematical Concepts] 2 1 Equation of

### Exam 1 Sample Question SOLUTIONS. y = 2x

Exam Sample Question SOLUTIONS. Eliminate the parameter to find a Cartesian equation for the curve: x e t, y e t. SOLUTION: You might look at the coordinates and notice that If you don t see it, we can

### DERIVATIVES AS MATRICES; CHAIN RULE

DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we

### Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:

Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in

### Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?

Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] Goals How do we draw surfaces? Approximate with polygons Draw polygons

### Parametric Curves (Part 1)

Parametric Curves (Part 1) Jason Lawrence CS445: Graphics Acknowledgment: slides by Misha Kazhdan, Allison Klein, Tom Funkhouser, Adam Finkelstein and David Dobkin Parametric Curves and Surfaces Part 1:

### Review of Fundamental Mathematics

Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools

### 1 Determinants and the Solvability of Linear Systems

1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped

### 2.3. Finding polynomial functions. An Introduction:

2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned

### CHAPTER 1 Splines and B-splines an Introduction

CHAPTER 1 Splines and B-splines an Introduction In this first chapter, we consider the following fundamental problem: Given a set of points in the plane, determine a smooth curve that approximates the

### Math 215 HW #1 Solutions

Math 25 HW # Solutions. Problem.2.3. Describe the intersection of the three planes u+v+w+z = 6 and u+w+z = 4 and u + w = 2 (all in four-dimensional space). Is it a line or a point or an empty set? What

### Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function

### Precalculus REVERSE CORRELATION. Content Expectations for. Precalculus. Michigan CONTENT EXPECTATIONS FOR PRECALCULUS CHAPTER/LESSON TITLES

Content Expectations for Precalculus Michigan Precalculus 2011 REVERSE CORRELATION CHAPTER/LESSON TITLES Chapter 0 Preparing for Precalculus 0-1 Sets There are no state-mandated Precalculus 0-2 Operations

### Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points

### Population Prediction Project Demonstration Writeup

Dylan Zwick Math 2280 Spring, 2008 University of Utah Population Prediction Project Demonstration Writeup In this project we will investigate how well a logistic population model predicts actual human

### 1 Cubic Hermite Spline Interpolation

cs412: introduction to numerical analysis 10/26/10 Lecture 13: Cubic Hermite Spline Interpolation II Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Cubic Hermite

### Introduction to the Finite Element Method (FEM)

Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean Discretisation Consider the temperature distribution along the one-dimensional

### SYSTEMS OF EQUATIONS

SYSTEMS OF EQUATIONS 1. Examples of systems of equations Here are some examples of systems of equations. Each system has a number of equations and a number (not necessarily the same) of variables for which

### INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).

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

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### 1 Lecture 19: Implicit differentiation

Lecture 9: Implicit differentiation. Outline The technique of implicit differentiation Tangent lines to a circle Examples.2 Implicit differentiation Suppose we have two quantities or variables x and y

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### correct-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:

Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that

### 1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

### MATHEMATICS FOR ENGINEERING BASIC ALGEBRA

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA TUTORIAL 3 EQUATIONS This is the one of a series of basic tutorials in mathematics aimed at beginners or anyone wanting to refresh themselves on fundamentals.

### Row Echelon Form and Reduced Row Echelon Form

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### Zeros of Polynomial Functions

Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### To give it a definition, an implicit function of x and y is simply any relationship that takes the form:

2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to

### 88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

### COGNITIVE TUTOR ALGEBRA

COGNITIVE TUTOR ALGEBRA Numbers and Operations Standard: Understands and applies concepts of numbers and operations Power 1: Understands numbers, ways of representing numbers, relationships among numbers,

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### Computer Animation: Art, Science and Criticism

Computer Animation: Art, Science and Criticism Tom Ellman Harry Roseman Lecture 4 Parametric Curve A procedure for distorting a straight line into a (possibly) curved line. The procedure lives in a black

### Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.

Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.

### Geometric Modelling & Curves

Geometric Modelling & Curves Geometric Modeling Creating symbolic models of the physical world has long been a goal of mathematicians, scientists, engineers, etc. Recently technology has advanced sufficiently

### The degree of a polynomial function is equal to the highest exponent found on the independent variables.

DETAILED SOLUTIONS AND CONCEPTS - POLYNOMIAL FUNCTIONS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions and Comments to ingrid.stewart@csn.edu. Thank you! PLEASE NOTE

### Essential Mathematics for Computer Graphics fast

John Vince Essential Mathematics for Computer Graphics fast Springer Contents 1. MATHEMATICS 1 Is mathematics difficult? 3 Who should read this book? 4 Aims and objectives of this book 4 Assumptions made

### 3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Solving quadratic equations 3.2 Introduction A quadratic equation is one which can be written in the form ax 2 + bx + c = 0 where a, b and c are numbers and x is the unknown whose value(s) we wish to find.

### The KaleidaGraph Guide to Curve Fitting

The KaleidaGraph Guide to Curve Fitting Contents Chapter 1 Curve Fitting Overview 1.1 Purpose of Curve Fitting... 5 1.2 Types of Curve Fits... 5 Least Squares Curve Fits... 5 Nonlinear Curve Fits... 6

### Overview of Math Standards

Algebra 2 Welcome to math curriculum design maps for Manhattan- Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse

### 3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials

3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines

### 4.3 Lagrange Approximation

206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average

### Finite Element Formulation for Plates - Handout 3 -

Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the

### EECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines

EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation

### Math 241, Exam 1 Information.

Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)

### 2.2 Derivative as a Function

2.2 Derivative as a Function Recall that we defined the derivative as f (a) = lim h 0 f(a + h) f(a) h But since a is really just an arbitrary number that represents an x-value, why don t we just use x

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### AP Calculus BC. All students enrolling in AP Calculus BC should have successfully completed AP Calculus AB.

AP Calculus BC Course Description: Advanced Placement Calculus BC is primarily concerned with developing the students understanding of the concepts of calculus and providing experiences with its methods

### 1 Review of Least Squares Solutions to Overdetermined Systems

cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares

### Year 9 set 1 Mathematics notes, to accompany the 9H book.

Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H

### A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors

### Chapter 11 - Curve Sketching. Lecture 17. MATH10070 - Introduction to Calculus. maths.ucd.ie/modules/math10070. Kevin Hutchinson.

Lecture 17 MATH10070 - Introduction to Calculus maths.ucd.ie/modules/math10070 Kevin Hutchinson 28th October 2010 Z Chain Rule (I): If y = f (u) and u = g(x) dy dx = dy du du dx Z Chain rule (II): d dx

### Student Performance Q&A:

Student Performance Q&A: AP Calculus AB and Calculus BC Free-Response Questions The following comments on the free-response questions for AP Calculus AB and Calculus BC were written by the Chief Reader,

### Dhiren Bhatia Carnegie Mellon University

Dhiren Bhatia Carnegie Mellon University University Course Evaluations available online Please Fill! December 4 : In-class final exam Held during class time All students expected to give final this date

### 2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

Polynomials and Quadratics Want to be an environmental scientist? Better be ready to get your hands dirty!.1 Controlling the Population Adding and Subtracting Polynomials............703.2 They re Multiplying

### Arithmetic and Algebra of Matrices

Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational

### 2 Integrating Both Sides

2 Integrating Both Sides So far, the only general method we have for solving differential equations involves equations of the form y = f(x), where f(x) is any function of x. The solution to such an equation

### Economics 2020a / HBS 4010 / HKS API-111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4

Economics 00a / HBS 4010 / HKS API-111 FALL 010 Solutions to Practice Problems for Lectures 1 to 4 1.1. Quantity Discounts and the Budget Constraint (a) The only distinction between the budget line with

### 2008 AP Calculus AB Multiple Choice Exam

008 AP Multiple Choice Eam Name 008 AP Calculus AB Multiple Choice Eam Section No Calculator Active AP Calculus 008 Multiple Choice 008 AP Calculus AB Multiple Choice Eam Section Calculator Active AP Calculus

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Prentice Hall Mathematics: Algebra 2 2007 Correlated to: Utah Core Curriculum for Math, Intermediate Algebra (Secondary)

Core Standards of the Course Standard 1 Students will acquire number sense and perform operations with real and complex numbers. Objective 1.1 Compute fluently and make reasonable estimates. 1. Simplify

### Note the difference between this and in class- We can go ahead and substitute the y s in directly.

Cubic Splines and Matlab 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 data structures that we will

### The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., 12-15 July 2000. Derive 5: The Easiest... Just Got Better!

The Fourth International DERIVE-TI9/89 Conference Liverpool, U.K., -5 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de technologie supérieure 00, rue Notre-Dame Ouest Montréal

### Mean value theorem, Taylors Theorem, Maxima and Minima.

MA 001 Preparatory Mathematics I. Complex numbers as ordered pairs. Argand s diagram. Triangle inequality. De Moivre s Theorem. Algebra: Quadratic equations and express-ions. Permutations and Combinations.

### UNCORRECTED PAGE PROOFS

number and and algebra TopIC 17 Polynomials 17.1 Overview Why learn this? Just as number is learned in stages, so too are graphs. You have been building your knowledge of graphs and functions over time.

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### CHOOSING A COLLEGE. Teacher s Guide Getting Started. Nathan N. Alexander Charlotte, NC

Teacher s Guide Getting Started Nathan N. Alexander Charlotte, NC Purpose In this two-day lesson, students determine their best-matched college. They use decision-making strategies based on their preferences

### Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent

### GRAPHING WITH LOGARITHMIC PAPER

Page 1 of 5 GRAPHING WITH LOGARITHMIC PAPER Department of Physics, University of Guelph Guelph, Ontario, Canada http://www.physics.uoguelph.ca Go to this site to print free graph paper (en francais aussi):

### Homework set 1: posted on website

Homework set 1: posted on website 1 Last time: Interpolation, fitting and smoothing Interpolated curve passes through all data points Fitted curve passes closest (by some criterion) to all data points

### Calculus Card Matching

Card Matching Card Matching A Game of Matching Functions Description Give each group of students a packet of cards. Students work as a group to match the cards, by thinking about their card and what information

### Microeconomic Theory: Basic Math Concepts

Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts

### Zeros of Polynomial Functions

Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of

### Parametric Curves, Vectors and Calculus. Jeff Morgan Department of Mathematics University of Houston

Parametric Curves, Vectors and Calculus Jeff Morgan Department of Mathematics University of Houston jmorgan@math.uh.edu Online Masters of Arts in Mathematics at the University of Houston http://www.math.uh.edu/matweb/grad_mam.htm

### NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document

### CS 4620 Practicum Programming Assignment 6 Animation

CS 4620 Practicum Programming Assignment 6 Animation out: Friday 14th November 2014 due: : Monday 24th November 2014 1 Introduction In this assignment, we will explore a common topic in animation: key

### Apr 23, 2015. Calculus with Algebra and Trigonometry II Lecture 23Final Review: Apr Curve 23, 2015 sketching 1 / and 19pa

Calculus with Algebra and Trigonometry II Lecture 23 Final Review: Curve sketching and parametric equations Apr 23, 2015 Calculus with Algebra and Trigonometry II Lecture 23Final Review: Apr Curve 23,

### Diagonalisation. Chapter 3. Introduction. Eigenvalues and eigenvectors. Reading. Definitions

Chapter 3 Diagonalisation Eigenvalues and eigenvectors, diagonalisation of a matrix, orthogonal diagonalisation fo symmetric matrices Reading As in the previous chapter, there is no specific essential

### Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.

Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients We will now turn our attention to nonhomogeneous second order linear equations, equations with the standard

### GRAPH OF A RATIONAL FUNCTION

GRAPH OF A RATIONAL FUNCTION Find vertical asmptotes and draw them. Look for common factors first. Vertical asmptotes occur where the denominator becomes zero as long as there are no common factors. Find

### College Algebra. Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1

College Algebra Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1 Course Description This course provides

### Circuits 1 M H Miller

Introduction to Graph Theory Introduction These notes are primarily a digression to provide general background remarks. The subject is an efficient procedure for the determination of voltages and currents

### Solutions for 2015 Algebra II with Trigonometry Exam Written by Ashley Johnson and Miranda Bowie, University of North Alabama

Solutions for 0 Algebra II with Trigonometry Exam Written by Ashley Johnson and Miranda Bowie, University of North Alabama. For f(x = 6x 4(x +, find f(. Solution: The notation f( tells us to evaluate the

### MATH BOOK OF PROBLEMS SERIES. New from Pearson Custom Publishing!

MATH BOOK OF PROBLEMS SERIES New from Pearson Custom Publishing! The Math Book of Problems Series is a database of math problems for the following courses: Pre-algebra Algebra Pre-calculus Calculus Statistics

### CURVE FITTING LEAST SQUARES APPROXIMATION

CURVE FITTING LEAST SQUARES APPROXIMATION Data analysis and curve fitting: Imagine that we are studying a physical system involving two quantities: x and y Also suppose that we expect a linear relationship