Geometric Interpolation by Planar Cubic Polynomials
|
|
- Gregory Fowler
- 5 years ago
- Views:
Transcription
1 1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,
2 2 / 20 Introduction: geometric interpolation Geometric interpolation schemes are an important tool for approximation of curves. The basic idea: parameter values are not prescribed in advance. The freedom of choosing a parametrization is used to increase an approximation order and to improve the shape of the interpolant. Nonlinear equations. Existence? Implementation? Asymptotic analysis. Geometric conditions for the existence of the interpolant.
3 Introduction: the interpolation problem For given data points T 0, T 1,..., T 5 R 2, T i T i+1, find a cubic curve P 3 : [0, 1] R 2 that interpolates these points, P 3 (t i ) = T i, i = 0, 1,..., 5, (1) where the parameters are ordered as 0 =: t 0 < t 1 < < t 4 < t 5 := 1. (2) The admissible parameters t i are lying in the open simplex D := { t := (t i ) 5 i=0 ; 0 =: t 0 < t 1 < < t 4 < t 5 := 1 }, with the boundary D where at least two different t i coincide. 3 / 20
4 4 / 20 Introduction: the interpolation problem The nonlinear part of the problem is to determine the parameters t D. The coefficients of P 3 are then obtained by using any standard interpolation scheme (Newton, Lagrange,...) componentwise. The main motivation is the shape of the interpolant P 3. A comparison: Cubic geometric scheme quintic interpolation scheme (uniform, chord length parameterization).
5 5 / 20 Introduction: motivation T 3 T 2 T 0 T 1 T 2 T3 T 4 T 1 T 4 T 5 T 0 T 5 T 5 T 3 T 4 T 5 T 1 T 2 T 3 T 4 T 2 T 0 T 0 T 1
6 6 / 20 The equations: notation The existence conditions will be based on data differences T i := T i+1 T i and on the signs and ratios of determinants: D i,j := det ( T i, T j ), λ 1 := D 0,1 D 1,2, λ 2 := D 0,2 D 1,2, λ 3 := D 2,4 D 2,3, λ 4 := D 3,4 D 2,3, δ := D 1,3 D 1,2, µ := D 2,3 D 1,2.
7 7 / 20 The equations: notation T 4 T 2 T 3 T T 3 T 2 0 Λ 1 0 Λ 2 0 T 0 Convex data T 4 Λ 3 0 Λ 4 0 Λ 1 0 Λ 2 0 T 1 T 0 Nonconvex data Convex data: D 1,2 D 2,3 0, λ i > 0 and µ > 0. Nonconvex data: D 1,2 D 2,3 0, λ i > 0 and µ < 0.
8 8 / 20 The equations Equations: P 3 (t i ) = T i, i = 0, 1,..., 5. Separate the equations for unknown parameters t from the equations for unknown coefficients of P 3. How? Apply the divided differences [t l, t l+1,..., t l+4 ]: where [t l, t l+1,..., t l+4 ]P 3 = [t l, t l+1,..., t l+4 ] (T i ) 5 i=0, 0 = l+4 i=l 1 ω l (t i ) T i, l = 0, 1, ω l (t) := (t t l )(t t l+1 )... (t t l+4 ), l = 0, 1.
9 9 / 20 The equations After some transformations the system for the unknown parameters t i becomes 1 ω 0 (t 0 ) (1 + λ 2) + 1 ω 0 (t 1 ) + 1 µ= 0, ω 0 (t 4 ) 1 ω 0 (t 0 ) λ ω 0 (t 3 ) + 1 (1 + δ)= 0, (3) ω 0 (t 4 ) ( δ ) + 1 ω 1 (t 1 ) µ ω 1 (t 2 ) + 1 ω 1 (t 5 ) λ 4= 0, 1 1 ω 1 (t 1 ) µ + 1 ω 1 (t 4 ) + 1 ω 1 (t 5 ) (1 + λ 3)= 0.
10 10 / 20 The main results: notation Unfortunately the existence conditions do not depend on the signs of λ, µ and δ only. Let us define γ 1 := γ 2 := λ 2 (1 + λ 2 ) λ 1 (1 + λ 2 ) + λ 1 (1 + λ 2 )(λ 1 + λ 2 ), λ 3 (1 + λ 3 ) λ 4 (1 + λ 3 ) + λ 4 (1 + λ 3 )(λ 4 + λ 3 ), λ:= (λ i ) 4 i=1.
11 11 / 20 The main results: notation The following functions will give boundary conditions on the constants ϑ 1 (λ, µ):= 2µ γ 1 + γ µ(1 + γ 1) 2γ 1, ϑ 2 (λ, µ):= 2 µγ 2 + µ 2 γ µ(1 + γ 2), 2γ 2 ϑ 3 (λ, µ):= λ 1µ + λ 4 λ 1 (λ 1 + λ 2 ), λ λ 2 λ 3 + µ λ 2 ϑ 4 (λ, µ):= λ 1µ λ 2 + λ 4 λ λ 3 λ 4 (λ 3 + λ 4 ) 1 + λ 3,
12 12 / 20 The main results: existence theorem Theorem Suppose that the data are convex, i.e., D 1,2 D 2,3 0, µ > 0 and λ i > 0, i = 1, 2, 3, 4. If ϑ 1 (λ, µ) = ϑ 2 (λ, µ) or ϑ 1 (λ, µ) ϑ 2 (λ, µ) and δ < min l=1,2 {ϑ l (λ, µ)} or δ > max l=1,2 {ϑ l (λ, µ)}, then the interpolating curve P 3 that interpolates data points T i, i = 0, 1,..., 5, exists. Example: T3 T2 T1 T0 T4 T5
13 13 / 20 The main results: existence theorem Theorem Suppose that the data imply an inflection point, i.e., D 1,2 D 2,3 0, µ < 0 and λ i > 0 for all i. If δ (ϑ 3 (λ, µ), ϑ 4 (λ, µ)), then the interpolating curve P 3 that interpolates data points T i, i = 0, 1,..., 5, exists. Example: T4 T5 T3 T2 T0 T1
14 14 / 20 Proof of main theorems One needs to show that the nonlinear system (3) has at least one solution t D. The sketch of the proof: 1 For particular data the system (3) has an odd number of admissible solutions t D. 2 Under the conditions of Theorem 1 and Theorem 2 the system (3) cannot have a solution arbitrary close to the boundary D. 3 The convex homotopy and Brouwer s degree theorem carry the conclusions from a particular to the general case.
15 T 2 T 3 T 4 15 / 20 Step 1: a particular case Data points: ( T 1 2c 0 = 2 ( ) T 1 3 = 0 ) ( ) ( ), T 1 c 1 =, T =, 0 ( ) ( ), T 1 + c 4 = ( 1) s, T 1 + 2c 5 = 2( 1) s. The constants: λ = 1, δ = 1 2 (1 + ( 1)s ) c, µ = ( 1) s, ϑ 1 (λ, µ ) = ϑ 2 (λ, µ ) = 4, ϑ 3 (λ, µ ) = 1, ϑ 4 (λ, µ ) = 1 Data 1: s = 0, c = 1: δ = 1 Data 2: s = 0, c = 5, δ = 5 Data 3: s = 1, c = 1, δ = 0 T 0 T 5 T 0 T 5 T 0 T 1 T 1 T 4 T 1 T 4 T 2 T 3 T 2 T 3 T 5
16 16 / 20 Step 1: a particular case The equations: 2 ω 0 (t 0 ) + 1 ω 0 (t 1 ) + 1 ( 1)s ω 0 (t 4 ) = 0, ) 1 ω 0 (t 0 ) + 1 (1 ω 0 (t 3 ) + + c 2 + c ( 1)s 2 1 ω 0 (t 4 ) = 0, 2 ω 1 (t 5 ) + 1 ω 1 (t 4 ) + 1 ( 1)s ω 1 (t 1 ) = 0, ) 1 ω 1 (t 5 ) + 1 (1 ω 1 (t 2 ) + + c 2 + c ( 1)s 2 1 ω 1 (t 1 ) = 0. Symmetric solution: t 0 = t 4, t 1 = t 2. Nonsymmetric solutions come in pairs.
17 T 2 T 3 T 4 17 / 20 Step 1: a particular case Admissible symmetric solutions: s = 0, c = 1 s = 0, c = 5 s = 1, c R t t T 0 T 5 T 0 T 5 T 0 T 1 T 1 T 4 T 1 T 4 T 2 T 3 T 2 T 3 T 5
18 18 / 20 Step 2: solution region We need to show that t D, i.e., t i := t i+1 t i const > 0, i = 0, 1,..., 4. Lemma 1: Suppose that λ > 0, µ > 0 and ϑ 1 (λ, µ) ϑ 2 (λ, µ). Then t i 0, i = 0, 1, 2, 3, implies δ ϑ 1 (λ, µ). Similarly, from t i 0, i = 1, 2, 3, 4, it follows δ ϑ 2 (λ, µ). Lemma 2: Suppose that λ > 0, µ < 0. Then t i 0, i = 0, 1, 2, 4, implies δ ϑ 3 (λ, µ), and similarly, t i 0, i = 0, 2, 3, 4, implies δ ϑ 4 (λ, µ). The rest of the cases can be proved just by assuming λ > 0 and µ > 0 or µ < 0.
19 19 / 20 Step 3: Homotopy and Brouwer s degree theorem Denote the nonlinear system (3) by F (t; λ, δ, µ) = 0. Choose particular data (λ, δ, µ ) as described. Define a convex homotopy H(t; α) so that H(t; 0) = F (t; λ, δ, µ ), H(t; 1) = F (t; λ, δ, µ), and that the set of solutions S := {t D; H(t, α) = 0, α [0, 1]} is bounded away from the boundary D. Homotopy invariance of the Brouwer s mapping degree concludes the proof.
20 20 / 20 Conclusions and future work The sufficient, entirely geometric conditions on data points that imply the existence of the interpolant were given. The conditions where the interpolant cannot exist can be found. Hermite interpolation, G 1 splines, G 2 splines.
Geometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves
Geometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves Gašper Jaklič a,c, Jernej Kozak a,b, Marjeta Krajnc b, Vito Vitrih c, Emil Žagar a,b, a FMF, University of Ljubljana, Jadranska
More informationApproximation of Circular Arcs by Parametric Polynomial Curves
Approximation of Circular Arcs by Parametric Polynomial Curves Gašper Jaklič Jernej Kozak Marjeta Krajnc Emil Žagar September 19, 005 Abstract In this paper the approximation of circular arcs by parametric
More informationCurvature variation minimizing cubic Hermite interpolants
Curvature variation minimizing cubic Hermite interpolants Gašper Jaklič a,b, Emil Žagar,a a FMF and IMFM, University of Ljubljana, Jadranska 19, Ljubljana, Slovenia b PINT, University of Primorska, Muzejski
More informationON GEOMETRIC INTERPOLATION BY PLANAR PARAMETRIC POLYNOMIAL CURVES
MATHEMATICS OF COMPUTATION Volume 76, Number 60, October 007, Pages 98 993 S 005-578070988-6 Article electronically published on May 9, 007 ON GEOMETRIC INTERPOLATION BY PLANAR PARAMETRIC POLYNOMIAL CURVES
More informationHigh order parametric polynomial approximation of conic sections
High order parametric polynomial approximation of conic sections Gašper Jaklič a,b,c, Jernej Kozak a,b, Marjeta Krajnc a,b, Vito Vitrih c, Emil Žagar a,b, a FMF, University of Ljubljana, Jadranska 19,
More informationMotion design with Euler-Rodrigues frames of quintic Pythagorean-hodograph curves
Motion design with Euler-Rodrigues frames of quintic Pythagorean-hodograph curves Marjeta Krajnc a,b,, Vito Vitrih c,d a FMF, University of Ljubljana, Jadranska 9, Ljubljana, Slovenia b IMFM, Jadranska
More informationON INTERPOLATION BY PLANAR CUBIC G 2 PYTHAGOREAN-HODOGRAPH SPLINE CURVES
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578XX0000-0 ON INTERPOLATION BY PLANAR CUBIC G PYTHAGOREAN-HODOGRAPH SPLINE CURVES GAŠPER JAKLIČ, JERNEJ KOZAK, MARJETA KRAJNC, VITO
More informationA quaternion approach to polynomial PN surfaces
A quaternion approach to polynomial PN surfaces Jernej Kozak a,b, Marjeta Krajnc a,b,, Vito Vitrih b,c,d a FMF, University of Ljubljana, Jadranska 19, Ljubljana, Slovenia b IMFM, Jadranska 19, Ljubljana,
More informationBarycentric coordinates for Lagrange interpolation over lattices on a simplex
Barycentric coordinates for Lagrange interpolation over lattices on a simplex Gašper Jaklič gasper.jaklic@fmf.uni-lj.si, Jernej Kozak jernej.kozak@fmf.uni-lj.si, Marjeta Krajnc marjetka.krajnc@fmf.uni-lj.si,
More informationArsène Pérard-Gayot (Slides by Piotr Danilewski)
Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =
More informationApproximation of Circular Arcs by Parametric Polynomials
Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations
More informationOn Parametric Polynomial Circle Approximation
Numerical Algorithms manuscript No. will be inserted by the editor On Parametric Polynomial Circle Approximation Gašper Jaklič Jernej Kozak Received: date / Accepted: date Abstract In the paper, the uniform
More informationHermite Interpolation with Euclidean Pythagorean Hodograph Curves
Hermite Interpolation with Euclidean Pythagorean Hodograph Curves Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 86 75 Praha 8 zbynek.sir@mff.cuni.cz Abstract.
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationPythagorean-hodograph curves
1 / 24 Pythagorean-hodograph curves V. Vitrih Raziskovalni matematični seminar 20. 2. 2012 2 / 24 1 2 3 4 5 3 / 24 Let r : [a, b] R 2 be a planar polynomial parametric curve ( ) x(t) r(t) =, y(t) where
More informationUNIT-II INTERPOLATION & APPROXIMATION
UNIT-II INTERPOLATION & APPROXIMATION LAGRANGE POLYNAMIAL 1. Find the polynomial by using Lagrange s formula and hence find for : 0 1 2 5 : 2 3 12 147 : 0 1 2 5 : 0 3 12 147 Lagrange s interpolation formula,
More informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationInterpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34
Interpolation Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34 Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial
More informationNumerical Methods I: Polynomial Interpolation
1/31 Numerical Methods I: Polynomial Interpolation Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 16, 2017 lassical polynomial interpolation Given f i := f(t i ), i =0,...,n, we would
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationFinite Elements. Colin Cotter. January 18, Colin Cotter FEM
Finite Elements January 18, 2019 The finite element Given a triangulation T of a domain Ω, finite element spaces are defined according to 1. the form the functions take (usually polynomial) when restricted
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
More informationCurves and Surfaces Represented by Support Function
Curves and Surfaces Represented by Support Function Zbyněk Šír Institute of Applied Geometry, JKU Linz (joint research with B. Jüttler and J. Gravesen) The research was supported through grant P17387-N12
More informationApproximation of Geometric Data
Supervised by: Philipp Grohs, ETH Zürich August 19, 2013 Outline 1 Motivation Outline 1 Motivation 2 Outline 1 Motivation 2 3 Goal: Solving PDE s an optimization problems where we seek a function with
More informationIntroduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
More informationConvergence rates of derivatives of a family of barycentric rational interpolants
Convergence rates of derivatives of a family of barycentric rational interpolants J.-P. Berrut, M. S. Floater and G. Klein University of Fribourg (Switzerland) CMA / IFI, University of Oslo jean-paul.berrut@unifr.ch
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier
More informationChordal cubic spline interpolation is fourth order accurate
Chordal cubic spline interpolation is fourth order accurate Michael S. Floater Abstract: It is well known that complete cubic spline interpolation of functions with four continuous derivatives is fourth
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationMath 112 (Calculus I) Midterm Exam 3 KEY
Math 11 (Calculus I) Midterm Exam KEY Multiple Choice. Fill in the answer to each problem on your computer scored answer sheet. Make sure your name, section and instructor are on that sheet. 1. Which of
More informationC 1 Interpolation with Cumulative Chord Cubics
Fundamenta Informaticae XXI (2001) 1001 16 1001 IOS Press C 1 Interpolation with Cumulative Chord Cubics Ryszard Kozera School of Computer Science and Software Engineering The University of Western Australia
More informationPlanar interpolation with a pair of rational spirals T. N. T. Goodman 1 and D. S. Meek 2
Planar interpolation with a pair of rational spirals T N T Goodman and D S Meek Abstract Spirals are curves of one-signed monotone increasing or decreasing curvature Spiral segments are fair curves with
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationSpiral spline interpolation to a planar spiral
Spiral spline interpolation to a planar spiral Zulfiqar Habib Department of Mathematics and Computer Science, Graduate School of Science and Engineering, Kagoshima University Manabu Sakai Department of
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More informationOrthogonality of hat functions in Sobolev spaces
1 Orthogonality of hat functions in Sobolev spaces Ulrich Reif Technische Universität Darmstadt A Strobl, September 18, 27 2 3 Outline: Recap: quasi interpolation Recap: orthogonality of uniform B-splines
More informationInterpolating Accuracy without underlying f (x)
Example: Tabulated Data The following table x 1.0 1.3 1.6 1.9 2.2 f (x) 0.7651977 0.6200860 0.4554022 0.2818186 0.1103623 lists values of a function f at various points. The approximations to f (1.5) obtained
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationTopics Covered in Calculus BC
Topics Covered in Calculus BC Calculus BC Correlation 5 A Functions, Graphs, and Limits 1. Analysis of graphs 2. Limits or functions (including one sides limits) a. An intuitive understanding of the limiting
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationG-code and PH curves in CNC Manufacturing
G-code and PH curves in CNC Manufacturing Zbyněk Šír Institute of Applied Geometry, JKU Linz The research was supported through grant P17387-N12 of the Austrian Science Fund (FWF). Talk overview Motivation
More informationComplete the following table using the equation and graphs given:
L2 1.2 Characteristics of Polynomial Functions Lesson MHF4U Jensen In section 1.1 we looked at power functions, which are single-term polynomial functions. Many polynomial functions are made up of two
More informationM. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium
MATRIX RATIONAL INTERPOLATION WITH POLES AS INTERPOLATION POINTS M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium B. BECKERMANN Institut für Angewandte
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Residual and Error of Finite Element Solutions Mixed BVP of Poisson Equation
More informationNumerische Mathematik
Numer. Math. (997) 76: 479 488 Numerische Mathematik c Springer-Verlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,
More informationHIGHER DIMENSIONAL MINKOWSKI PYTHAGOREAN HODOGRAPH CURVES
J. Appl. Math. & Computing Vol. 14(2004), No. 1-2, pp. 405-413 HIGHER DIMENSIONAL MINKOWSKI PYTHAGOREAN HODOGRAPH CURVES GWANG-IL KIM AND SUNHONG LEE Abstract. Rational parameterization of curves and surfaces
More informationChapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 Ritz-Galerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, V-elliptic bilinear form and l : V lr a bounded linear functional.
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationApplied Numerical Analysis Quiz #2
Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the
More informationGlobal polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly.
Piecewise polynomial interpolation Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly. In many applications, one does not have the freedom
More informationKernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt.
SINGAPORE SHANGHAI Vol TAIPEI - Interdisciplinary Mathematical Sciences 19 Kernel-based Approximation Methods using MATLAB Gregory Fasshauer Illinois Institute of Technology, USA Michael McCourt University
More informationSTOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1
53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas
More informationData Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1
Data Analysis-I Interpolation Soon-Hyung Yook December 4, 2015 Soon-Hyung Yook Data Analysis-I December 4, 2015 1 / 1 Table of Contents Soon-Hyung Yook Data Analysis-I December 4, 2015 2 / 1 Introduction
More informationNonlinear Stationary Subdivision
Nonlinear Stationary Subdivision Michael S. Floater SINTEF P. O. Box 4 Blindern, 034 Oslo, Norway E-mail: michael.floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research Center
More informationEvgeniy V. Martyushev RESEARCH STATEMENT
Evgeniy V. Martyushev RESEARCH STATEMENT My research interests lie in the fields of topology of manifolds, algebraic topology, representation theory, and geometry. Specifically, my work explores various
More informationRobotics I. June 6, 2017
Robotics I June 6, 217 Exercise 1 Consider the planar PRPR manipulator in Fig. 1. The joint variables defined therein are those used by the manufacturer and do not correspond necessarily to a Denavit-Hartenberg
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationMath 660-Lecture 15: Finite element spaces (I)
Math 660-Lecture 15: Finite element spaces (I) (Chapter 3, 4.2, 4.3) Before we introduce the concrete spaces, let s first of all introduce the following important lemma. Theorem 1. Let V h consists of
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationApplication of modified Leja sequences to polynomial interpolation
Special Issue for the years of the Padua points, Volume 8 5 Pages 66 74 Application of modified Leja sequences to polynomial interpolation L. P. Bos a M. Caliari a Abstract We discuss several applications
More informationChapter 3 Interpolation and Polynomial Approximation
Chapter 3 Interpolation and Polynomial Approximation Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Polynomial Interpolation
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationGeneral elastic beam with an elastic foundation
General elastic beam with an elastic foundation Figure 1 shows a beam-column on an elastic foundation. The beam is connected to a continuous series of foundation springs. The other end of the foundation
More informationSome isoperimetric inequalities with application to the Stekloff problem
Some isoperimetric inequalities with application to the Stekloff problem by A. Henrot, Institut Élie Cartan, UMR7502 Nancy Université - CNRS - INRIA, France, e-mail : antoine.henrot@iecn.u-nancy.fr. G.A.
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Approximation Bézier curves B- 1 Some vocabulary (again ;) Control point : Geometric point that serves as support to the
More informationIntroduction to Numerical Analysis
J. Stoer R. Bulirsch Introduction to Numerical Analysis Second Edition Translated by R. Bartels, W. Gautschi, and C. Witzgall With 35 Illustrations Springer Contents Preface to the Second Edition Preface
More informationThe degree of a function is the highest exponent in the expression
L1 1.1 Power Functions Lesson MHF4U Jensen Things to Remember About Functions A relation is a function if for every x-value there is only 1 corresponding y-value. The graph of a relation represents a function
More informationThere is a unique function s(x) that has the required properties. It turns out to also satisfy
Numerical Analysis Grinshpan Natural Cubic Spline Let,, n be given nodes (strictly increasing) and let y,, y n be given values (arbitrary) Our goal is to produce a function s() with the following properties:
More informationCMU-Q Lecture 24:
CMU-Q 15-381 Lecture 24: Supervised Learning 2 Teacher: Gianni A. Di Caro SUPERVISED LEARNING Hypotheses space Hypothesis function Labeled Given Errors Performance criteria Given a collection of input
More informationExtrapolation Methods for Approximating Arc Length and Surface Area
Extrapolation Methods for Approximating Arc Length and Surface Area Michael S. Floater, Atgeirr F. Rasmussen and Ulrich Reif March 2, 27 Abstract A well-known method of estimating the length of a parametric
More information1 Review of Interpolation using Cubic Splines
cs412: introduction to numerical analysis 10/10/06 Lecture 12: Instructor: Professor Amos Ron Cubic Hermite Spline Interpolation Scribes: Yunpeng Li, Mark Cowlishaw 1 Review of Interpolation using Cubic
More informationGAKUTO International Series
GAKUTO International Series Mathematical Sciences and Applications, Vol.28(2008) Proceedings of Fourth JSIAM-SIMMAI Seminar on Industrial and Applied Mathematics, pp.139-148 A COMPUTATIONAL APPROACH TO
More informationDark Radiation and Inflationary Freedom
Dark Radiation and Inflationary Freedom Based on [SG et al., JCAP 1504 (2015) 023] [Di Valentino et al., PRD 91 (2015) 123505] Stefano Gariazzo University of Torino, INFN of Torino http://personalpages.to.infn.it/~gariazzo/
More informationA New Trust Region Algorithm Using Radial Basis Function Models
A New Trust Region Algorithm Using Radial Basis Function Models Seppo Pulkkinen University of Turku Department of Mathematics July 14, 2010 Outline 1 Introduction 2 Background Taylor series approximations
More informationMathematical Economics: Lecture 3
Mathematical Economics: Lecture 3 Yu Ren WISE, Xiamen University October 7, 2012 Outline 1 Example of Graphing Example 3.1 Consider the cubic function f (x) = x 3 3x. Try to graph this function Example
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationPURE Math Residents Program Gröbner Bases and Applications Week 3 Lectures
PURE Math Residents Program Gröbner Bases and Applications Week 3 Lectures John B. Little Department of Mathematics and Computer Science College of the Holy Cross June 2012 Overview of this week The research
More informationAdaptive tree approximation with finite elements
Adaptive tree approximation with finite elements Andreas Veeser Università degli Studi di Milano (Italy) July 2015 / Cimpa School / Mumbai Outline 1 Basic notions in constructive approximation 2 Tree approximation
More informationNotes on Cellwise Data Interpolation for Visualization Xavier Tricoche
Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche urdue University While the data (computed or measured) used in visualization is only available in discrete form, it typically corresponds
More informationBi-quartic parametric polynomial minimal surfaces
arxiv:1503.09159v1 [math.dg] 31 Mar 015 Bi-quartic parametric polynomial minimal surfaces Ognian Kassabov Abstract Krassimira Vlachkova Minimal surfaces with isothermal parameters admitting Bézier representation
More informationCS412: Introduction to Numerical Methods
CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,
More informationCorrelation with College Board Advanced Placement Course Descriptions
Correlation with College Board Advanced Placement Course Descriptions The following tables show which sections of Calculus: Concepts and Applications cover each of the topics listed in the 2004 2005 Course
More informationRecurrences in Quantum Walks
Recurrences in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, FJFI ČVUT in Prague, Czech Republic (2) Department of Nonlinear and Quantum Optics, RISSPO, Hungarian Academy
More informationLecture 3 September 1
STAT 383C: Statistical Modeling I Fall 2016 Lecture 3 September 1 Lecturer: Purnamrita Sarkar Scribe: Giorgio Paulon, Carlos Zanini Disclaimer: These scribe notes have been slightly proofread and may have
More informationCharacterizing planar polynomial vector fields with an elementary first integral
Characterizing planar polynomial vector fields with an elementary first integral Sebastian Walcher (Joint work with Jaume Llibre and Chara Pantazi) Lleida, September 2016 The topic Ultimate goal: Understand
More information