3.5 Spline interpolation
|
|
- Matthew May
- 7 years ago
- Views:
Transcription
1 3.5 Spline interpolation Given a tabulated function f k = f(x k ), k = 0,... N, a spline is a polynomial between each pair of tabulated points, but one whose coefficients are determined slightly non-locally. The non-locality is designed to guarantee global smoothness in the interpolated function up to some order of derivative. Cubic splines are the most popular. They produce an interpolated function that is continuous through to the second derivative. Splines tend to be stabler than fitting a polynomial through the N + points, with less possibility of wild oscillations between the tabulated points. We shall explain how spline interpolation works by first going through the theory and then applying it to interpolate the function below: 0.5 f 5 f f f 4 f 7 f f 8 f 2 f Figure 3.: The function f(x) = +x 2 sin(x) between [ 4, 4]. The values of f(x k ) are given for i = 0,..., 8, x k = 4, 3, 2,, 0,, 2, 3, 4. Figure 3. shows the function f(x) = sin x in the region x [ 4, 4]. We are given the value of the +x 2 function at the points f i = f(x k ), k = 0,..., 8, where x k = 4, 3,..., 0,..., 3, 4. These are what is called the interpolating nodes Linear Spline Let s focus attention on one particular interval (x k, x k+ ). Linear interpolation in that interval gives the interpolation formula f = Af k + Bf k+ (3.) where A x k+ x x k+ x k, B A = x x k x k+ x k (3.2)
2 This is just like the piecewise Lagrange polynomial interpolation we looked at earlier. Figure 3.2 shows the piecewise interpolated function over the full range [ 4, 4]. 0.5 f 5 f f f 4 f 7 f f 8 f 2 f Figure 3.2: Piecewise linear interpolation with 9 nodes (solid) for the function +x 2 sin x between [ 4, 4] (dotted). We can see that linear interpolation works quite well for larger values of x but does particularly badly in (, ) as it fails to capture the curvature of the function. The accuracy can be improved by using more interpolating nodes, but an important issue is that the first derivatives of the interpolating function are discontinuous at the nodes Cubic spline interpolation The goal of cubic spline interpolation is to get an interpolation formula that is continuous in both the first and second derivatives, both within the intervals and at the interpolating nodes. This will give us a smoother interpolating function. In general, if the function you want to approximate is smooth, then cubic splines will do better than piecewise linear interpolation. Before you read on, I d like you to clear your mind a little. The following is a derivation of the cubic interpolation formula from Chapter 3 of Numerical Recipes by Press et al., which is a slight variation on the B 0 splines we discussed in lectures, but in my opinion illustrates the fundamental idea of spline interpolation more clearly. If you understand this, then you will find working with the B 0 splines much easier. Let s restate the problem. We have a function f(x) that is tabulated at the N + points f k = f(x k ), k = 0,..., N. In each interval (x k, x k+ ), we can fit a straight line through the points (x k, f k ) and (x k+, f k+ ) using the formula given by (3.). The problem is that with a linear function, the first derivative is not contin- 2
3 uous at the boundary between two adjacent intervals, while we want the second derivative to be continuous, even at the boundary! Now suppose, contrary to fact, that in addition to the tabulated values of f i, we also have tabulated values for the function s second derivatives, that is, a set of numbers f i. Then within each interval (x k, x k+ ), we can add to the right-hand side of equation (3.) a cubic polynomial whose second derivative varies linearly from a value f k on the left to a value f k+ on the right. Doing so, we will have the desired continuous second derivative. If we also construct the cubic polynomial to have zero values at x k and x k+, then adding it in will not spoil the agreement with the tabulated functional values f k and f k+ at the endpoints x k and x k+. A little side calculation shows that there is only one way to arrange this construction, namely replacing equation (3.) by where A and B are defined as before and f = Af k + Bf k+ + C f k + D f k+ (3.3) C (A3 A)(x k+ x k ) 2, D (B3 B)(x k+ x k ) 2 (3.4) Note that since A and B are linearly dependent on x, C and D (through A and B) have cubic x-dependence. We can readily check that f is in fact the second derivative of the new interpolating polynomial. We take derivatives of equation (3.3) with respect to x, using the definitions of A, B, C and D to compute da/dx, db/dx, dc/dx and dd/dx. The result is for the first derivative, and d f dx = f k+ f k 3A2 (x k+ x k ) f k x k+ x k + 3B2 (x k+ x k ) f k+ (3.5) d 2 f dx 2 = Af k + Bf k+ (3.) for the second derivative. Since A = at x k and A = 0 at x k+, and B = 0 at x k and B = at x k+, (3.) shows that f is just the tabulated second derivative, and also that the second derivative will be continuous across the boundary between two intervals, say (x k, x k ) and (x k, x k+ ). The only problem now is that we supposed the f k s to be known, when actually, they are not. However, we have not yet required that the first derivative, computed from (3.5), be continuous across the boundary between two intervals. The key idea of a cubic spline is to require this continuity and to use it to get equations for the second derivatives f k. The required equations are obtained by setting equation (3.5) evaluated for x = x k in the interval (x k, x k ) equal to the same equation evaluated for x = x k but in the interval (x k, x k+ ). With some rearrangement, this give (for k =,..., N ) x k x k f k + x k+ x k f k 3 + x k+ x k f k+ = f k+ f k f k f k (3.7) x k+ x k x k x k These are N linear equations in the N + unknowns f i, i = 0,..., N. Therefore there is a two-parameter family of possible solutions. For a unique solution, we need to specify further conditions, typically taken as boundary conditions at x 0 and x N. The most common ways of doing this is to set both f 0 and f N equal to zero, giving the so-called 3
4 natural cubic spline, which has zero second derivatives on both of its boundaries. Now we have the solution for f k, k = 0,..., N, we can substitute back into equation (3.3) to give the cubic interpolation formula in each interval (x k, x k+ ). This is probably the easiest approach to use if you want to write a numerical code to calculate cubic spline interpolation. So what are B-splines? In the above approach, we started with a functional form for the interpolation formula ( f = Af k + Bf k+ + C f k + D f k+ ), and had to use constraints ( f continuous at interval boundaries) to solve for f k. As mathematicians, we like to build things up from fundamental units. In this case, we can use a set of piecewise cubic polynomials defined on some sub-interval of [x 0, x N ], which are by construction continuous through to second derivative at the boundaries of intervals. They would form a set of basis functions, since linear combinations of these functions would also satisfy the continuity properties at the boundaries between adjacent intervals. To construct the cubic spline over the whole range [x 0, x N ], we would then simply need match the sum of the basis functions with tabulated values of f i at the interpolating nodes x i, i = 0,..., N. The B-splines are the basis functions that satisfy our continuity conditions. If the interpolation is over the region [x 0, x N ], then B 0 is defined by B 0 (x) = 0 x x 0 2h (2h + (x x 0)) 3 x 0 2h x x 0 h 2h (x x 0) 2 (2h + (x x 0 )) x 0 h x x 0 2h (x x 0) 2 (2h (x x 0 )) x 0 x x 0 + h (2h (x x 0)) 3 x 0 + h x x 0 + 2h 0 x x 0 + 2h (3.8) where h = x k+ x k = x N x 0 N is the width between interpolating nodes (assumed to be equal). Note that B 0 has non-zero values over four intervals. We can easily check that B 0 satisfy the continuity conditions at the boundaries of the intervals, namely, B 0, B 0 and B 0 are continuous at 2h, h, 0, h and 2h. B k- (x) B k (x) B k+ (x) B k+2 (x) x k-2 x k- x k x k+ x k+2 Figure 3.3: Cubic B-spline 4
5 We define B k (x) = B 0 (x kh + x 0 ) (i.e. the B 0 functions shifted to the right by k nodes). This is illustrated in Figure 3.3, which shows B k, B k, B k+ and B k+2. Note that all four of these basis functions are non-zero in the interval (x k, x k+ ). The cubic spline function, S 3 (x) in [x 0, x N ] is then written as the linear combination of the B k s: S 3 (x) = N+ a k B k (x) (3.9) k= The sum is from to N +, since B is nonzero in the interval (x 0, x ), and B N+ is nonzero in the interval (x N, x N ), so we need to take into account these functions. Is the problem now completely specified? We know that we need 4 conditions (coefficients) to uniquely specify a cubic, and in [x 0, x N ] there are N intervals, so altogether a total of 4N conditions are needed. The continuity conditions are automatically satisfied in the N interior points, since the B k s satisfy the continuity conditions (that s 3(N ) conditions). The other requirement is that S 3 must match the tabulated points, i.e. S 3 (x k ) = f(x k ), for k = 0,..., N (N + conditions). So there are two unspecified conditions, and like before we can take S 3 (x 0 ) = S 3 (x N ) = 0 (i.e., curvature equals zero at the boundaries, natural spline ). Now evaluating S 3 (x) at x k : S 3 (x k ) = a k B k (x k ) + a k B k (x k ) + a k+ B k+ (x k ) + a k+2 B k+2 (x k ) = f(x k ) (3.0) (all other B k s are zero) From the definitions of B k (x) and B 0 (x), we find B k (x k ) = B 0 (x 0 ) = 2h3 3 B k (x k ) = B 0 (x 0 + h) = h3 B k+ (x k ) = B 0 (x 0 h) = h3 B k+2 (x k ) = B 0 (x 0 2h) = 0 Substituting into (3.0), we get the recurrence relation for the coefficients a k a k + 4a k + a k+ = h 3 f(x k) (3.) for k = 0,..., N. What happens at the boundaries? Remember we set S 3 (x 0 ) = S 3 (x N ) = 0. Differentiating S 3 (x) gives So we need to find the second derivatives of B k. S 3 N+ (x) = a k B k (x) (3.2) k= 5
6 Differentiating B 0 twice, we get 0 (x) = B 0 x x 0 2h 2h + (x x 0 ) x 0 2h x x 0 h 2h 3(x x 0 ) x 0 h x x 0 2h + 3(x x 0 ) x 0 x x 0 + h 2h (x x 0 ) x 0 + h x x 0 + 2h 0 (3.3) So as before, we have 0 = S 3 (x 0 ) = a B (x 0 ) + a 0 B 0 (x 0 ) + a B (x 0 ) + a 2 B 2 (x 0 ) = a B 0 (x 0 + h) + a 0 B 0 (x 0 ) + a B (x 0 h) = a h 2ha 0 + a h = a 2a 0 + a (3.4) From (3.0), we have a + 4a 0 + a = h 3 f(x 0) (3.5) Subtract (3.4) from (3.5), we obtain Similarly, we find We now can write a matrix equation to solve for the coefficients a 0,..., a N : a 0 = h 3 f(x 0) (3.) a N = h 3 f(x N) (3.7) a 0 a a 2 a N a N = h 3 f(x 0 ) f(x ) f(x 2 ) f(x N ) f(x N ) (3.8) This set of equations is tridiagonal and can be solved in O(N) operations by the tridiagonal algorithm. The final two coefficients to completely determine S 3 are a = 2a 0 a a N+ = 2a N a N (3.9)
7 Worked Example Now we can try to apply cubic spline interpolation to the function f(x) = +x 2 sin x, 4 x 4, with the 9 nodes x k = 4, 3, 2,, 0,, 2, 3, 4. Here x 0 = 4, x N = 4 and h =. So from equation (3.8), the basis function B 0 (x) is given by B 0 (x) = 0 x (x + )3 x (x + 4)2 (x + ) 5 x (x + 4)2 (x + 2) 4 x 3 (x + 2)3 3 x 2 0 x 2 (3.20) The cubic spline S 3 (x) = 9 k= a k B k (x), and we can find the coefficients a k, k = 0,,..., 8 by solving the linear system a 0 a a 2 a 3 a 4 a 5 a a 7 a 8 f( 4) f( 3) f( 2) f( ) = f(0) f() f(2) f(3) f(4) (3.2) This can be readily solved to give a 0,..., a 8. Additionally, a = 2a 0 a, a 9 = 2a 8 a 7. The numerical values are a = , a 9 = a 0 = a = a 2 = a 3 = a 4 = a 5 = a = a 7 = a 8 = We shall just show the construction of S 3 (x) in the interval [ 4, 3]: (3.22) S 3 (x) = a B (x) + a 0 B 0 (x) + a B (x) + a 2 B 2 (x) = a B 0 (x + ) + a 0 B 0 (x) + a B 0 (x ) + a 2 B 0 (x 2) = a ((x + ) + 2)3 + a 0 ( (x + 4)2 (x + 2)) +a ( ((x ) + 4)2 ((x ) + )) + a 2 ( ((x 2) + )3 ) So need to work out the functional form of S 3 (x) for each interval. The whole process is somewhat tedious, but as shown in the next figure, it does give the right result! 7
8 Figure 3.4: Here s the function f(x) = +x 2 sin x again (dotted), and now with the cubic spline interpolation for [ 4, 3] superimposed on top. 8
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
More information4.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
More informationthe points are called control points approximating curve
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.
More informationNovember 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
More information1 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
More information3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or
More information4.5 Chebyshev Polynomials
230 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION 4.5 Chebyshev Polynomials We now turn our attention to polynomial interpolation for f (x) over [ 1, 1] based on the nodes 1 x 0 < x 1 < < x N 1. Both
More informationThe 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
More informationEquations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
More informationis identically equal to x 2 +3x +2
Partial fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. 4x+7 For example it can be shown that has the same value as 1 + 3
More information1 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
More informationNatural cubic splines
Natural cubic splines Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology October 21 2008 Motivation We are given a large dataset, i.e. a function sampled
More informationWe 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
More information3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes
Partial Fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. For 4x + 7 example it can be shown that x 2 + 3x + 2 has the same
More informationIntroduction 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
More information3.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.
More informationComputer 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
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More informationNumerical integration of a function known only through data points
Numerical integration of a function known only through data points Suppose you are working on a project to determine the total amount of some quantity based on measurements of a rate. For example, you
More informationINTERPOLATION. 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
More information(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
More informationZeros 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
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationComputational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON
Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf
More informationis identically equal to x 2 +3x +2
Partial fractions.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. 4x+7 For example it can be shown that has the same value as + for any
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More information2x + 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
More informationReview 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
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationCHAPTER 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
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationF.IF.7b: Graph Root, Piecewise, Step, & Absolute Value Functions
F.IF.7b: Graph Root, Piecewise, Step, & Absolute Value Functions F.IF.7b: Graph Root, Piecewise, Step, & Absolute Value Functions Analyze functions using different representations. 7. Graph functions expressed
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More information( ) FACTORING. x In this polynomial the only variable in common to all is x.
FACTORING Factoring is similar to breaking up a number into its multiples. For example, 10=5*. The multiples are 5 and. In a polynomial it is the same way, however, the procedure is somewhat more complicated
More informationcorrect-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
More information8.1. Cramer s Rule for Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Cramer s Rule for Solving Simultaneous Linear Equations 8.1 Introduction The need to solve systems of linear equations arises frequently in engineering. The analysis of electric circuits and the control
More informationNote 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
More informationIntroduction to Complex Fourier Series
Introduction to Complex Fourier Series Nathan Pflueger 1 December 2014 Fourier series come in two flavors. What we have studied so far are called real Fourier series: these decompose a given periodic function
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationIntegrals of Rational Functions
Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationSmoothing and Non-Parametric Regression
Smoothing and Non-Parametric Regression Germán Rodríguez grodri@princeton.edu Spring, 2001 Objective: to estimate the effects of covariates X on a response y nonparametrically, letting the data suggest
More informationLinear Programming Problems
Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number
More informationLagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.
Polynomials (Ch.1) Study Guide by BS, JL, AZ, CC, SH, HL Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given. Sasha s method
More information3. 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
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationLinearly Independent Sets and Linearly Dependent Sets
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
More informationSecond 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
More informationLesson 3. Numerical Integration
Lesson 3 Numerical Integration Last Week Defined the definite integral as limit of Riemann sums. The definite integral of f(t) from t = a to t = b. LHS: RHS: Last Time Estimate using left and right hand
More informationNumerical Solution of Differential
Chapter 13 Numerical Solution of Differential Equations We have considered numerical solution procedures for two kinds of equations: In chapter 10 the unknown was a real number; in chapter 6 the unknown
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationSolving Quadratic Equations
9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation
More informationUsing a table of derivatives
Using a table of derivatives In this unit we construct a Table of Derivatives of commonly occurring functions. This is done using the knowledge gained in previous units on differentiation from first principles.
More informationName: ID: Discussion Section:
Math 28 Midterm 3 Spring 2009 Name: ID: Discussion Section: This exam consists of 6 questions: 4 multiple choice questions worth 5 points each 2 hand-graded questions worth a total of 30 points. INSTRUCTIONS:
More information1 Review of Newton Polynomials
cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael
More informationRegression III: Advanced Methods
Lecture 16: Generalized Additive Models Regression III: Advanced Methods Bill Jacoby Michigan State University http://polisci.msu.edu/jacoby/icpsr/regress3 Goals of the Lecture Introduce Additive Models
More informationTo 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
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationZeros 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
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationSection 6.1 Factoring Expressions
Section 6.1 Factoring Expressions The first method we will discuss, in solving polynomial equations, is the method of FACTORING. Before we jump into this process, you need to have some concept of what
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationModule 1 : Conduction. Lecture 5 : 1D conduction example problems. 2D conduction
Module 1 : Conduction Lecture 5 : 1D conduction example problems. 2D conduction Objectives In this class: An example of optimization for insulation thickness is solved. The 1D conduction is considered
More informationExamples of Tasks from CCSS Edition Course 3, Unit 5
Examples of Tasks from CCSS Edition Course 3, Unit 5 Getting Started The tasks below are selected with the intent of presenting key ideas and skills. Not every answer is complete, so that teachers can
More informationSection 1.1 Linear Equations: Slope and Equations of Lines
Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of
More informationFour-parameter curves
Chapter 1 Four-parameter curves For the basic problem of interpolating splines, two-parameter splines are ideal. However, when greater than G 2 continuity is needed, or for designing particular shapes
More informationwww.mathsbox.org.uk ab = c a If the coefficients a,b and c are real then either α and β are real or α and β are complex conjugates
Further Pure Summary Notes. Roots of Quadratic Equations For a quadratic equation ax + bx + c = 0 with roots α and β Sum of the roots Product of roots a + b = b a ab = c a If the coefficients a,b and c
More informationA power series about x = a is the series of the form
POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to
More informationSolving Systems of Two Equations Algebraically
8 MODULE 3. EQUATIONS 3b Solving Systems of Two Equations Algebraically Solving Systems by Substitution In this section we introduce an algebraic technique for solving systems of two equations in two unknowns
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationCSE 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
More informationInterpolation. Chapter 3. 3.1 The Interpolating Polynomial
Chapter 3 Interpolation Interpolation is the process of defining a function that takes on specified values at specified points This chapter concentrates on two closely related interpolants: the piecewise
More informationComputer Graphics CS 543 Lecture 12 (Part 1) Curves. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics CS 54 Lecture 1 (Part 1) Curves Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) So Far Dealt with straight lines and flat surfaces Real world objects include
More informationChapter 4 One Dimensional Kinematics
Chapter 4 One Dimensional Kinematics 41 Introduction 1 4 Position, Time Interval, Displacement 41 Position 4 Time Interval 43 Displacement 43 Velocity 3 431 Average Velocity 3 433 Instantaneous Velocity
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSmoothing. Fitting without a parametrization
Smoothing or Fitting without a parametrization Volker Blobel University of Hamburg March 2005 1. Why smoothing 2. Running median smoother 3. Orthogonal polynomials 4. Transformations 5. Spline functions
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More information1.7. Partial Fractions. 1.7.1. Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).
.7. PRTIL FRCTIONS 3.7. Partial Fractions.7.. Rational Functions and Partial Fractions. rational function is a quotient of two polynomials: R(x) = P (x) Q(x). Here we discuss how to integrate rational
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More information2013 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
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationexpression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.
A polynomial of degree n (in one variable, with real coefficients) is an expression of the form: a n x n + a n 1 x n 1 + a n 2 x n 2 + + a 2 x 2 + a 1 x + a 0 where a n, a n 1, a n 2, a 2, a 1, a 0 are
More informationMATHEMATICS 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.
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationGeneral Framework for an Iterative Solution of Ax b. Jacobi s Method
2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,
More informationDerive 5: The Easiest... Just Got Better!
Liverpool John Moores University, 1-15 July 000 Derive 5: The Easiest... Just Got Better! Michel Beaudin École de Technologie Supérieure, Canada Email; mbeaudin@seg.etsmtl.ca 1. Introduction Engineering
More informationSOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve
SOLUTIONS Problem. Find the critical points of the function f(x, y = 2x 3 3x 2 y 2x 2 3y 2 and determine their type i.e. local min/local max/saddle point. Are there any global min/max? Partial derivatives
More informationLinear Equations and Inequalities
Linear Equations and Inequalities Section 1.1 Prof. Wodarz Math 109 - Fall 2008 Contents 1 Linear Equations 2 1.1 Standard Form of a Linear Equation................ 2 1.2 Solving Linear Equations......................
More informationChapter R.4 Factoring Polynomials
Chapter R.4 Factoring Polynomials Introduction to Factoring To factor an expression means to write the expression as a product of two or more factors. Sample Problem: Factor each expression. a. 15 b. x
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationStress Recovery 28 1
. 8 Stress Recovery 8 Chapter 8: STRESS RECOVERY 8 TABLE OF CONTENTS Page 8.. Introduction 8 8.. Calculation of Element Strains and Stresses 8 8.. Direct Stress Evaluation at Nodes 8 8.. Extrapolation
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More information