This expression is known as the Newton form of the interpolating polynomial. How do we go about finding the coefficients c i?
|
|
- Toby Bryant
- 5 years ago
- Views:
Transcription
1 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 through a series of points. The main idea is the interpolating function goes through some required collection of points exactly. Usually we build interpolating functions using a collection of basis functions and multiply the given basis functions by a collection of coefficients such that the required set of points is satisfied. Consider the set of points: {(x 1, y 1 ), (x 2, y 2 ),..., (x n, y n )} The goal here is to find an n th order polynomial that will fit through these points. One such function we could arrive at would have the form: f n (x) = c 1 + c 2 (x x 1 ) + c 3 (x x 1 )(x x 2 ) + + c n (x x 1 )(x x 2 ) (x x n ) This expression is known as the Newton form of the interpolating polynomial. How do we go about finding the coefficients c i? Newton Interpolating Polynomial Consider fitting a polynomial to the following set of points. {( 1, ), (3, 1), (5, 3), (7, 3)} We will build up our function by finding a function that satisfies one of the points, then two, and so on until all four of the points in the set are satisfied. The coefficients c i in the 1
2 interpolating polynomial above may be found using divided differences. Specifically: c 1 = f(x 1 ) c 2 = f[x 2, x 1 ] = f(x 2) f(x 1 ) x 2 x 1 c 3 = f[x 3, x 2, x 1 ] = f[x 3, x 2 ] f[x 2, x 1 ]) x 3 x 1 c = f[x, x 3, x 2, x 1 ] = f[x, x 3, x 2 ] f[x 3, x 2, x 1 ] x x 1.. c n = f[x n, x n 1,..., x 1 ] = f[x n, x n 1,..., x 2 ] f[x n 1, x n 2,..., x 1 ] x n x 1 The function we aim to find that interpolates the data set given in this example is: f(x) = c 1 + c 2 (x 1) + c 3 (x ( 1))(x (5)) + c (x ( 1))(x (3))(x (5)) Note when f(x) is evaluated at each of the x-values in the data set to be interpolated that many of the additive terms become zero. Finding the coefficients c i above: c 1 = c 2 = f[x 2, x 1 ] = f(x 2) f(x 1 ) = 1 () x 2 x 1 3 ( 1) = 3 f[x 3, x 2 ] = f(x 3) f(x 2 ) = 3 (1) x 3 x 2 5 (3) = 1 f[x, x 3 ] = f(x ) f(x 3 ) x x 3 = 3 (3) 7 (5) = 3 c 3 = f[x 3, x 2, x 1 ] = f[x 3, x 2 ] f[x 2, x 1 ]) = 1 ( 3) x 3 x 1 5 ( 1) = 7 2 f[x, x 3, x 2 ] = f[x, x 3 ] f[x 3, x 2 ]) x x 2 = 3 (1) 7 (3) = 1 c = f[x, x 3, x 2, x 1 ] = f[x, x 3, x 2 ] f[x 3, x 2, x 1 ] = 1 ( 7 x x 1 7 ( 1) = ) This yields the function: ( f(x) = + 3 ) ( ) ( 7 (x 1)+ (x ( 1))(x (5))+ 31 ) (x ( 1))(x (3))(x (5)) The interpolating function can now be plotted along with its defining points: 2
3 Some CODE A listing of code that can be used in SAGE to produce the function s interpolation is given by: Listing 1.1: ]Code to Create 5 Lagrange Cardinal Polynomials on [-1,1] def F2( i, j, xe, ye ) : return ( ye [ i ] ye [ j ] ) / ( xe [ i ] xe [ j ] ) def F3( i, j, k, xe, ye ) : return (F2( i, j, xe, ye ) F2( j, k, xe, ye ) ) / ( xe [ i ] xe [ k ] ) def F( i, j, k, l, xe, ye ) : return (F3( i, j, k, xe, ye ) F3( j, k, l, xe, ye ) ) / ( xe [ i ] xe [ l ] ) xe = [ 1,3, 5, 7 ] ; ye = [, 1, 3, 3]; c1 = ye [ 0 ] c2 = F2 ( 1, 0, xe, ye ) show ( c2 ) c3 = F3 ( 2, 1, 0, xe, ye ) c = F ( 3, 2, 1, 0, xe, ye ) newt ( x ) = c1 + c2 (x xe [ 0 ] ) + c3 (x xe [ 0 ] ) ( x xe [ 1 ] ) + c (x xe [ 0 ] ) ( x xe [ 1 ] ) NewtPlot = p l o t ( newt, 1,8, c o l o r = [ 1, 0, 0 ] ) ; NewtPlot += point ( ( xe [ 0 ], ye [ 0 ] ), s i z e =30, f i g s i z e =3) NewtPlot += point ( ( xe [ 1 ], ye [ 1 ] ), s i z e =30, f i g s i z e =3) NewtPlot += point ( ( xe [ 2 ], ye [ 2 ] ), s i z e =30, f i g s i z e =3) NewtPlot += point ( ( xe [ 3 ], ye [ 3 ] ), s i z e =30, f i g s i z e =3) 3
4 Lagrange Interpolation Polynomial A second method for generating the interpolating function may be presented in the following manner. Lets take advantage of some basis functions that are zero or one depending on the data point we are considering in the given collection of points. The idea of our collection of basis functions was to allow them to have a Kronecker Delta property: { 0 if i j δ i,j = 1 if i = j For a given set of data points we have seen that if l i (x) is a polynomial with the Kronecker Delta property at the given data set: The interpolating polynomial of the set is: which can be seen by observing P (x j ) = x x 0 x 1 x n y y 0 y 1 y n P (x) = n l i (x)y i, (1.0.1) i=0 n l i (x j )y i = l j (x j )y j = y j i=0 We can built an set of basis functions l i (x) for our specified data set using a product of factors. Consider ( ) ( ) ( ) ( ) ( ) x x0 x x1 x xi 1 x xi+1 x xn l i (x) = x i x 0 x i x 1 x i x i 1 x i x i+1 x i x n Notice that the i th term in the sequence is skipped and that the l i (x) expressions have the Kronecker Delta Property. Then n ( ) x xj l i (x) = i {0, 1,..., n}. x i x j j=0,j i here P (x) in (1.0.1) is the Lagrange Form of the interpolating polynomial, and the basis functions l i (x) are often called cardinal polynomials. Class Activity Using sage find the first five Lagrange Interpolating Polynomials evenly spaced on the interval [ 1, 1] then modify your code to find the Lagrange Interpolating polynomial for the data set listed below:
5 x y The following sage code is used: Listing 1.2: ]Code to Create 5 Lagrange Cardinal Polynomials on [-1,1] xnodes = [ 1.0, 0.5, 0. 0, 0. 5, 1. 0 ] ; ynodes = [ 0. 0, 0. 0, 0. 0, 0. 0, 0. 0 ] ; L0 ( x ) = 1. 0 ; L1 ( x ) = 1. 0 ; L2 ( x ) = 1. 0 ; L3 ( x ) = 1. 0 ; L ( x ) = 1. 0 ; f o r i in range ( l e n ( xnodes ) ) : i f ( i!= 0 ) : L0 ( x ) = L0 ( x ) ( ( x xnodes [ i ] ) / ( xnodes [0] xnodes [ i ] ) ) ; i f ( i!= 1 ) : L1 ( x ) = L1 ( x ) ( ( x xnodes [ i ] ) / ( xnodes [1] xnodes [ i ] ) ) ; i f ( i!= 2 ) : L2 ( x ) = L2 ( x ) ( ( x xnodes [ i ] ) / ( xnodes [2] xnodes [ i ] ) ) ; i f ( i!= 3 ) : L3 ( x ) = L3 ( x ) ( ( x xnodes [ i ] ) / ( xnodes [3] xnodes [ i ] ) ) ; i f ( i!= ) : L ( x ) = L ( x ) ( ( x xnodes [ i ] ) / ( xnodes [] xnodes [ i ] ) ) ; Figure 1.0.1: Plot of the first five Lagrange cardinal polynomials on [ 1, 1]. 5
6 8e5 6e5 e5 2e e5 Figure 1.0.2: The Lagrange Interpolating polynomial on [0, ]. To modify the code for the second portion of the activity note that we need to change the nodes vectors Error in Polynomial Interpolation Lets consider the error in polynomial interpolation. Given the following sets of points find a polynomial using SAGE that interpolates the data: Two Points: Three Points: Four Points: Five Points: x 0 10 y 10 0 x 0 10 y x y x y
7 Typically the thought is: The larger the number of nodes used the better the interpolating is between the node for a data set. Is this correct? Consider the Runge function on the interval [ 5, 5]. R(x) = 1 x What would the interpolating polynomial look like if we used 11 equally spaced points to create a polynomial interpolating function that approximates the Runge function. 7
Math 3316, Fall 2016 Due Nov. 3, 2016
Math 3316, Fall 2016 Due Nov. 3, 2016 Project 3 Polynomial Interpolation The first two sections of this project will be checked in lab the week of Oct. 24-26 this completion grade will count for 10% of
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 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 informationHandout 4 - Interpolation Examples
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
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 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 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 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 informationME 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 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 informationInterpolation and Splines
Interpolation and Splines Anna Gryboś October 23, 27 1 Problem setting Many of physical phenomenona are described by the functions that we don t know exactly. Often we can calculate or measure the values
More informationx n x n stepnumber k order r error constant C r+1 1/2 5/12 3/8 251/720 abs. stab. interval (α,0) /11-3/10
MATH 573 LECTURE NOTES 77 13.8. Predictor-corrector methods. We consider the Adams methods, obtained from the formula xn+1 xn+1 y(x n+1 y(x n ) = y (x)dx = f(x,y(x))dx x n x n by replacing f by an interpolating
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 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 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 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 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 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 informationFitting to a set of data. Lecture on fitting
Fitting to a set of data Lecture on fitting Linear regression Linear regression Residual is the amount difference between a real data point and a modeled data point Fitting a polynomial to data Could use
More informationPS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017)
Homework Assignment Sheet I (Due 20-Oct-2017) Assignment 1 Let n N and A be a finite set of cardinality n = A. By definition, a permutation of A is a bijective function from A to A. Prove that there exist
More informationGraphing Techniques. Domain (, ) Range (, ) Squaring Function f(x) = x 2 Domain (, ) Range [, ) f( x) = x 2
Graphing Techniques In this chapter, we will take our knowledge of graphs of basic functions and expand our ability to graph polynomial and rational functions using common sense, zeros, y-intercepts, stretching
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 informationPolynomial Functions Graphing Investigation Unit 3 Part B Day 1. Graph 1: y = (x 1) Graph 2: y = (x 1)(x + 2) Graph 3: y =(x 1)(x + 2)(x 3)
Part I: Polynomial Functions when a = 1 Directions: Polynomial Functions Graphing Investigation Unit 3 Part B Day 1 1. For each set of factors, graph the zeros first, then use your calculator to determine
More informationNumerical Methods with Matlab: Implementations and Applications. Gerald W. Recktenwald. Chapter 10 Interpolation
Selected Solutions for Exercises in Numerical Methods with Matlab: Implementations and Applications Gerald W. Recktenwald Chapter 10 Interpolation The following pages contain solutions to selected end-of-chapter
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 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 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 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 informationChapter 3. Numerical Differentiation, Interpolation, and Integration. Instructor: Dr. Ming Ye
Chapter 3 Numerical Differentiation, Interpolation, and Integration Instructor: Dr. Ming Ye Measuring Flow in Natural Channels Mean-Section Method (1) Divide the stream into a number of rectangular elements
More informationSection 3.7 Notes. Rational Functions. is a rational function. The graph of every rational function is smooth (no sharp corners)
Section.7 Notes Rational Functions Introduction Definition A rational function is fraction of two polynomials. For example, f(x) = x x + x 5 Properties of Rational Graphs is a rational function. The graph
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationSHAPE Returns the number of elements in each direction in an integer vector.
Chapter 5: Arrays An advantage fortran has over other programming languages is the ease with which it handles arrays. Because arrays are so easy to handle, fortran is an ideal choice when writing code
More informationCS130 : Computer Graphics Curves. Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves Tamar Shinar Computer Science & Engineering UC Riverside Design considerations local control of shape design each segment independently smoothness and continuity ability
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 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 informationNew formulations of the semi-lagrangian method for Vlasov-type equations
New formulations of the semi-lagrangian method for Vlasov-type equations Eric Sonnendrücker IRMA Université Louis Pasteur, Strasbourg projet CALVI INRIA Nancy Grand Est 17 September 2008 In collaboration
More informationEXTRA-CREDIT PROBLEMS ON SURFACES, MULTIVARIABLE FUNCTIONS AND PARTIAL DERIVATIVES
EXTRA-CREDIT PROBLEMS ON SURFACES, MULTIVARIABLE FUNCTIONS AND PARTIAL DERIVATIVES A. HAVENS These problems are for extra-credit, which is counted against lost points on quizzes or WebAssign. You do not
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 informationFinal Exam MAT 100 JS 2018
Final Exam MAT 100 JS 2018 Miles College T Dabit MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Tell which set or sets the number belongs to: natural
More informationEECS 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
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 informationGeneralized barycentric coordinates
Generalized barycentric coordinates Michael S. Floater August 20, 2012 In this lecture, we review the definitions and properties of barycentric coordinates on triangles, and study generalizations to convex,
More informationUsing Arithmetic of Real Numbers to Explore Limits and Continuity
Using Arithmetic of Real Numbers to Explore Limits and Continuity by Maria Terrell Cornell University Problem Let a =.898989... and b =.000000... (a) Find a + b. (b) Use your ideas about how to add a and
More informationSection Rational Functions and Inequalities. A rational function is a quotient of two polynomials. That is, is a rational function if
Section 6.1 --- Rational Functions and Inequalities A rational function is a quotient of two polynomials. That is, is a rational function if =, where and are polynomials and is not the zero polynomial.
More informationx 2 + 3, r 4(x) = x2 1
Math 121 (Lesieutre); 4.2: Rational functions; September 1, 2017 1. What is a rational function? It s a function of the form p(x), where p(x) and q(x) are both polynomials. In other words, q(x) something
More informationEnd Behavior and Symmetry
Algebra 2 Interval Notation Name: Date: Block: X Characteristics of Polynomial Functions Lesson Opener: Graph the function using transformations then identify key characteristics listed below. 1. y x 2
More informationEconomics Nonparametric Econometrics
Economics 217 - Nonparametric Econometrics Topics covered in this lecture Introduction to the nonparametric model The role of bandwidth Choice of smoothing function R commands for nonparametric models
More informationIntroduction to Matlab
Technische Universität München WT 21/11 Institut für Informatik Prof Dr H-J Bungartz Dipl-Tech Math S Schraufstetter Benjamin Peherstorfer, MSc October 22nd, 21 Introduction to Matlab Engineering Informatics
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 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 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 informationToday s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn
Today s class Roots of equation Finish up incremental search Open methods 1 False Position Method Although the interval [a,b] where the root becomes iteratively closer with the false position method, unlike
More informationCONCAVITY AND INFLECTION POINTS
CONCAVITY AND INFLECTION POINTS Find the Second Derivative of the function, f. Set the Second Derivative equal to zero and solve. Determine whether the Second Derivative is undefined for any x-values.
More informationBob Brown Math 251 Calculus 1 Chapter 4, Section 4 Completed 1 CCBC Dundalk
Bob Brown Math 251 Calculus 1 Chapter 4, Section 4 Completed 1 A Function and its Second Derivative Recall page 4 of Handout 3.1 where we encountered the third degree polynomial f(x) x 3 5x 2 4x + 20.
More informationFinancial Optimization ISE 347/447. Lecture 13. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 13 Dr. Ted Ralphs ISE 347/447 Lecture 13 1 Reading for This Lecture C&T Chapter 11 ISE 347/447 Lecture 13 2 Integer Linear Optimization An integer linear optimization
More informationMAT Business Calculus - Quick Notes
MAT 136 - Business Calculus - Quick Notes Last Updated: 4/3/16 Chapter 2 Applications of Differentiation Section 2.1 Using First Derivatives to Find Maximum and Minimum Values and Sketch Graphs THE FIRST-DERIVATIVE
More information1 Linear programming relaxation
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching
More informationR f da (where da denotes the differential of area dxdy (or dydx)
Math 28H Topics for the second exam (Technically, everything covered on the first exam, plus) Constrained Optimization: Lagrange Multipliers Most optimization problems that arise naturally are not unconstrained;
More informationUNIT 3 EXPRESSIONS AND EQUATIONS Lesson 3: Creating Quadratic Equations in Two or More Variables
Guided Practice Example 1 Find the y-intercept and vertex of the function f(x) = 2x 2 + x + 3. Determine whether the vertex is a minimum or maximum point on the graph. 1. Determine the y-intercept. The
More informationover The idea is to construct an algorithm to solve the IVP ODE (8.1)
Runge- Ku(a Methods Review of Heun s Method (Deriva:on from Integra:on) The idea is to construct an algorithm to solve the IVP ODE (8.1) over To obtain the solution point we can use the fundamental theorem
More informationAbstract. 1 Introduction
Contact detection algorithm using Overhauser splines M. Ulbin, S. Ulaga and J. Masker University of Maribor, Faculty of Mechanical Engineering, Smetanova 77, 2000 Maribor, SLOVENIA E-mail: ulbin @ uni-mb.si
More informationJournal of mathematics and computer science 13 (2014),
Journal of mathematics and computer science 13 (2014), 231-237 Interval Interpolation by Newton's Divided Differences Ali Salimi Shamloo Parisa Hajagharezalou Department of Mathematics, Shabestar Branch,
More informationChapter 9 Review. By Charlie and Amy
Chapter 9 Review By Charlie and Amy 9.1- Inverse and Joint Variation- Explanation There are 3 basic types of variation: direct, indirect, and joint. Direct: y = kx Inverse: y = (k/x) Joint: y=kxz k is
More informationF.BF.B.3: Graphing Polynomial Functions
F.BF.B.3: Graphing Polynomial Functions 1 Given the graph of the line represented by the equation f(x) = 2x + b, if b is increased by 4 units, the graph of the new line would be shifted 4 units 1) right
More informationIntroduction to Programming for Engineers Spring Final Examination. May 10, Questions, 170 minutes
Final Examination May 10, 2011 75 Questions, 170 minutes Notes: 1. Before you begin, please check that your exam has 28 pages (including this one). 2. Write your name and student ID number clearly on your
More information5-3 Polynomial Functions
For each graph, a. describe the end behavior, b. determine whether it represents an odd-degree or an even-degree function, and c. state the number of real zeros. 35. a. As the x-values approach negative
More informationDyadic Interpolation Schemes
Dyadic Interpolation Schemes Mie Day, January 8 Given a set of equally-spaced samples of some function, we d lie to be able to mae educated guesses for the values which the function would tae on at points
More informationFinite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 24
Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras Lecture - 24 So in today s class, we will look at quadrilateral elements; and we will
More informationExploring Rational Functions
Name Date Period Exploring Rational Functions Part I - The numerator is a constant and the denominator is a linear factor. 1. The parent function for rational functions is: Graph and analyze this function:
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 informationComputational Methods. Constrained Optimization
Computational Methods Constrained Optimization Manfred Huber 2010 1 Constrained Optimization Unconstrained Optimization finds a minimum of a function under the assumption that the parameters can take on
More informationDocumentation for Numerical Derivative on Discontinuous Galerkin Space
Documentation for Numerical Derivative on Discontinuous Galerkin Space Stefan Schnake 204 Introduction This documentation gives a guide to the syntax and usage of the functions in this package as simply
More informationHigh order regularization of Dirac-delta sources in two space dimensions.
INTERNSHIP REPORT High order regularization of Dirac-delta sources in two space dimensions. Author: Wouter DE VRIES s1010239 Supervisors: Prof. Guustaaf JACOBS Jean-Piero SUAREZ HOST INSTITUTION: San Diego
More informationQUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY. 7.1 Minimum/Maximum, Recall: Completing the square
CHAPTER 7 QUADRATIC FUNCTIONS: MINIMUM/MAXIMUM POINTS, USE OF SYMMETRY 7.1 Minimum/Maximum, Recall: Completing the square The completing the square method uses the formula x + y) = x + xy + y and forces
More information6.867 Machine Learning
6.867 Machine Learning Problem set 3 Due Tuesday, October 22, in class What and how to turn in? Turn in short written answers to the questions explicitly stated, and when requested to explain or prove.
More information3.1 INTRODUCTION TO THE FAMILY OF QUADRATIC FUNCTIONS
3.1 INTRODUCTION TO THE FAMILY OF QUADRATIC FUNCTIONS Finding the Zeros of a Quadratic Function Examples 1 and and more Find the zeros of f(x) = x x 6. Solution by Factoring f(x) = x x 6 = (x 3)(x + )
More informationToday is the last day to register for CU Succeed account AND claim your account. Tuesday is the last day to register for my class
Today is the last day to register for CU Succeed account AND claim your account. Tuesday is the last day to register for my class Back board says your name if you are on my roster. I need parent financial
More informationIntroduction to Optimization
Introduction to Optimization Second Order Optimization Methods Marc Toussaint U Stuttgart Planned Outline Gradient-based optimization (1st order methods) plain grad., steepest descent, conjugate grad.,
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 informationSung-Eui Yoon ( 윤성의 )
CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and
More informationCHAPTER 4: Polynomial and Rational Functions
171S MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More informationGRAPHING POLYNOMIALS DAY 2 U N I T 1 1
GRAPHING POLYNOMIALS DAY 2 U N I T 1 1 ODD/EVEN DEGREE POLYNOMIAL Odd degree polynomial: A polynomial whose largest power is an odd integer Even degree polynomial : A polynomial whose largest power is
More informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION f(x) MISN-0-349 NUMERICAL INTEGRATION by Robert Ehrlich George Mason University 1. Numerical Integration Algorithms a. Introduction.............................................1 b.
More informationSolve Non-Linear Parabolic Partial Differential Equation by Spline Collocation Method
Solve Non-Linear Parabolic Partial Differential Equation by Spline Collocation Method P.B. Choksi 1 and A.K. Pathak 2 1 Research Scholar, Rai University,Ahemdabad. Email:pinalchoksey@gmail.com 2 H.O.D.
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 informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 19 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationBlock-based Thiele-like blending rational interpolation
Journal of Computational and Applied Mathematics 195 (2006) 312 325 www.elsevier.com/locate/cam Block-based Thiele-like blending rational interpolation Qian-Jin Zhao a, Jieqing Tan b, a School of Computer
More informationSection 7.6 Graphs of the Sine and Cosine Functions
Section 7.6 Graphs of the Sine and Cosine Functions We are going to learn how to graph the sine and cosine functions on the xy-plane. Just like with any other function, it is easy to do by plotting points.
More informationover The idea is to construct an algorithm to solve the IVP ODE (9.1)
Runge- Ku(a Methods Review of Heun s Method (Deriva:on from Integra:on) The idea is to construct an algorithm to solve the IVP ODE (9.1) over To obtain the solution point we can use the fundamental theorem
More information1. Divide by using long division. (8x 3 + 6x 2 + 7) (x + 2)
Bellwork 0-7-4. Divide by using long division. (8x + 6x 2 + 7) (x + 2) Synthetic division is a shorthand method of dividing a polynomial by a linear binomial by using only the coefficients. For synthetic
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 information2.1 Quadraticsnts.notebook. September 10, 2018
1 A quadratic function is a polynomial function of second degree. The graph of a quadratic function is called a parabola. 2 Standard Form: Intercept Form: Vertex Form: f(x) = a(x h) 2 + k vertex: (h, k)
More informationMath Numerical Analysis Homework #3 Solutions
Math 24 - Numerical Analysis Homework #3 Solutions. Write a program for polynomial interpolation of function values. Your program should accept two vectors as input. A vector of x coordinates for interpolation
More informationUnit #22 - The Chain Rule, Higher Partial Derivatives & Optimization Section 14.7
Unit #22 - The Chain Rule, Higher Partial Derivatives & Optimization Section 14.7 Some material from Calculus, Single and MultiVariable by Hughes-Hallett, Gleason, McCallum et. al. Copyright 2005 by John
More informationCollege Algebra. Fifth Edition. James Stewart Lothar Redlin Saleem Watson
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson 4 Polynomial and Rational Functions 4.6 Rational Functions Rational Functions A rational function is a function of the form Px (
More informationBoolean networks, local models, and finite polynomial dynamical systems
Boolean networks, local models, and finite polynomial dynamical systems Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2017
More informationPolymath 6. Overview
Polymath 6 Overview Main Polymath Menu LEQ: Linear Equations Solver. Enter (in matrix form) and solve a new system of simultaneous linear equations. NLE: Nonlinear Equations Solver. Enter and solve a new
More informationDifferentiation. J. Gerlach November 2010
Differentiation J. Gerlach November 200 D and diff The limit definition of the derivative is covered in the Limit tutorial. Here we look for direct ways to calculate derivatives. Maple has two commands
More informationMid-Chapter Quiz: Lessons 2-1 through 2-3
Graph and analyze each function. Describe its domain, range, intercepts, end behavior, continuity, and where the function is increasing or decreasing. 1. f (x) = 2x 3 2 16 1.5 6.75 1 2 0 0 1 2 1.5 6.75
More informationCS-184: Computer Graphics. Today
CS-84: Computer Graphics Lecture #5: Curves and Surfaces Prof. James O Brien University of California, Berkeley V25F-5-. Today General curve and surface representations Splines and other polynomial bases
More information