Computing roots of polynomials by quadratic clipping
|
|
- Thomas Webb
- 6 years ago
- Views:
Transcription
1 Computing roots of polynomials by quadratic clipping Michael Bartoň, Bert Jüttler SFB F013, Project 15 Johann Radon Institute for Computational and Applied Mathematics, Linz, Austria FSP Seminar, Strobl, 19 22/6/2006 1
2 Outlook Bézier clipping algorithm Quadratic clipping The best quadratic approximant Dual basis Error bound Convergence rate Single roots Double roots Comparison Examples Conclusion FSP Seminar, Strobl, 19 22/6/2006 2
3 Bézier clipping Polynomial function p(t) of degree n on interval [α 0, β 0 ] is given Algorithm: 1. Represent the polynomial as a parametric Bézier curve of degree n 2. Construct convex hull of the control polygon (CP) 3. Intersect the convex hull with t-axis 4. Obtain a new interval [α 1, β 1 ] if α 1 β 1 < 1 2 α 0 β 0 restrict p on [α 1, β 1 ], otherwise bisect [α 0, β 0 ]. FSP Seminar, Strobl, 19 22/6/2006 3
4 Bézier clipping FSP Seminar, Strobl, 19 22/6/2006 4
5 Bézier clipping p(t) 0 α 0 β 0 Find the root of polynomial p(t) on the interval [α 0, β 0 ]. FSP Seminar, Strobl, 19 22/6/2006 4
6 Bézier clipping p(t) 0 α 0 β 0 Polynomial p(t) in Bézier form. FSP Seminar, Strobl, 19 22/6/2006 4
7 Bézier clipping p(t) 0 α 0 β 0 Convex hull construction. FSP Seminar, Strobl, 19 22/6/2006 4
8 Bézier clipping p(t) 0 α 0 β 0 Convex hull construction. FSP Seminar, Strobl, 19 22/6/2006 4
9 Bézier clipping p(t) 0 α 1 β 1 The new interval [α 1, β 1 ]. FSP Seminar, Strobl, 19 22/6/2006 4
10 Quadratic clipping The same type of algorithm as Bézier clipping Convex hull Degree reduction 1. Find the best quadratic approximant q of p in L 2 norm 2. Compute error bound of p and q 3. Construct quadratic functions: upper bound M, lower bound m 4. Compute roots of M and m FSP Seminar, Strobl, 19 22/6/2006 5
11 Quadratic clipping FSP Seminar, Strobl, 19 22/6/2006 6
12 Quadratic clipping p(t) 0 α 0 β 0 Find the root of polynomial p(t) on the interval [α 0, β 0 ]. FSP Seminar, Strobl, 19 22/6/2006 6
13 Quadratic clipping p(t) 0 α 0 β 0 Polynomial p(t) in Bézier form. FSP Seminar, Strobl, 19 22/6/2006 6
14 Quadratic clipping p(t) q 0 0 α 0 β 0 The best quadratic approximant q. FSP Seminar, Strobl, 19 22/6/2006 6
15 Quadratic clipping M 0 p(t) q 0 m 0 0 α 0 β 0 Bounding quadratic functions M 0 and m 0 FSP Seminar, Strobl, 19 22/6/2006 6
16 Quadratic clipping M 0 p(t) q 0 m 0 0 α 0 α 1 β 1 β 0 Restriction on the new interval [α 1, β 1 ]. FSP Seminar, Strobl, 19 22/6/2006 6
17 Quadratic clipping p(t) q 1 0 α 1 β 1 2rd iteration FSP Seminar, Strobl, 19 22/6/2006 6
18 Quadratic clipping M 1 p(t) q 1 0 m 1 α 1 β 1 α 2 β 2 2rd iteration FSP Seminar, Strobl, 19 22/6/2006 6
19 Quadratic clipping p(t), q 2, M 2, m 2 0 α 2 β 2 3rd iteration FSP Seminar, Strobl, 19 22/6/2006 6
20 The best quadratic approximant Π n (n + 1)-dimensional linear space of polynomials of degree n on [0, 1] Bernstein-Bezier basis {B n i (t)}n i=0, p(t) = n i=0 b ib n i (t) L 2 inner product is defined by (f(t), g(t)) = 1 0 f(t)g(t)dt p is given, find quadratic polynomial q such that f q 2 is minimal p Π n q Π 2 Find orthogonal projection of p to subspace Π 2 FSP Seminar, Strobl, 19 22/6/2006 7
21 Degree reduction Standard technique used for obtaining the best polynomial approximant Lutterkort D., Peters J., Reif U.: Polynomial degree reduction in the L 2 -norm equals best Euclidean approximation of Bézier coefficients Eck M.: Degree reduction of Bézier curves 46 related papers (MathSciNet) Our approach: via dual basis FSP Seminar, Strobl, 19 22/6/2006 8
22 Dual basis Dual basis {D n i (t)}n i=0 to the BB basis {Bn i (t)}n i=0 Subspace Π 2, { B 2 i (t)} 2 i=0, { D 2 i (t)} 2 i=0 (B n i (t), D n j (t)) = δ ij, i, j = 0... n. q(t) = q(t) = 1 0 ( 2 j=0 2 j=0 (p(t), Dj 2 (t)) }{{} B2 j (t), (1) n b i Bi n (t))dj 2 (t)dt, i=0 n i=0 b i (B n i (t), D 2 j (t) }{{} )B2 j (t). (2) β n,2 i,j FSP Seminar, Strobl, 19 22/6/2006 9
23 Degree reduction matrix n=5, k=2 (β 5,2 i,j ) i=0,..,5;j=0,...,2 = (3) The coefficients of q are obtained by multiplying the row vector (b 0,..., b 5 ) of the coefficients of p by this matrix. FSP Seminar, Strobl, 19 22/6/
24 Error bound Best quadratic function q is found, its degree is raised to n n q(t) = c i Bi n (t) p(t) Let us denote i=0 ɛ := max i=0...n b i c i ǫ q(t) p(t) q(t) = n b i c i Bi n (t) i=0 n ɛbi n (t) = ɛ α β i=0 M(t) = q(t) + ɛ, m(t) = q(t) ɛ FSP Seminar, Strobl, 19 22/6/
25 Convergence rate Single root G(t) q the best quadratic approximant of p in L 2 norm Construct G quadratic Taylor expansion of p in the root t 0 p G = O(h 3 ) O(h 3 ) p(t) q(t) t 0 t 0 + h FSP Seminar, Strobl, 19 22/6/
26 Convergence rate Single root q(t) the best approximant of p in L 2 norm = O(h 3 ) G(t) p(t) p q 2 p G 2 p q = O(h 3 ) 3rd equivalent norm maximum norm on BB coefficient s vector p q BB = O(h 3 ) = ɛ t 0 q(t) t 0 + h FSP Seminar, Strobl, 19 22/6/
27 Convergence rate Single root Vertical width of bounding strip is O(h 3 ) Single root horizontal width O(h 3 ) Lenght of interval h O(h 3 ) Convergence rate is 3 O(h 3 ) G(t) p(t) q(t) t 0 t 0 + h FSP Seminar, Strobl, 19 22/6/
28 Convergence rate Double root The same idea of the proof like in the single root case Construct G quadratic Taylor expansion of p in the root t 0,... Convergence rate is 1.5 Special case of double root: if p (3) (t 0 ) = 0 then convergence rate is 2 FSP Seminar, Strobl, 19 22/6/
29 Comparison Convergence rate Bézier clipping: single root 2 double root 1 Quadratic clipping: single root 3 double root 1.5 Asymptotical advantage of Quadratic clipping Necessary to compare time complexity (Regula falsi vs. Newton) Secant method (1 + 5)/ Newton 2 FSP Seminar, Strobl, 19 22/6/
30 Number of operations per one iteration n Quadratic clipping Bézier clipping ± All ± All Table 1: Convex control polygon Quadratic clipping fixed numbers Bézier clipping numbers may vary Both algorithms O(n 2 ) operations FSP Seminar, Strobl, 19 22/6/
31 Time per one iteration Convex control polygon t QR 2.4 t BC time vs. degree time (in s) obtained from the implementation in C n QR BC n 10 5 iterations (in order to obtain measurable quantity) QR BC 1 for n FSP Seminar, Strobl, 19 22/6/
32 Single root Number of iterations vs. Accuracy ɛ = 10 2 ɛ = 10 4 ɛ = 10 8 ɛ = ɛ = ɛ = ɛ = n QR BC QR BC QR BC QR BC QR BC QR BC QR BC Table 2: Number of iterations in single root case f 2 (t) = (t 1 )(3 t), 2 f 4 (t) = (t 1 3 )(2 t)(t + 5)2, f 8 (t) = (t 1 3 )(2 t)3 (t + 5) 4, f 16 (t) = (t 1 3 )(2 t)5 (t + 5) 10, on the interval [0, 1] FSP Seminar, Strobl, 19 22/6/
33 Single root Time vs. Accuracy 1.4 t BC QR 2.5 t BC QR n = 4 log 2 log 1 ǫ n = 8 log 2 log 1 ǫ Exact time values up to ɛ = (C code), extrapolated for higher accuracy (time per one iteration number of iterations) FSP Seminar, Strobl, 19 22/6/
34 Double root Number of iterations vs. Accuracy ɛ = 10 2 ɛ = 10 4 ɛ = 10 8 ɛ = ɛ = ɛ = ɛ = n QR BC QR BC QR BC QR BC QR BC QR BC QR BC Table 3: Number of iterations in double root case f 2 (t) = (t 1 2 )2, f 4 (t) = (t 1 2 )2 (t + 2)(3 t), f 8 (t) = (t 1 2 )2 (4 t) 3 (t + 5) 2 (t + 7), f 16 (t) = (t 1 2 )2 (4 t) 7 (t + 5) 6 (t + 7) on the interval [0, 1] FSP Seminar, Strobl, 19 22/6/
35 Double root Time vs. Accuracy t 100 t BC 60 BC QR 20 QR log 2 log 1 ǫ log 2 log 1 ǫ n = 4 n = 8 FSP Seminar, Strobl, 19 22/6/
36 Near double root Number of iterations vs. Accuracy ɛ = 10 2 ɛ = 10 4 ɛ = 10 8 ɛ = ɛ = ɛ = ɛ = n QR BC QR BC QR BC QR BC QR BC QR BC QR BC Table 4: Number of iterations in near double root case f 2 (t) = (t 0.56)(t 0.57), f 4 (t) = (t 0.4)(t )(t + 1)(2 t), f 8 (t) = (t )(t )(t + 5) 3 (t + 7) 3, f 16 (t) = (t )(t )(6 t) 7 (t + 5) 6 (t + 7) on the interval [0, 1] FSP Seminar, Strobl, 19 22/6/
37 Near double root Time vs. Accuracy 8 t BC 8 t BC QR 4 QR log 2 log 1 ǫ log 2 log 1 ǫ n = 4 n = 8 FSP Seminar, Strobl, 19 22/6/
38 Conclusion Asymptotic advantage of Quadratic clipping (Convergence rate) Comparable results in single roots with BC Significantly faster in double root cases Better in near double roots FSP Seminar, Strobl, 19 22/6/
39 References Jüttler B. (1998), The dual basis functions of the Bernstein polynomials. Adv. Comput. Math. 8, Nishita, T., T. Sederberg, and M. Kakimoto (1990), Ray tracing trimmed rational surface patches. Siggraph Proceedings, ACM, Ko, K., T. Sakkalis, and N. Patrikalakis (2005). Resolution of multiple roots of nonlinear polynomial systems, Int. J. Shape Model., 11.1, Mourrain, B., and J.-P. Pavone (2005), Subdivision methods for solving polynomial equations, Technical Report no. 5658, INRIA Sophia Antipolis, FSP Seminar, Strobl, 19 22/6/
40 Future Work Degree reduction to cubics Multivariate algorithm FSP Seminar, Strobl, 19 22/6/
Computing roots of polynomials by quadratic clipping
Computing roots of polynomials by quadratic clipping Michael Bartoň and Bert Jüttler Johann Radon Institute for Computational and Applied Mathematics, Austria Johannes Kepler University Linz, Institute
More informationCOMPUTING ROOTS OF SYSTEMS OF POLYNOMIALS BY LINEAR CLIPPING
COMPUTING ROOTS OF SYSTEMS OF POLYNOMIALS BY LINEAR CLIPPING MICHAEL BARTOŇ AND BERT JÜTTLER ABSTRACT. We present an algorithm which computes all roots of a given bivariate polynomial system within a given
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 informationHome Page. Title Page. Contents. Bezier Curves. Milind Sohoni sohoni. Page 1 of 27. Go Back. Full Screen. Close.
Bezier Curves Page 1 of 27 Milind Sohoni http://www.cse.iitb.ac.in/ sohoni Recall Lets recall a few things: 1. f : [0, 1] R is a function. 2. f 0,..., f i,..., f n are observations of f with f i = f( i
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 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 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 informationGeometric 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 informationWeighted G 1 -Multi-Degree Reduction of Bézier Curves
Vol. 7, No. 2, 216 Weighted G 1 -Multi-Degree Reduction of Bézier Curves Abedallah Rababah Department of Mathematics, Jordan University of Science and Technology Irbid 2211 Jordan Salisu Ibrahim Department
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 informationBézier Curves and Splines
CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100
More informationCHAPTER-II ROOTS OF EQUATIONS
CHAPTER-II ROOTS OF EQUATIONS 2.1 Introduction The roots or zeros of equations can be simply defined as the values of x that makes f(x) =0. There are many ways to solve for roots of equations. For some
More informationSOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS BISECTION METHOD
BISECTION METHOD If a function f(x) is continuous between a and b, and f(a) and f(b) are of opposite signs, then there exists at least one root between a and b. It is shown graphically as, Let f a be negative
More informationNonlinear equations. Norms for R n. Convergence orders for iterative methods
Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector
More informationNumerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by
Numerical Analysis A Comprehensive Introduction H. R. Schwarz University of Zürich Switzerland with a contribution by J. Waldvogel Swiss Federal Institute of Technology, Zürich JOHN WILEY & SONS Chichester
More informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationp 1 p 0 (p 1, f(p 1 )) (p 0, f(p 0 )) The geometric construction of p 2 for the se- cant method.
80 CHAP. 2 SOLUTION OF NONLINEAR EQUATIONS f (x) = 0 y y = f(x) (p, 0) p 2 p 1 p 0 x (p 1, f(p 1 )) (p 0, f(p 0 )) The geometric construction of p 2 for the se- Figure 2.16 cant method. Secant Method The
More information15 Nonlinear Equations and Zero-Finders
15 Nonlinear Equations and Zero-Finders This lecture describes several methods for the solution of nonlinear equations. In particular, we will discuss the computation of zeros of nonlinear functions f(x).
More informationAn unconditionally convergent method for computing zeros of splines and polynomials
An unconditionally convergent method for computing zeros of splines and polynomials Knut Mørken and Martin Reimers November 24, 2005 Abstract We present a simple and efficient method for computing zeros
More informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
More informationMath 578: Assignment 2
Math 578: Assignment 2 13. Determine whether the natural cubic spline that interpolates the table is or is not the x 0 1 2 3 y 1 1 0 10 function 1 + x x 3 x [0, 1] f(x) = 1 2(x 1) 3(x 1) 2 + 4(x 1) 3 x
More informationCurves, Surfaces and Segments, Patches
Curves, Surfaces and Segments, atches The University of Texas at Austin Conics: Curves and Quadrics: Surfaces Implicit form arametric form Rational Bézier Forms and Join Continuity Recursive Subdivision
More informationwhich arises when we compute the orthogonal projection of a vector y in a subspace with an orthogonal basis. Hence assume that P y = A ij = x j, x i
MODULE 6 Topics: Gram-Schmidt orthogonalization process We begin by observing that if the vectors {x j } N are mutually orthogonal in an inner product space V then they are necessarily linearly independent.
More informationEAD 115. Numerical Solution of Engineering and Scientific Problems. David M. Rocke Department of Applied Science
EAD 115 Numerical Solution of Engineering and Scientific Problems David M. Rocke Department of Applied Science Taylor s Theorem Can often approximate a function by a polynomial The error in the approximation
More informationIntroduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points
Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular
More information1 f(u)b n i (u)du, (1.1)
AMRX Applied Mathematics Research express 25, No. 4 On a Modified Durrmeyer-Bernstein Operator and Applications Germain E. Randriambelosoa 1 Introduction Durrmeyer [6] has introduced a Bernstein-type operator
More informationRoot Finding (and Optimisation)
Root Finding (and Optimisation) M.Sc. in Mathematical Modelling & Scientific Computing, Practical Numerical Analysis Michaelmas Term 2018, Lecture 4 Root Finding The idea of root finding is simple we want
More informationDemo 5. 1 Degree Reduction and Raising Matrices for Degree 5
Demo This demo contains the calculation procedures to generate the results shown in Appendix A of the lab report. Degree Reduction and Raising Matrices for Degree M,4 = 3 4 4 4 3 4 3 4 4 4 3 4 4 M 4, =
More informationApplied Numerical Analysis
Applied Numerical Analysis Using MATLAB Second Edition Laurene V. Fausett Texas A&M University-Commerce PEARSON Prentice Hall Upper Saddle River, NJ 07458 Contents Preface xi 1 Foundations 1 1.1 Introductory
More informationG 1 Hermite Interpolation by Minkowski Pythagorean Hodograph Cubics
G 1 Hermite Interpolation by Minkowski Pythagorean Hodograph Cubics Jiří Kosinka and Bert Jüttler Johannes Kepler University, Institute of Applied Geometry, Altenberger Str. 69, A 4040 Linz, Austria Abstract
More informationConstructing Linkages for Drawing Plane Curves
Constructing Linkages for Drawing Plane Curves Christoph Koutschan (joint work with Matteo Gallet, Zijia Li, Georg Regensburger, Josef Schicho, Nelly Villamizar) Johann Radon Institute for Computational
More informationSyzygies and distance functions to parameterized curves and surfaces
Syzygies and distance functions to parameterized curves and surfaces Laurent Busé INRIA Sophia Antipolis, France Laurent.Buse@inria.fr AGGM 2016 Conference, CMO at Oaxaca, Mexico August 7-12, 2016 Overall
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 informationEXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE
J. KSIAM Vol.13, No.4, 257 265, 2009 EXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE YEON SOO KIM 1 AND YOUNG JOON AHN 2 1 DEPT OF MATHEMATICS, AJOU UNIVERSITY, SUWON, 442 749,
More informationMAT 300 Midterm Exam Summer 2017
MAT Midterm Exam Summer 7 Note: For True-False questions, a statement is only True if it must always be True under the given assumptions, otherwise it is False.. The control points of a Bezier curve γ(t)
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 informationMTH 309Y 37. Inner product spaces. = a 1 b 1 + a 2 b a n b n
MTH 39Y 37. Inner product spaces Recall: ) The dot product in R n : a. a n b. b n = a b + a 2 b 2 +...a n b n 2) Properties of the dot product: a) u v = v u b) (u + v) w = u w + v w c) (cu) v = c(u v)
More informationSample Exam 1 KEY NAME: 1. CS 557 Sample Exam 1 KEY. These are some sample problems taken from exams in previous years. roughly ten questions.
Sample Exam 1 KEY NAME: 1 CS 557 Sample Exam 1 KEY These are some sample problems taken from exams in previous years. roughly ten questions. Your exam will have 1. (0 points) Circle T or T T Any curve
More informationNumerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.
Numerical Methods for Engineers An Introduction with and Scientists Applications using MATLAB Third Edition Amos Gilat Vish- Subramaniam Department of Mechanical Engineering The Ohio State University Wiley
More informationNumerical solution of Least Squares Problems 1/32
Numerical solution of Least Squares Problems 1/32 Linear Least Squares Problems Suppose that we have a matrix A of the size m n and the vector b of the size m 1. The linear least square problem is to find
More informationLinear precision for parametric patches Special session on Applications of Algebraic Geometry AMS meeting in Vancouver, 4 October 2008
Linear precision for parametric patches Special session on Applications of Algebraic Geometry AMS meeting in Vancouver, 4 October 2008 Frank Sottile sottile@math.tamu.edu 1 Overview (With L. Garcia, K.
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 informationImplicit matrix representations of rational Bézier curves and surfaces
Implicit matrix representations of rational Bézier curves and surfaces Laurent Busé GALAAD, INRIA, 2004 route des Lucioles, 06902 Sophia Antipolis, France Abstract We introduce and study a new implicit
More informationComputational Methods CMSC/AMSC/MAPL 460. Solving nonlinear equations and zero finding. Finding zeroes of functions
Computational Methods CMSC/AMSC/MAPL 460 Solving nonlinear equations and zero finding Ramani Duraiswami, Dept. of Computer Science Where does it arise? Finding zeroes of functions Solving functional equations
More informationApplication - Ray Tracing and Bézier surfaces. TANA09 Lecture 3. Error Estimate. Application - Ray tracing and Beziér surfaces.
TANA09 Lecture 3 Application - Ray Tracing and Bézier surfaces Application - Ray tracing and Beziér surfaces. z = B(x, y) q o Error estimate. Cancellation. The Newton-Raphson method. Analysis. Order of
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
3 Numerical Solution of Nonlinear Equations and Systems 3.1 Fixed point iteration Reamrk 3.1 Problem Given a function F : lr n lr n, compute x lr n such that ( ) F(x ) = 0. In this chapter, we consider
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 8. Smooth convex unconstrained and equality-constrained minimization
E5295/5B5749 Convex optimization with engineering applications Lecture 8 Smooth convex unconstrained and equality-constrained minimization A. Forsgren, KTH 1 Lecture 8 Convex optimization 2006/2007 Unconstrained
More informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary
More informationRoot Finding For NonLinear Equations Bisection Method
Root Finding For NonLinear Equations Bisection Method P. Sam Johnson November 17, 2014 P. Sam Johnson (NITK) Root Finding For NonLinear Equations Bisection MethodNovember 17, 2014 1 / 26 Introduction The
More information1. Find the domain of the following functions. Write your answer using interval notation. (9 pts.)
MATH- Sample Eam Spring 7. Find the domain of the following functions. Write your answer using interval notation. (9 pts.) a. 9 f ( ) b. g ( ) 9 8 8. Write the equation of the circle in standard form given
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
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 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 informationNonlinear Means in Geometric Modeling
Nonlinear Means in Geometric Modeling Michael S. Floater SINTEF P. O. Box 124 Blindern, 0314 Oslo, Norway E-mail: Michael.Floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research
More informationChapter 4. Solution of Non-linear Equation. Module No. 1. Newton s Method to Solve Transcendental Equation
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-713209 email: anita.buie@gmail.com 1 . Chapter 4 Solution of Non-linear
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 informationComparative Analysis of Convergence of Various Numerical Methods
Journal of Computer and Mathematical Sciences, Vol.6(6),290-297, June 2015 (An International Research Journal), www.compmath-journal.org ISSN 0976-5727 (Print) ISSN 2319-8133 (Online) Comparative Analysis
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationAn O(h 2n ) Hermite approximation for conic sections
An O(h 2n ) Hermite approximation for conic sections Michael Floater SINTEF P.O. Box 124, Blindern 0314 Oslo, NORWAY November 1994, Revised March 1996 Abstract. Given a segment of a conic section in the
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 informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 23, 2015
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam January 23, 2015 Name: Exam Rules: This exam lasts 4 hours and consists of
More informationRoots of Equations. ITCS 4133/5133: Introduction to Numerical Methods 1 Roots of Equations
Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Muller s methods) EigenValue Analysis ITCS 4133/5133: Introduction
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 informationEXISTENCE OF SET-INTERPOLATING AND ENERGY- MINIMIZING CURVES
EXISTENCE OF SET-INTERPOLATING AND ENERGY- MINIMIZING CURVES JOHANNES WALLNER Abstract. We consider existence of curves c : [0, 1] R n which minimize an energy of the form c (k) p (k = 1, 2,..., 1 < p
More informationCHAPTER 10 Zeros of Functions
CHAPTER 10 Zeros of Functions An important part of the maths syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of problems
More informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
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 informationQ(s, t) = S M = S M [ G 1 (t) G 2 (t) G 3 1(t) G 4 (t) ] T
Curves an Surfaces: Parametric Bicubic Surfaces - Intro Surfaces are generalizations of curves Use s in place of t in parametric equation: Q(s) = S M G where S equivalent to T in Q(t) = T M G If G is parameterize
More informationSolutions to Homework 5 - Math 3410
Solutions to Homework 5 - Math 34 (Page 57: # 489) Determine whether the following vectors in R 4 are linearly dependent or independent: (a) (, 2, 3, ), (3, 7,, 2), (, 3, 7, 4) Solution From x(, 2, 3,
More informationChapter 6. Nonlinear Equations. 6.1 The Problem of Nonlinear Root-finding. 6.2 Rate of Convergence
Chapter 6 Nonlinear Equations 6. The Problem of Nonlinear Root-finding In this module we consider the problem of using numerical techniques to find the roots of nonlinear equations, f () =. Initially we
More informationFast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials
Fast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials Oliver J. D. Barrowclough, Bert Jüttler, and Tino Schulz Abstract Consider a rational family of planar rational curves in
More informationLinear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
More informationCMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier
CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually
More informationarxiv: v1 [cs.na] 8 Sep 2014
Degree reduction of disk rational Bézier curves Mao Shi a a College of Mathematics and Information Science of Shaanxi Normal University,Xi an 7162, China arxiv:149.2455v1 [cs.na] 8 Sep 214 Abstract This
More informationSubdivision methods for solving polynomial equations
Subdivision methods for solving polynomial equations Bernard Mourrain, Jean-Pascal Pavone To cite this version: Bernard Mourrain, Jean-Pascal Pavone. Subdivision methods for solving polynomial equations.
More informationQR Decomposition. When solving an overdetermined system by projection (or a least squares solution) often the following method is used:
(In practice not Gram-Schmidt, but another process Householder Transformations are used.) QR Decomposition When solving an overdetermined system by projection (or a least squares solution) often the following
More informationDirect method for variational problems by using hybrid of block-pulse and Bernoulli polynomials
Direct method for variational problems by using hybrid of block-pulse and Bernoulli polynomials M Razzaghi, Y Ordokhani, N Haddadi Abstract In this paper, a numerical method for solving variational problems
More informationNON-LINEAR ALGEBRAIC EQUATIONS Lec. 5.1: Nonlinear Equation in Single Variable
NON-LINEAR ALGEBRAIC EQUATIONS Lec. 5.1: Nonlinear Equation in Single Variable Dr. Niket Kaisare Department of Chemical Engineering IIT Madras NPTEL Course: MATLAB Programming for Numerical Computations
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationMaria Cameron. f(x) = 1 n
Maria Cameron 1. Local algorithms for solving nonlinear equations Here we discuss local methods for nonlinear equations r(x) =. These methods are Newton, inexact Newton and quasi-newton. We will show that
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
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 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 informationLecture 8 : Eigenvalues and Eigenvectors
CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with
More informationMath 3191 Applied Linear Algebra
Math 3191 Applied Linear Algebra Lecture 11: Vector Spaces Stephen Billups University of Colorado at Denver Math 3191Applied Linear Algebra p.1/32 Announcements Study Guide 6 posted HWK 6 posted Math 3191Applied
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 informationComputational and Statistical Aspects of Statistical Machine Learning. John Lafferty Department of Statistics Retreat Gleacher Center
Computational and Statistical Aspects of Statistical Machine Learning John Lafferty Department of Statistics Retreat Gleacher Center Outline Modern nonparametric inference for high dimensional data Nonparametric
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationTropical Geometry Homework 3
Tropical Geometry Homework 3 Melody Chan University of California, Berkeley mtchan@math.berkeley.edu February 9, 2009 The paper arxiv:07083847 by M. Vigeland answers this question. In Theorem 7., the author
More informationHybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface
S S symmetry Article Hybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface Xiaowu Li 1, ID, Lin Wang 1,, Zhinan Wu,, Linke Hou 3, *,, Juan Liang 4, and Qiaoyang Li
More informationSECTION: CONTINUOUS OPTIMISATION LECTURE 4: QUASI-NEWTON METHODS
SECTION: CONTINUOUS OPTIMISATION LECTURE 4: QUASI-NEWTON METHODS HONOUR SCHOOL OF MATHEMATICS, OXFORD UNIVERSITY HILARY TERM 2005, DR RAPHAEL HAUSER 1. The Quasi-Newton Idea. In this lecture we will discuss
More informationInner Product Spaces
Inner Product Spaces Linear Algebra Josh Engwer TTU 28 October 2015 Josh Engwer (TTU) Inner Product Spaces 28 October 2015 1 / 15 Inner Product Space (Definition) An inner product is the notion of a dot
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationMarch 8, 2010 MATH 408 FINAL EXAM SAMPLE
March 8, 200 MATH 408 FINAL EXAM SAMPLE EXAM OUTLINE The final exam for this course takes place in the regular course classroom (MEB 238) on Monday, March 2, 8:30-0:20 am. You may bring two-sided 8 page
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 informationChapter 4. Unconstrained optimization
Chapter 4. Unconstrained optimization Version: 28-10-2012 Material: (for details see) Chapter 11 in [FKS] (pp.251-276) A reference e.g. L.11.2 refers to the corresponding Lemma in the book [FKS] PDF-file
More informationZeros of Functions. Chapter 10
Chapter 10 Zeros of Functions An important part of the mathematics syllabus in secondary school is equation solving. This is important for the simple reason that equations are important a wide range of
More information4755 Mark Scheme June 2013
4755 Mark Scheme June 0 Evidence of comparing coefficients, or multiplying out x x 5 x A x B x C D M the RHS, or substituting. May be implied by A = or D = - 4 Comparing coefficients of x, A B Comparing
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More information