Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677–683]. (July 2018)

• Record Type: Journal Article
• Authors: Koprowski, Przemysław; Mehlhorn, Kurt; Ray, Saurabh
• Is Part Of: Journal of symbolic computation. Volume 87(2018)
• Page Start: 238
• Page End: 241
• Publication Date: 2018-07
• Subjects: Hong bound -- Polynomials -- Convex hull; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2017.05.008
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: We show that a linear-time algorithm for computing Hong's bound for positive roots of a univariate polynomial, described by K. Mehlhorn and S. Ray in an article "Faster algorithms for computing Hong's bound on absolute positiveness", is incorrect. We present a corrected version.