An Improved Taylor-Bernstein Form for Higher Order Convergence
|
|
- Benjamin Williamson
- 5 years ago
- Views:
Transcription
1 An Improved Taylor-Bernstein Form for Higher Order Convergence P. S. V. Nataraj, IIT Bombay Talk at the Mini-workshop on Taylor Model Methods and Applications Miami, Florida, USA. Dec. 16th - 20th,
2 1 Outline of talk First, we see essentials of Bernstein form, Taylor form, TB form of Lin and Rokne. Next, we propose a new TB form that is more effective in practice. Then, we test and compare the higher order convergence behavior of The proposed TB form The TB form of Lin and Rokne The Taylor model of Berz et al. For the testing, we consider six benchmark examples dimensions varying fromto. examine higher order convergence for orders up to. Finally, we give the conclusions of the work. 2
3 2 Notation Letbe set of reals, be a box. Let denote the set of all values of an arbitrary function on. Let be the set of all boxes contained in. Let the width of an interval be if and if. A function is an inclusion function for, if for all An inclusion function for is said to have convergence order if for all where and are some positive constants. 3
4 3 Introduction An important problem in interval analysis is : construct inclusion functions with the property of higher order convergence for multidimensional functions. Such inclusion functions have applications in the solutions of equations, optimization, quadrature, and others. Earlier work: 1977: Herzberger showed that higher order convergence can be obtained for a certain class of intervals. However, his requirement on the function is unrealistically strong. 1984: Cornelius and Lohner proposed interpolation and remainder forms for multidimensional functions In theory, any convergence order to be obtained in theory. In practice, convergence order of at mostoris recommended even for unidimensional functions. 1985: Alefeld and Lohner proposed centered forms with higher order convergence for unidimensional functions. 4
5 However, because of strong condition on the functional representation, higher order centered forms have limited practical value. 1990: Neumaier gives improved version of these forms for unidimensional functions. Same restrictions as above. 1996: Lin and Rokne propose higher order convergent forms that combine Taylor and Bernstein (or B-spline) forms for multidimensional functions. However, for small domains these forms become computationally very demanding, even for unidimensional functions. 1990s: Berz et al. propose Taylor models for multidimensional functions. Accuracy of the remainder interval part of the Taylor model increases in a higher order convergent fashion. 5
6 4 Introduction (Contd.) In this talk, we describe a new inclusion function form having the higher order convergence property for multidimensional functions. The new inclusion function form uses Bernstein polynomials for bounding the range of the polynomial obtained from the Taylor form of the function. The Bernstein form is combined with Taylor form to obtain the resulting so-called Taylor-Bernstein (TB) form. The new TB form has some important differences in practical way it is constructed from the TB form of Lin and Rokne. 6
7 5 Useful Features of Bernstein Form Bernstein form is an important tool for finding bounds on range of polynomials. Key features of Bernstein approach are: Computation of bounds conveys information about sharpness of bounds. Approach avoids functional evaluations - which might be costly if degree of polynomial is high. When bisecting a box and applying Bernstein form to one of the two subboxes, we obtain without any extra cost an enclosure for range over other subbox. Bernstein form gives exact range - for sufficiently small boxes. 7
8 6 Multivariate Bernstein Form Let be a dimensional polynomial in. Let be the maximum degree of in, for. Let denote the tuple of maximum degrees, and call as the degree of. Write in power form Without loss of generality, consider domain as the unit box. The mutlivariate Bernstein form for of degree, is The Bernstein coefficients are 8
9 The Bernstein polynomials are 9
10 7 Range and Vertex Properties A key property of the Bernstein form is its range enclosure property. Let denote the range of on. Then, Equality results if and only if the resp. is attained at one of the vertices, i.e., for. This latter property is called the vertex property. In general, the vertex property does not hold, so we get some range overestimation. The amount of overestimation can be reduced by either elevating the degree of the Bernstein form, or successively subdividing and recomputing Bernstein coefficients over the new subdivisions. Typically, subdivision approach is more efficient - preferred to the degree elevation approach. 10
11 8 Taylor Form Consider a function that is times differentiable on. Expand using a Taylor expansion of order (3) Here,is any point in(usually the midpoint), We call the polynomial part and the remainder part of the Taylor expansion. 11
12 9 Taylor form (Contd.) Using Moore s recursive techniques, we can automatically compute The coefficients of the polynomial An enclosure for the remainder part on The Taylor form of order is Lin and Rokne 1996 showed that Taylor form has convergence order 12
13 10 Lin and Rokne s TB Form Instead of finding the range Lin and Rokne proposed to use Bernstein form for of degree given by Compute a (generally non-sharp) enclosure of the range as the to over all the Bernstein coefficients. Interestingly, their new form constructed as retains the th convergence order property. We call the form as the TB form of Lin and Rokne. We observe from above that as domain width becomes smaller, required degree of Bernstein polynomials becomes large - and quite quickly. Consequently, the Bernstein step in computation of becomes very computationally intensive as domain intervals shrink in widths. 13
14 11 Proposed TB form We propose an improved TB form It avoids need for high degrees!! of the Bernstein form, as in. We compute the range using Bernstein form of minimum required degree Subdivision Vertex condition checks The overall method to construct is as follows:. Step 1: Expand given function in Taylor form of order, obtaining the Taylor polynomial coefficients and an enclosure of the remainder part. The automated Taylor model technique of Berz et al. for this step, in view of its known computational efficiency. Step 2: Transform the given domainto the unit box. For transformed polynomial, compute Bernstein coefficients of Bernstein form of degree. Step 3: Successively subdivide and recompute Bernstein coefficients on each new subdivision, till vertex property is satisfied on every subdivision. Step 4: Compute the range as the min- 14
15 imum to maximum over all obtained Bernstein coefficients, Step 5: Construct an enclosure for the range of on " as is a Taylor form of order. So, hasth convergence order property. 15
16 12 Numerical Testing We test higher order convergence property of various inclusion function forms on some examples. Examples are of low to medium dimensions ( through dimensions). We use A PC/Pentium III MHz MB RAM machine, A FORTRAN compiler, Version of the COSY-INFINITY package of Berz et al. In each example, we compute the intervals # - using Taylor model of Berz et al. - using TB form of Lin and Rokne. - using the proposed TB form. $ - using inner estimates of range computed with Moore-Skelboe optimization algorithm. 16
17 13 Measure of Overestimation Let be any two intervals. As a measure of overestimation, we use the Hausdorff metric Consider a sequence of nested intervals For each form, we examine reduction in overestimation with decrease in widths of domain intervals. Consider first the form #. Let # # As a measure of the reduction in overestimation obtained with form # over successive nested intervals and we use the ratio # # # # # 17
18 14 Measure of Overestimation (Contd.) Define If # is an inclusion function form having convergence order then # (where the tending is from above) for small enough. The overestimation is found relative to some inner estimate $ of the range. If theth convergence order property holds relative to $ then it also holds relative to the exact range. So, it is sufficient if we can show theth convergence order property with $. 18
19 15 List of Examples Example 1 : Gritton s second problem in Chemical Engineering : The-dim function is a polynomial ofth degree. The domain is. Example 2 : Jennrich and Sampson function. The -dim function is The domain is. Example 3 : Levy function. The-dim function is % % The domain is. Example 4 : Trigonometric function. The -dim function 19
20 is The domain is. Example 5 : Griewank function. The-dim function is The domain is. Example 6 : Trigonometric function. The -dim function is The domain is. 20
21 16 Summary of Results With the Taylor model as an inclusion function form: We obtain only quadratic convergence in all problems, irrespective of the chosen Taylor order. With the Lin and Rokne s TB form as an inclusion function form: In all cases (except for Taylor orders ) we are unable to proceed after just one subdivision, i.e., with!, due to the excessive memory requirements arising from high degrees of the associated Bernstein polynomials. For Taylor orders we are unable to proceed after just two subdivisions, i.e., with!, for the same reason. Therefore, as an inclusion form for obtaining higher order convergence, the practical utility of is found to be severely restricted. With the proposed TB form as an inclusion function form: In problems of up to-dimensions, we quite easily obtain higher order convergence of orders up to. In problems ofand-dimensions, we obtain 21
22 higher order convergence of orders up to. But, computational demands are somewhat large for -dimensional problem, And become excessive for the -dimensional one. 22
23 17 Conclusions A new TB form as an inclusion form for multidimensional functions. With new TB form, we quite easily obtain higher order convergence (of orders up to) for low to medium dimensional problems. To our knowledge, it is perhaps for the first time that higher order convergence of such high orders has actually been demonstrated on multidimensional problems. The new higher order convergent form can be constructed on a computer with the fully automated algorithm presented, without any need for hand computations. For a problem of higher dimensions ( ), the proposed TB form was found to be computationally inefficient. This strongly suggests the need for further improvements in the proposed algorithm for dealing with higher dimensional ( ) problems. 23
24 18 Acknowledgments We thank Drs. Berz, Makino, and Hoefkens for providing the COSY-INFINITY software and extending a lot of help regarding the usage of the software. We would also like to thank Dr. N. D. Jotwani of GCET for motivating, encouraging and providing the required facilities for this work. 24
25 Table 1: Overestimations and their reduction ratios for various Taylor orders obtained with various forms in Example 1 Gritton (1-dimensional). & ' ' ' ' ' ' ' ' & ' ' ' & ' ' ' ' ' ' ' ' - & ' ' ' ' ' ' ' ' & ' ' & ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' 25
26 Table 2: Overestimations and their reduction ratios for various Taylor orders obtained with various forms in Example 6 Trignometric (-dimensional). : ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' : ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' - - ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' : ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' 26
27 Table 3: Average execution times with various algorithms. The time is in seconds, unless otherwise stated. The average is taken over all, and all Taylor orders. Note that with TB form of LR, mostly only one subdivision () is found possible in the problems. Average Execution Time Example Name Taylor model Algorithm LR Algorithm TB 1 Gritton 2 Jennrich & Sampson 3 Levy 4 Trignometric 5 Griewank 6 Trignometric hours 27
Verified Global Optimization with Taylor Model based Range Bounders
Verified Global Optimization with Taylor Model based Range Bounders KYOKO MAKINO and MARTIN BERZ Department of Physics and Astronomy Michigan State University East Lansing, MI 88 USA makino@msu.edu, berz@msu.edu
More informationInterval Methods and Taylor Model Methods for ODEs
Interval Methods and Taylor Model Methods for ODEs Markus Neher, Dept. of Mathematics KARLSRUHE INSTITUTE OF TECHNOLOGY (KIT) 0 TM VII, Key West KIT University of the State of Baden-Wuerttemberg and Interval
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
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 informationON TAYLOR MODEL BASED INTEGRATION OF ODES
ON TAYLOR MODEL BASED INTEGRATION OF ODES M. NEHER, K. R. JACKSON, AND N. S. NEDIALKOV Abstract. Interval methods for verified integration of initial value problems (IVPs for ODEs have been used for more
More informationHow to Explain Usefulness of Different Results when Teaching Calculus: Example of the Mean Value Theorem
Journal of Uncertain Systems Vol.7, No.3, pp.164-175, 2013 Online at: www.jus.org.uk How to Explain Usefulness of Different Results when Teaching Calculus: Example of the Mean Value Theorem Olga Kosheleva
More informationVerification of Invertibility of Complicated Functions over Large Domains
Reliable Computing 8: 67 82, 2002. 67 c 2002 Kluwer Academic Publishers. Printed in the Netherlands. Verification of Invertibility of Complicated Functions over Large Domains JENS HOEFKENS and MARTIN BERZ
More informationDeterministic Global Optimization for Dynamic Systems Using Interval Analysis
Deterministic Global Optimization for Dynamic Systems Using Interval Analysis Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame,
More informationEXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS
EXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS JIANWEI DIAN AND R BAKER KEARFOTT Abstract Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous
More informationInternational Journal of Pure and Applied Mathematics Volume 6 No , TAYLOR MODELS AND OTHER VALIDATED FUNCTIONAL INCLUSION METHODS
International Journal of Pure and Applied Mathematics Volume 6 No. 3 2003, 239-312 TAYLOR MODELS AND OTHER VALIDATED FUNCTIONAL INCLUSION METHODS Kyoko Makino 1, Martin Berz 2 1 Department of Physics University
More informationComputation of Interval Extensions Using Berz-Taylor Polynomial Models
Computation of Interval Extensions Using Berz-Taylor Polynomial Models Hongkun Liang and Mark A. Stadtherr Λ Department of Chemical Engineering University of Notre Dame Notre Dame, IN 46556 USA AIChE Annual
More informationMatrix Methods for the Bernstein Form and Their Application in Global Optimization
Matrix Methods for the Bernstein Form and Their Application in Global Optimization June, 10 Jihad Titi Jürgen Garloff University of Konstanz Department of Mathematics and Statistics and University of Applied
More informationAN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS
AN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS NEDIALKO S. NEDIALKOV Abstract. Interval numerical methods for initial value problems (IVPs) for ordinary differential
More informationINTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS
INTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana Lafayette, Louisiana 70504-1010 1 Introduction and motivation
More informationValidated Solutions of Initial Value Problems for Parametric ODEs
Validated Solutions of Initial Value Problems for Parametric ODEs Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA
More informationCOSY INFINITY Version 7
COSY INFINITY Version 7 Kyoko Makino and Martin Berz Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory Michigan State University, East Lansing, MI 48824 Abstract An
More informationNumerical Integration
Numerical Integration Sanzheng Qiao Department of Computing and Software McMaster University February, 2014 Outline 1 Introduction 2 Rectangle Rule 3 Trapezoid Rule 4 Error Estimates 5 Simpson s Rule 6
More informationIn practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points,
1 Interpolation 11 Introduction In practice one often meets a situation where the function of interest, f(x), is only represented by a discrete set of tabulated points, {x i, y i = f(x i ) i = 1 n, obtained,
More informationA NEW PARADIGM FOR MODELING, SIMULATIONS AND ANALYSIS OF INTENSE BEAMS
WEO2C6 Proceedings of HB21, Morschach, Switzerland A NEW PARADIGM FOR MODELING, SIMULATIONS AND ANALYSIS OF INTENSE BEAMS E. Nissen, B. Erdelyi, Department of Physics, Northern Illinois University, Dekalb,
More informationA Rigorous Implementation of Taylor Model-Based Integrator in Chebyshev Basis Representation 1
A Rigorous Implementation of Taylor Model-Based Integrator in Chebyshev Basis Representation 1 Tomáš Dzetkulič Institute of Computer Science Czech Academy of Sciences December 15, 2011 1 This work was
More informationGeneration of Bode and Nyquist Plots for Nonrational Transfer Functions to Prescribed Accuracy
Generation of Bode and Nyquist Plots for Nonrational Transfer Functions to Prescribed Accuracy P. S. V. Nataraj 1 and J. J. Barve 2 1 Associate Professor and 2 Research Scholar Systems and Control Engineering
More informationComputation of the error functions erf and erfc in arbitrary precision with correct rounding
Computation of the error functions erf and erfc in arbitrary precision with correct rounding Sylvain Chevillard Arenaire, LIP, ENS-Lyon, France Sylvain.Chevillard@ens-lyon.fr Nathalie Revol INRIA, Arenaire,
More informationTOWARDS MORE EFFICIENT INTERVAL ANALYSIS: CORNER FORMS AND A REMAINDER INTERVAL NEWTON METHOD
TOWARDS MORE EFFICIENT INTERVAL ANALYSIS: CORNER FORMS AND A REMAINDER INTERVAL NEWTON METHOD Thesis by Marcel Gavriliu In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
More informationGuaranteed State and Parameter Estimation for Nonlinear Continuous-Time Systems with Bounded-Error Measurements
Guaranteed State and Parameter Estimation for Nonlinear Continuous-Time Systems with Bounded-Error Measurements Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University
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 informationVERIFIED HIGH-ORDER INTEGRATION OF DAES AND HIGHER-ORDER ODES
VERIFIED HIGH-ORDER INTEGRATION OF DAES AND HIGHER-ORDER ODES Jens Hoefkens Martin Berz Kyoko Makino Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory Michigan State
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 informationInvestigation of a Subdivision Based Algorithm. for Solving Systems of Polynomial Equations. University of Applied Sciences / FH Konstanz
to appear in the Proceedings of the 3rd World Congress of Nonlinear Analysts (WCNA 000), Catania, Sicily, Italy, July 9{6, 000, as a series of the Journal of Nonlinear Analysis Investigation of a Subdivision
More informationDeterministic Global Optimization of Nonlinear Dynamic Systems
Deterministic Global Optimization of Nonlinear Dynamic Systems Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA
More informationOn the existence of an eigenvalue below the essential spectrum
On the existence of an eigenvalue below the essential spectrum B.M.Brown, D.K.R.M c Cormack Department of Computer Science, Cardiff University of Wales, Cardiff, PO Box 916, Cardiff CF2 3XF, U.K. A. Zettl
More informationValidated Explicit and Implicit Runge-Kutta Methods
Validated Explicit and Implicit Runge-Kutta Methods Alexandre Chapoutot joint work with Julien Alexandre dit Sandretto and Olivier Mullier U2IS, ENSTA ParisTech 8th Small Workshop on Interval Methods,
More informationHigh-Order Representation of Poincaré Maps
High-Order Representation of Poincaré Maps Johannes Grote, Martin Berz, and Kyoko Makino Department of Physics and Astronomy, Michigan State University, East Lansing, MI, USA. {grotejoh,berz,makino}@msu.edu
More informationcha1873x_p02.qxd 3/21/05 1:01 PM Page 104 PART TWO
cha1873x_p02.qxd 3/21/05 1:01 PM Page 104 PART TWO ROOTS OF EQUATIONS PT2.1 MOTIVATION Years ago, you learned to use the quadratic formula x = b ± b 2 4ac 2a to solve f(x) = ax 2 + bx + c = 0 (PT2.1) (PT2.2)
More informationInterval Arithmetic An Elementary Introduction and Successful Applications
Interval Arithmetic An Elementary Introduction and Successful Applications by R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana U.S.L. Box 4-1010 Lafayette, LA 70504-1010
More informationExact Bounds on Sample Variance of Interval Data
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 3-1-2002 Exact Bounds on Sample Variance of Interval Data Scott Ferson Lev Ginzburg
More informationA Matrix Method for Efficient Computation of Bernstein Coefficients
A Matrix Method for Efficient Computation of Bernstein Coefficients Shashwati Ray Systems and Control Engineering Group, Room 114A, ACRE Building, Indian Institute of Technology, Bombay, India 400 076
More informationTaylor Model Range Bounding Schemes
Taylor Model Range Bounding Schemes I Kyoko Makino II Martin Berz Department of Physics and Astronomy Michigan State University Introduction LDB (Linear Dominated Bounder) QDB (Quadratic Dominated Bounder)
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationConvergence under Subdivision and Complexity of Polynomial Minimization in the Simplicial Bernstein Basis
Convergence under Subdivision and Complexity of Polynomial Minimization in the Simplicial Bernstein Basis Richard Leroy IRMAR, University of Rennes 1 richard.leroy@ens-cachan.org Abstract In this article,
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationAn Introduction to Differential Algebra
An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra
More informationConstraint propagation for univariate quadratic constraints
Constraint propagation for univariate quadratic constraints Arnold Neumaier Institut für Mathematik, Universität Wien Strudlhofgasse 4, A-1090 Wien, Austria email: Arnold.Neumaier@univie.ac.at WWW: http://www.mat.univie.ac.at/
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationPhysics 331 Introduction to Numerical Techniques in Physics
Physics 331 Introduction to Numerical Techniques in Physics Instructor: Joaquín Drut Lecture 12 Last time: Polynomial interpolation: basics; Lagrange interpolation. Today: Quick review. Formal properties.
More informationWork in Progress: Reachability Analysis for Time-triggered Hybrid Systems, The Platoon Benchmark
Work in Progress: Reachability Analysis for Time-triggered Hybrid Systems, The Platoon Benchmark François Bidet LIX, École polytechnique, CNRS Université Paris-Saclay 91128 Palaiseau, France francois.bidet@polytechnique.edu
More informationSubdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 Subdivision Matrices Iterated Function Systems for Parametric Interval Bezier Curves O. Ismail, Senior Member,
More informationLecture 8: Optimization
Lecture 8: Optimization This lecture describes methods for the optimization of a real-valued function f(x) on a bounded real interval [a, b]. We will describe methods for determining the maximum of f(x)
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000
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 informationAPPROXIMATION OF ROOTS OF EQUATIONS WITH A HAND-HELD CALCULATOR. Jay Villanueva Florida Memorial University Miami, FL
APPROXIMATION OF ROOTS OF EQUATIONS WITH A HAND-HELD CALCULATOR Jay Villanueva Florida Memorial University Miami, FL jvillanu@fmunivedu I Introduction II III IV Classical methods A Bisection B Linear interpolation
More informationOn-Line Geometric Modeling Notes
On-Line Geometric Modeling Notes CUBIC BÉZIER CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview The Bézier curve representation
More informationEnclosure Methods. G. Alefeld Institut für Angewandte Mathematik Universität Karlsruhe Federal Republic of Germany
Enclosure Methods G. Alefeld Institut für Angewandte Mathematik Universität Karlsruhe Federal Republic of Germany Abstract: We present an overview on existing methods for inc1uding the range of functions
More informationSlow Exponential Growth for Clenshaw Curtis Sparse Grids
Slow Exponential Growth for Clenshaw Curtis Sparse Grids John Burkardt Interdisciplinary Center for Applied Mathematics & Information Technology Department Virginia Tech... http://people.sc.fsu.edu/ burkardt/presentations/sgmga
More informationChapter 3: Root Finding. September 26, 2005
Chapter 3: Root Finding September 26, 2005 Outline 1 Root Finding 2 3.1 The Bisection Method 3 3.2 Newton s Method: Derivation and Examples 4 3.3 How To Stop Newton s Method 5 3.4 Application: Division
More informationNumerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi
Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi Lecture No - 27 Interpolation and Approximation (Continued.) In our last lecture we
More informationRigorous Global Optimization of Impulsive Space Trajectories
Rigorous Global Optimization of Impulsive Space Trajectories P. Di Lizia, R. Armellin, M. Lavagna K. Makino, M. Berz Fourth International Workshop on Taylor Methods Boca Raton, December 16 19, 2006 Motivation
More informationNumerical Mathematics & Computing, 7 Ed. 4.1 Interpolation
Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 November 7, 2011 2011 1 /
More informationRecent Advances in Differential Algebraic Methods
Recent Advances in Differential Algebraic Methods Martin Berz Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University Kyoko Makino Department of
More informationNOTES ON LINEAR ALGEBRA CLASS HANDOUT
NOTES ON LINEAR ALGEBRA CLASS HANDOUT ANTHONY S. MAIDA CONTENTS 1. Introduction 2 2. Basis Vectors 2 3. Linear Transformations 2 3.1. Example: Rotation Transformation 3 4. Matrix Multiplication and Function
More informationComputation of the Bernstein Coecients on Subdivided. are computed directly from the coecients on the subdivided triangle from the
Computation of the Bernstein Coecients on Subdivided riangles Ralf Hungerbuhler Fakultat fur Mathematik und Informatik, Universitat Konstanz, Postfach 5560 D 97, D{78434 Konstanz, Germany Jurgen Garlo
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,
Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the
More informationReview. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn
Review Taylor Series and Error Analysis Roots of Equations Linear Algebraic Equations Optimization Numerical Differentiation and Integration Ordinary Differential Equations Partial Differential Equations
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Stochastic Convergence Barnabás Póczos Motivation 2 What have we seen so far? Several algorithms that seem to work fine on training datasets: Linear regression
More informationLecture 7. Root finding I. 1 Introduction. 2 Graphical solution
1 Introduction Lecture 7 Root finding I For our present purposes, root finding is the process of finding a real value of x which solves the equation f (x)=0. Since the equation g x =h x can be rewritten
More informationSUPPRESSION OF THE WRAPPING EFFECT BY TAYLOR MODEL- BASED VERIFIED INTEGRATORS: LONG-TERM STABILIZATION BY PRECONDITIONING
International Journal of Differential Equations and Applications Volume 0 No. 0 2006, 1-36 SUPPRESSION OF THE WRAPPING EFFECT BY TAYLOR MODEL- BASED VERIFIED INTEGRATORS: LONG-TERM STABILIZATION BY PRECONDITIONING
More informationUNIT I : NUMBER SYSTEMS
CLASS X First Term Marks : 80 UNITS MARKS I. NUMBER SYSTEMS 10 II. ALGEBRA 20 III. GEOMETRY 15 IV TRIGONOMETRY 20 V STATISTICS 15 TOTAL 80 UNIT I : NUMBER SYSTEMS 1. REAL NUMBERS (15) Periods Euclid's
More information8.3 Numerical Quadrature, Continued
8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes
More informationChapter 4 Sequences and Series
Chapter 4 Sequences and Series 4.1 Sequence Review Sequence: a set of elements (numbers or letters or a combination of both). The elements of the set all follow the same rule (logical progression). The
More informationSolutions to Laplace s Equations- II
Solutions to Laplace s Equations- II Lecture 15: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay Laplace s Equation in Spherical Coordinates : In spherical coordinates
More informationTS Method Summary. T k (x,y j 1 ) f(x j 1,y j 1 )+ 2 f (x j 1,y j 1 ) + k 1
TS Method Summary Let T k (x,y j 1 ) denote the first k +1 terms of the Taylor series expanded about the discrete approximation, (x j 1,y j 1 ), and ẑ k,j (x) be the polynomial approximation (to y(x))
More information(Refer Slide Time: 00:32)
Nonlinear Dynamical Systems Prof. Madhu. N. Belur and Prof. Harish. K. Pillai Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 12 Scilab simulation of Lotka Volterra
More informationApophis Encounter 2029: Differential Algebra and Taylor Model Approaches. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids
Apophis Encounter 9: Differential Algebra and Taylor Model Approaches 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids 7- April 9 Granada, Spain R. Armellin (1), P. Di Lizia (1),
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 informationCHAPTER SEVEN THE GALLEY METHOD. Galley method 2. Exercises 8
THE GALLEY METHOD Galley method Exercises 8 THE GALLEY METHOD Although the x dots-and-boxes model provides a conceptually easy framework for understanding the process of long division of polynimials, it
More information1: Please compute the Jacobi symbol ( 99
SCORE/xx: Math 470 Communications Cryptography NAME: PRACTICE FINAL Please show your work write only in pen. Notes are forbidden. Calculators, all other electronic devices, are forbidden. Brains are encouraged,
More informationGeometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th Order ODEs
Appeared in: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds): Symbolic Algebraic Methods and Verification Methods, pp. 183 193. Springer, Wien, 2001. Geometric Series Bounds for the Local Errors of
More informationEnclosing All Solutions of Two-Point Boundary Value Problems for ODEs
Enclosing All Solutions of Two-Point Boundary Value Problems for ODEs Youdong Lin, Joshua A. Enszer, and Mark A. Stadtherr 1 Department of Chemical and Biomolecular Engineering University of Notre Dame,
More information1.1. The analytical denition. Denition. The Bernstein polynomials of degree n are dened analytically:
DEGREE REDUCTION OF BÉZIER CURVES DAVE MORGAN Abstract. This paper opens with a description of Bézier curves. Then, techniques for the degree reduction of Bézier curves, along with a discussion of error
More informationarxiv: v1 [math.na] 28 Jun 2013
A New Operator and Method for Solving Interval Linear Equations Milan Hladík July 1, 2013 arxiv:13066739v1 [mathna] 28 Jun 2013 Abstract We deal with interval linear systems of equations We present a new
More informationCSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits
CSE 200 Lecture Notes Turing machine vs. RAM machine vs. circuits Chris Calabro January 13, 2016 1 RAM model There are many possible, roughly equivalent RAM models. Below we will define one in the fashion
More informationIntegration, differentiation, and root finding. Phys 420/580 Lecture 7
Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:
More informationChapter 1 Mathematical Preliminaries and Error Analysis
Numerical Analysis (Math 3313) 2019-2018 Chapter 1 Mathematical Preliminaries and Error Analysis Intended learning outcomes: Upon successful completion of this chapter, a student will be able to (1) list
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter IV: Locating Roots of Equations Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu
More informationValidated integration of Solar System Dynamics. 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids
Validated integration of Solar System Dynamics 1 st IAA Planetary Defense Conference: Protecting Earth from Asteroids 27-3 April 29 Granada, Spain P. Di Lizia (1), R. Armellin (1), F. Bernelli Zazzera
More information(IV.C) UNITS IN QUADRATIC NUMBER RINGS
(IV.C) UNITS IN QUADRATIC NUMBER RINGS Let d Z be non-square, K = Q( d). (That is, d = e f with f squarefree, and K = Q( f ).) For α = a + b d K, N K (α) = α α = a b d Q. If d, take S := Z[ [ ] d] or Z
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 informationA New Method for Real Root Isolation of Univariate
A New Method for Real Root Isolation of Univariate Polynomials Ting Zhang and Bican Xia Abstract. A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on
More informationData Dependences and Parallelization. Stanford University CS243 Winter 2006 Wei Li 1
Data Dependences and Parallelization Wei Li 1 Agenda Introduction Single Loop Nested Loops Data Dependence Analysis 2 Motivation DOALL loops: loops whose iterations can execute in parallel for i = 11,
More informationDifferential Equations on Cubic Julia Sets
University of California Los Angeles June 16, 2014 Julia Sets Given a complex polynomial f, the associated filled-in Julia set is the set of points z such that the sequence z, f (z), f (f (z)),..., f
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationAnalysis Methods in Atmospheric and Oceanic Science
Analysis Methods in Atmospheric and Oceanic Science AOSC 652 Week 7, Day 1 13 Oct 2014 1 Student projects: 20% of the final grade: you will receive a numerical score for the project and final grade will
More informationModule 6: Implicit Runge-Kutta Methods Lecture 17: Derivation of Implicit Runge-Kutta Methods(Contd.) The Lecture Contains:
The Lecture Contains: We continue with the details about the derivation of the two stage implicit Runge- Kutta methods. A brief description of semi-explicit Runge-Kutta methods is also given. Finally,
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 20, 2014 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationCertified Complex Numerical Root Finding
Intro Subdivision Numerical Comparison Goals Max Planck Institute for Informatics Dep. 1: Algorithms and Complexity Seminar on Computational Geometry and Geometric Computing May 6, 2010 Intro Subdivision
More informationComputing validated solutions of implicit differential equations
Advances in Computational Mathematics 19: 231 253, 2003. 2003 Kluwer Academic Publishers. Printed in the Netherlands. Computing validated solutions of implicit differential equations Jens Hoefkens a, Martin
More informationRoots of equations, minimization, numerical integration
Roots of equations, minimization, numerical integration Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University November 1, 2017 Roots of equations Find the roots solve equation
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter IV: Locating Roots of Equations Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu
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 informationICES REPORT A Multilevel-WENO Technique for Solving Nonlinear Conservation Laws
ICES REPORT 7- August 7 A Multilevel-WENO Technique for Solving Nonlinear Conservation Laws by Todd Arbogast, Chieh-Sen Huang, and Xikai Zhao The Institute for Computational Engineering and Sciences The
More information