Lecture 6: Interpolation
|
|
- Ashley McKenzie
- 6 years ago
- Views:
Transcription
1 Lecture 6: Interpolation Fatih Guvenen January 10, 2016 Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
2 General Idea Suppose you are given a grid (x 1, x 2,..., x n ) and the function values (y 1, y 2,...,y n ) at corresponding points generated by function f (x) Q: How to find values off the grid points that provides a good approximation to f (x)? A good approximation is often taken to mean to minimize f (x) b f (x) according to some norm (L p, sup-, etc). In economics another very important concern is to preserve the shape ie, concavity or convexity of the interpolated (e.g, utility or value) function Popular methods are linear-, Chebyshev-, and Splineinterpolations. I will spend most of my time on Splines. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
3 Polynomial Approximation Weierstrass Approximation Theorem. Suppose f is a continuous real-valued function defined on the real interval [a, b]. For a given ">0, there exists a polynomial of order n, P n (x), such that for all x in [a, b], we have kf (x) P n (x)k 1 <". In the limit, lim kf (x) P n(x)k n!1 1 = 0. Runge. Let f (x) =1/(1 + x 2 ) on [-5,5], and let L m f be the unique polynomial of order m that interpolates f at m equally-spaced points. Then: lim sup f (x) L m f = m!1 ( 0 if x < , 1 if x > The two theorems are not contradictory. The first theorem does not provide a way of finding the right P n (x) and the second one shows a naive approach can fail spectacularly. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
4 Runge Example
5 Splines: Three Objectives 1 Match the function values at grid points (y 1, y 2,...,y n ) exactly. 2 Generate first derivatives that are continuous and differentiable for all x 2 [x 1, x n ]. 3 Generate second derivatives that are continuous for all x 2 [x 1, x n ] Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
6 Splines: Building from Ground Up Begin with the interval between two generic knots, x i and x i+1. If we were to construct a linear interpolant: y = Ay j + By j+1 A(x) x j+1 x B(x) 1 A = x x j (1) x j+1 x j x j+1 x j Although linear interpolation is sometimes useful, a shortcoming is that I I First derivative changes abruptly at the knot points, i.e., the interpolants have as many kinks as the knot points. Second derivative does not exist at knot points. This can create many problems, such as difficulties with derivative based minimization algorithms. Question: How can we modify (1) to allow differentiable first derivatives and continuous second derivatives at all points? Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
7 Splines: Building from Ground Up Generalize (1) using second derivative values at knot points: y = A(x)y j + B(x)y j+1 + C(x)y 00 j + D(x)y 00 j+1 (2) where C(x) = 1 6 (A3 (x) A(x))(x j+1 x j ) 2 and D(x) = 1 6 (B3 (x) B(x))(x j+1 x j ) 2 Note that you only need to know A and B to calculate everything. Verify that d 2 y dx 2 = A(x)y 00 j + B(x)y 00 j+1 Since A(x j )=1and B(x j+1 )=1 A(x j+1 )=1, the second derivative agrees with y 00 at end points. But how to find y 00 j and y 00 j+1? Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
8 Splines: Building from Ground Up Differentiate (2) to obtain an expression for dy dx and y 00 j+1. that will involve y 00 j Then impose the condition that dy dx calculated using (x j, x j+1 ) and using (x j+1, x j+2 ) equal each other at x j+1. We get: x j x j 1 y 00 j x j+1 x j 3 y 00 j + x j+1 x j 6 y 00 j+1 = y j+1 y j x j+1 x j y j y j 1 x j x j 1 For interior knot points, j = 2,...,N 1 we have an equation like this. But we have N unknowns (y j for j = 1,...,N). Impose two boundary conditions to pin down y and yn. (Set them to zero or some reasonable value given the economics of the problem). Notice: no condition is imposed for y 0 or y 00 to agree with f 0 and f 00, since these are unknown. This can create problems as we will see. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
9 Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
10 Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
11 Comparing Interpolation Methods for U(C)
12 Comparing Boundary Conditions Figure: N = 500 pts Log Axis y 1 = U (0.05) y 1 =0 Natural Spline True Function
13 Comparing Boundary Conditions Figure: N = 100 pts Linear Axis y 1 = U (0.05) y 1 =0 Natural spline True Function
14 Interpolation: What Can Go Wrong 2 x CRRA function with γ =10 8th-order polynomial Cubic spline Shumaker quadratic spline Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
15 Interpolation: What Can Go Wrong Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
16 Standard Spline vs Shape-Preserving y=tanh(x) at x= 5, 4, 3,... Cubic spline Shumaker s spline y=tanh(x) continuous Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
17 Spacing of Grid Points: Crucial!! One heuristic: put more grid points where f has more curvature. Another one: put more points near the parts of the function that are more relevant. I e.g., in an RBC style model, put more points near K, even though the functions of interest may have more curvature at low K values. In incomp. mkts models, V 00 (!) is largest for very low!. So should put more points there. Is this true if there are not many individuals near the constraint? (Answer: Typically, Yes. But why?) In some DP problems, with max operator on the RHS, the value function may have a kink or significant curvature somewhere in the middle of the state space. I Linear interpolation maybe your best choice. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
18 Figure: Grid Point Locations: 51-Point Expanding Grid From 0 to 250 θ = 1 θ = 2 θ = 3 θ = 4 θ = 1 θ = 2 θ = 3 θ = Wealth Wealth (a) Low End of Grid (b) High End of Grid Note: The number of grid points between 0 and 4.99 is 1, 8, 14, and 19 when is equal to 1, 2, 3, and 4, respectively.
19 Algorithmus 1 : CREATING APOLYNOMIALLY-EXPANDING GRID Step 1. First, create an equally-spaced [0,1] grid: { x j : x j = j 1 N 1, j = 1,...,N}. Step 2. Shift and expand the grid: x = {x j : x j = a +(b a) x j }, where >1 is the expansion factor. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
20 Spline w/ Expanding Grid(1000 pts) Figure: N = 1000 pts Equally-spaced, θ =1.0 θ = 1.05 θ = Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
21 Spline w/ Expanding Grid (100 pts) Figure: N = 100 pts 10 5 U(C) θ = 1.0 θ = 2.0 θ = Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
22 AWordaboutB-Splines A fundamental theorem about B-splines (see de Boor (1978)): Constructing a cubic spline interpolation with (m, n) points in (x, y) direction requires: I I O((mn) 2 ) operations using regular splines. O(m 3 + m 2 n + mn 2 + n 3 ) operations with B-splines. Suppose m = n = 10: I I Regular spline requires 1, 000, 000 operations B-splines require: 4, 000 operations! ) Learn about B-splines! Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
23 ATricktoReducetheCurvatureofV(w) Samuelson (1969) showed that in a standard portfolio choice problem with CRRA preferences and a linear budget set, the value function inherits the curvature of U: U(c 0, c 1,...)= 1X t=1 t c1 t 1 ) V (!, A) = (A)! 1 The same result holds approximately true in a variety of different problems. With incomplete markets V (w) will typically have even more curvature than U(c) especially at low wealth levels. As we have seen so far, this high curvature creates a lot of headache when you try to interpolate the value function. Fortunately, there is a way out! Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
24 ATricktoReducetheCurvatureofV(w) There is an alternative formulation of CRRA preferences: U(c 0, c 1,...)= 1X t=1 t c (1 ) t! 1/(1 ) This is a special case of Epstein-Zin (1989, E trica) utility and represents the same preferences as CRRA utility with RRA =. Now the value function is linear: V (!, A) = (A)! Although incomplete markets introduces some curvature, this value function is much easier to interpolate than the one above. In fact, I once solved a GE model with asset pricing and a risk aversion of 4 using only 30 points in the wealth grid and linear interpolation! Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
25 Standard CRRA Utility (left axis) Epstein-Zin Value Func. (right axis) Figure: Which Function Would You Rather Interpolate? Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
26 Final Thoughts For any model that you solve, you MUST eventually re-solve it on a much finer grid and confirm that your main results are not changing (much). This is the only realistic way to check if approximation errors coming from interpolations are important. You will be surprised to find that some bad-looking interpolations actually yield the same results as much more accurate (and more costly to compute) interpolations. And vice versa.. Some problems are especially sensitive to any kind of approximation errors. We will see examples. Fatih Guvenen ( ) Lecture 6: Interpolation January 10, / 25
Lecture VIII. Global Approximation Methods: I
Lecture VIII Global Approximation Methods: I Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Global Methods p. 1 /29 Global function approximation Global methods: function
More informationMultiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET
Multiple-Choice Test Spline Method Interpolation COMPLETE SOLUTION SET 1. The ollowing n data points, ( x ), ( x ),.. ( x, ) 1, y 1, y n y n quadratic spline interpolation the x-data needs to be (A) equally
More 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 informationNumerical Methods in Physics Lecture 2 Interpolation
Numerical Methods in Physics Pat Scott Department of Physics, Imperial College November 8, 2016 Slides available from http://astro.ic.ac.uk/pscott/ course-webpage-numerical-methods-201617 Outline The problem
More informationMar. 20 Math 2335 sec 001 Spring 2014
Mar. 20 Math 2335 sec 001 Spring 2014 Chebyshev Polynomials Definition: For an integer n 0 define the function ( ) T n (x) = cos n cos 1 (x), 1 x 1. It can be shown that T n is a polynomial of degree n.
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 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 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 informationComputational Physics PHYS 420
Computational Physics PHYS 420 Dr Richard H. Cyburt Assistant Professor of Physics My office: 402c in the Science Building My phone: (304) 384-6006 My email: rcyburt@concord.edu My webpage: www.concord.edu/rcyburt
More 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 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 informationInteractive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1
Interactive Graphics Lecture 9: Introduction to Spline Curves Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 13: Slide 2 Splines The word spline comes from the ship building trade
More informationLecture 2 Optimization with equality constraints
Lecture 2 Optimization with equality constraints Constrained optimization The idea of constrained optimisation is that the choice of one variable often affects the amount of another variable that can be
More information3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2013 3D Object Representations Raw data Point cloud Range image Polygon soup Surfaces Mesh Subdivision Parametric Implicit Solids Voxels
More informationInterpolation - 2D mapping Tutorial 1: triangulation
Tutorial 1: triangulation Measurements (Zk) at irregular points (xk, yk) Ex: CTD stations, mooring, etc... The known Data How to compute some values on the regular spaced grid points (+)? The unknown data
More information3D Modeling Parametric Curves & Surfaces
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2012 3D Object Representations Raw data Point cloud Range image Polygon soup Solids Voxels BSP tree CSG Sweep Surfaces Mesh Subdivision
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 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 informationx y
10. LECTURE 10 Objectives I understand the difficulty in finding an appropriate function for a data set in general. In some cases, I can define a function type that may fit a data set well. Last time,
More informationProjective spaces and Bézout s theorem
Projective spaces and Bézout s theorem êaû{0 Mijia Lai 5 \ laimijia@sjtu.edu.cn Outline 1. History 2. Projective spaces 3. Conics and cubics 4. Bézout s theorem and the resultant 5. Cayley-Bacharach theorem
More informationRational Bezier Curves
Rational Bezier Curves Use of homogeneous coordinates Rational spline curve: define a curve in one higher dimension space, project it down on the homogenizing variable Mathematical formulation: n P(u)
More informationSection 1.5 Transformation of Functions
Section 1.5 Transformation of Functions 61 Section 1.5 Transformation of Functions Often when given a problem, we try to model the scenario using mathematics in the form of words, tables, graphs and equations
More informationKevin James. MTHSC 102 Section 1.5 Polynomial Functions and Models
MTHSC 102 Section 1.5 Polynomial Functions and Models Definition A quadratic function is a function whose second differences are constant. It achieves either a local max or a local min and has no inflection
More information15.10 Curve Interpolation using Uniform Cubic B-Spline Curves. CS Dept, UK
1 An analysis of the problem: To get the curve constructed, how many knots are needed? Consider the following case: So, to interpolate (n +1) data points, one needs (n +7) knots,, for a uniform cubic B-spline
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 informationLecture 25 Nonlinear Programming. November 9, 2009
Nonlinear Programming November 9, 2009 Outline Nonlinear Programming Another example of NLP problem What makes these problems complex Scalar Function Unconstrained Problem Local and global optima: definition,
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 informationConsider functions such that then satisfies these properties: So is represented by the cubic polynomials on on and on.
1 of 9 3/1/2006 2:28 PM ne previo Next: Trigonometric Interpolation Up: Spline Interpolation Previous: Piecewise Linear Case Cubic Splines A piece-wise technique which is very popular. Recall the philosophy
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationVolumes of Solids of Revolution
Volumes of Solids of Revolution Farid Aliniaeifard York University http://math.yorku.ca/ faridanf April 27, 2016 Overview What is a solid of revolution? Method of Rings or Method of Disks Method of Cylindrical
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
More informationSupplemental 1.5. Objectives Interval Notation Increasing & Decreasing Functions Average Rate of Change Difference Quotient
Supplemental 1.5 Objectives Interval Notation Increasing & Decreasing Functions Average Rate of Change Difference Quotient Interval Notation Many times in this class we will only want to talk about what
More informationPiecewise polynomial interpolation
Chapter 2 Piecewise polynomial interpolation In ection.6., and in Lab, we learned that it is not a good idea to interpolate unctions by a highorder polynomials at equally spaced points. However, it transpires
More informationEC5555 Economics Masters Refresher Course in Mathematics September Lecture 6 Optimization with equality constraints Francesco Feri
EC5555 Economics Masters Refresher Course in Mathematics September 2013 Lecture 6 Optimization with equality constraints Francesco Feri Constrained optimization The idea of constrained optimisation is
More informationIB HL Mathematical Exploration
IB HL Mathematical Exploration Modelling the surface area of a ceramic pot Personal code: glt101 Table of Contents Introduction... 1 Rationale... 1 Aim... 1-2 Exploring the formula for surface area...
More informationCS770/870 Spring 2017 Curve Generation
CS770/870 Spring 2017 Curve Generation Primary resources used in preparing these notes: 1. Foley, van Dam, Feiner, Hughes, Phillips, Introduction to Computer Graphics, Addison-Wesley, 1993. 2. Angel, Interactive
More informationSection 1.5 Transformation of Functions
6 Chapter 1 Section 1.5 Transformation of Functions Often when given a problem, we try to model the scenario using mathematics in the form of words, tables, graphs and equations in order to explain or
More informationDepth First Search A B C D E F G A B C 5 D E F 3 2 G 2 3
Depth First Search A B C D E F G A 4 3 2 B 4 5 4 3 C 5 D 3 4 2 E 2 2 3 F 3 2 G 2 3 Minimum (Weight) Spanning Trees Let G be a graph with weights on the edges. We define the weight of any subgraph of G
More informationImportant Properties of B-spline Basis Functions
Important Properties of B-spline Basis Functions P2.1 N i,p (u) = 0 if u is outside the interval [u i, u i+p+1 ) (local support property). For example, note that N 1,3 is a combination of N 1,0, N 2,0,
More informationKnow it. Control points. B Spline surfaces. Implicit surfaces
Know it 15 B Spline Cur 14 13 12 11 Parametric curves Catmull clark subdivision Parametric surfaces Interpolating curves 10 9 8 7 6 5 4 3 2 Control points B Spline surfaces Implicit surfaces Bezier surfaces
More informationLacunary Interpolation Using Quartic B-Spline
General Letters in Mathematic, Vol. 2, No. 3, June 2017, pp. 129-137 e-issn 2519-9277, p-issn 2519-9269 Available online at http:\\ www.refaad.com Lacunary Interpolation Using Quartic B-Spline 1 Karwan
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 6
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 6 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 19, 2012 Andre Tkacenko
More informationLecture 2.2 Cubic Splines
Lecture. Cubic Splines Cubic Spline The equation for a single parametric cubic spline segment is given by 4 i t Bit t t t i (..) where t and t are the parameter values at the beginning and end of the segment.
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 informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
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 informationAMS527: Numerical Analysis II
AMS527: Numerical Analysis II A Brief Overview of Finite Element Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao SUNY Stony Brook AMS527: Numerical Analysis II 1 / 25 Overview Basic concepts Mathematical
More informationB-spline Curves. Smoother than other curve forms
Curves and Surfaces B-spline Curves These curves are approximating rather than interpolating curves. The curves come close to, but may not actually pass through, the control points. Usually used as multiple,
More informationFall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.
Fall 2014 CSCI 420: Computer Graphics 4.2 Splines Hao Li http://cs420.hao-li.com 1 Roller coaster Next programming assignment involves creating a 3D roller coaster animation We must model the 3D curve
More informationCOMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg
COMPUTER AIDED GEOMETRIC DESIGN Thomas W. Sederberg January 31, 2011 ii T. W. Sederberg iii Preface This semester is the 24 th time I have taught a course at Brigham Young University titled, Computer Aided
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationQuadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24
More information(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2
(1 Given the following system of linear equations, which depends on a parameter a R, x + 2y 3z = 4 3x y + 5z = 2 4x + y + (a 2 14z = a + 2 (a Classify the system of equations depending on the values of
More informationNatural Quartic Spline
Natural Quartic Spline Rafael E Banchs INTRODUCTION This report describes the natural quartic spline algorithm developed for the enhanced solution of the Time Harmonic Field Electric Logging problem As
More information5.1 Introduction to the Graphs of Polynomials
Math 3201 5.1 Introduction to the Graphs of Polynomials In Math 1201/2201, we examined three types of polynomial functions: Constant Function - horizontal line such as y = 2 Linear Function - sloped line,
More informationAM205: lecture 2. 1 These have been shifted to MD 323 for the rest of the semester.
AM205: lecture 2 Luna and Gary will hold a Python tutorial on Wednesday in 60 Oxford Street, Room 330 Assignment 1 will be posted this week Chris will hold office hours on Thursday (1:30pm 3:30pm, Pierce
More informationCONSUMPTION BASICS. MICROECONOMICS Principles and Analysis Frank Cowell. July 2017 Frank Cowell: Consumption Basics 1
CONSUMPTION BASICS MICROECONOMICS Principles and Analysis Frank Cowell July 2017 Frank Cowell: Consumption Basics 1 Overview Consumption: Basics The setting The environment for the basic consumer optimisation
More informationIntroduction to Optimization Problems and Methods
Introduction to Optimization Problems and Methods wjch@umich.edu December 10, 2009 Outline 1 Linear Optimization Problem Simplex Method 2 3 Cutting Plane Method 4 Discrete Dynamic Programming Problem Simplex
More informationLECTURE NOTES - SPLINE INTERPOLATION. 1. Introduction. Problems can arise when a single high-degree polynomial is fit to a large number
LECTURE NOTES - SPLINE INTERPOLATION DR MAZHAR IQBAL 1 Introduction Problems can arise when a single high-degree polynomial is fit to a large number of points High-degree polynomials would obviously pass
More informationDerivatives and Graphs of Functions
Derivatives and Graphs of Functions September 8, 2014 2.2 Second Derivatives, Concavity, and Graphs In the previous section, we discussed how our derivatives can be used to obtain useful information about
More informationRecent Developments in Model-based Derivative-free Optimization
Recent Developments in Model-based Derivative-free Optimization Seppo Pulkkinen April 23, 2010 Introduction Problem definition The problem we are considering is a nonlinear optimization problem with constraints:
More informationIntroduction to optimization methods and line search
Introduction to optimization methods and line search Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi How to find optimal solutions? Trial and error widely used in practice, not efficient and
More informationMath 113 Exam 1 Practice
Math Exam Practice January 6, 00 Exam will cover sections 6.-6.5 and 7.-7.5 This sheet has three sections. The first section will remind you about techniques and formulas that you should know. The second
More informationBézier Splines. B-Splines. B-Splines. CS 475 / CS 675 Computer Graphics. Lecture 14 : Modelling Curves 3 B-Splines. n i t i 1 t n i. J n,i.
Bézier Splines CS 475 / CS 675 Computer Graphics Lecture 14 : Modelling Curves 3 n P t = B i J n,i t with 0 t 1 J n, i t = i=0 n i t i 1 t n i No local control. Degree restricted by the control polygon.
More information1 Programs for phase portrait plotting
. 1 Programs for phase portrait plotting We are here looking at how to use our octave programs to make phase portraits of two dimensional systems of ODE, adding automatically or halfautomatically arrows
More informationResearch Article Data Visualization Using Rational Trigonometric Spline
Applied Mathematics Volume Article ID 97 pages http://dx.doi.org/.//97 Research Article Data Visualization Using Rational Trigonometric Spline Uzma Bashir and Jamaludin Md. Ali School of Mathematical Sciences
More informationComputational Biology Lecture 6: Affine gap penalty function, multiple sequence alignment Saad Mneimneh
Computational Biology Lecture 6: Affine gap penalty function, multiple sequence alignment Saad Mneimneh We saw earlier how we can use a concave gap penalty function γ, i.e. one that satisfies γ(x+1) γ(x)
More informationSpline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1
Spline Curves Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Problem: In the previous chapter, we have seen that interpolating polynomials, especially those of high degree, tend to produce strong
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 informationBackground for Surface Integration
Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to
More information2. Convex sets. x 1. x 2. affine set: contains the line through any two distinct points in the set
2. Convex sets Convex Optimization Boyd & Vandenberghe affine and convex sets some important examples operations that preserve convexity generalized inequalities separating and supporting hyperplanes dual
More informationFirst of all, we need to know what it means for a parameterize curve to be differentiable. FACT:
CALCULUS WITH PARAMETERIZED CURVES In calculus I we learned how to differentiate and integrate functions. In the chapter covering the applications of the integral, we learned how to find the length of
More informationSPLINE APPROXIMATION VIA THE CONTROL POLYGON
SPLINE APPROXIMATION VIA THE CONTROL POLYGON by Håkon Mørk THESIS for the degree of MASTER S DEGREE IN APPLIED MATHEMATICS AND MECHANICS (Master i Anvendt matematikk og mekanikk) Faculty of Mathematics
More informationCS 475 / CS Computer Graphics. Modelling Curves 3 - B-Splines
CS 475 / CS 675 - Computer Graphics Modelling Curves 3 - Bézier Splines n P t = i=0 No local control. B i J n,i t with 0 t 1 J n,i t = n i t i 1 t n i Degree restricted by the control polygon. http://www.cs.mtu.edu/~shene/courses/cs3621/notes/spline/bezier/bezier-move-ct-pt.html
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationConvex Optimization. Convex Sets. ENSAE: Optimisation 1/24
Convex Optimization Convex Sets ENSAE: Optimisation 1/24 Today affine and convex sets some important examples operations that preserve convexity generalized inequalities separating and supporting hyperplanes
More informationConvex sets and convex functions
Convex sets and convex functions Convex optimization problems Convex sets and their examples Separating and supporting hyperplanes Projections on convex sets Convex functions, conjugate functions ECE 602,
More informationThe Interpolating Polynomial
Math 45 Linear Algebra David Arnold David-Arnold@Eureka.redwoods.cc.ca.us Abstract A polynomial that passes through a given set of data points is called an interpolating polynomial. In this exercise you
More informationParametric Curves. University of Texas at Austin CS384G - Computer Graphics
Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationNumerical Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania
Numerical Dynamic Programming Jesus Fernandez-Villaverde University of Pennsylvania 1 Introduction In the last set of lecture notes, we reviewed some theoretical background on numerical programming. Now,
More informationSec.4.1 Increasing and Decreasing Functions
U4L1: Sec.4.1 Increasing and Decreasing Functions A function is increasing on a particular interval if for any, then. Ie: As x increases,. A function is decreasing on a particular interval if for any,
More information2D Spline Curves. CS 4620 Lecture 13
2D Spline Curves CS 4620 Lecture 13 2008 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes [Boeing] that is, without discontinuities So far we can make things with corners
More informationTest 3 review SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Test 3 review SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Approximate the coordinates of each turning point by graphing f(x) in the standard viewing
More informationConvex sets and convex functions
Convex sets and convex functions Convex optimization problems Convex sets and their examples Separating and supporting hyperplanes Projections on convex sets Convex functions, conjugate functions ECE 602,
More informationCurve fitting using linear models
Curve fitting using linear models Rasmus Waagepetersen Department of Mathematics Aalborg University Denmark September 28, 2012 1 / 12 Outline for today linear models and basis functions polynomial regression
More 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 informationSimple Keyframe Animation
Simple Keyframe Animation Mike Bailey mjb@cs.oregonstate.edu This work is licensed under a Creative Commons Attribution-NonCommercial- NoDerivatives 4. International License keyframe.pptx Approaches to
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 informationSplines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes
CSCI 420 Computer Graphics Lecture 8 Splines Jernej Barbic University of Southern California Hermite Splines Bezier Splines Catmull-Rom Splines Other Cubic Splines [Angel Ch 12.4-12.12] Roller coaster
More informationQUADRATIC FUNCTIONS. PROTOTYPE: f(x) = ax 2 + bx + c. (1) The leading coefficient a 0 is called the shape parameter.
QUADRATIC FUNCTIONS PROTOTYPE: f(x) = ax 2 + bx + c. (1) The leading coefficient a 0 is called the shape parameter. SHAPE-VERTEX FORMULA One can write any quadratic function (1) as f(x) = a(x h) 2 + k,
More informationMAT128A: Numerical Analysis Lecture Two: Finite Precision Arithmetic
MAT128A: Numerical Analysis Lecture Two: Finite Precision Arithmetic September 28, 2018 Lecture 1 September 28, 2018 1 / 25 Floating point arithmetic Computers use finite strings of binary digits to represent
More informationLinear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 016, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
More informationParametric curves. Reading. Curves before computers. Mathematical curve representation. CSE 457 Winter Required:
Reading Required: Angel 10.1-10.3, 10.5.2, 10.6-10.7, 10.9 Parametric curves CSE 457 Winter 2014 Optional Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics and Geometric
More informationDifferentiability and Tangent Planes October 2013
Differentiability and Tangent Planes 14.4 04 October 2013 Differentiability in one variable. Recall for a function of one variable, f is differentiable at a f (a + h) f (a) lim exists and = f (a) h 0 h
More informationMA 323 Geometric Modelling Course Notes: Day 14 Properties of Bezier Curves
MA 323 Geometric Modelling Course Notes: Day 14 Properties of Bezier Curves David L. Finn In this section, we discuss the geometric properties of Bezier curves. These properties are either implied directly
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 informationConvergence of C 2 Deficient Quartic Spline Interpolation
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 4 (2017) pp. 519-527 Research India Publications http://www.ripublication.com Convergence of C 2 Deficient Quartic Spline
More informationALGEBRA 2 W/ TRIGONOMETRY MIDTERM REVIEW
Name: Block: ALGEBRA W/ TRIGONOMETRY MIDTERM REVIEW Algebra 1 Review Find Slope and Rate of Change Graph Equations of Lines Write Equations of Lines Absolute Value Functions Transformations Piecewise Functions
More information