Corrigendum to “Faster algorithms for computing Hong's bound on absolute positiveness” [J. Symb. Comput. 45 (2010) 677–683] (S0747717110000301) (10.1016/j.jsc.2010.02.002))

Przemysław Koprowski, Kurt Mehlhorn, Saurabh Ray

Research output: Contribution to journalComment/debate

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.

Original languageEnglish (US)
Pages (from-to)238-241
Number of pages4
JournalJournal of Symbolic Computation
Volume87
DOIs
StatePublished - Jul 1 2018

    Fingerprint

Keywords

  • Convex hull
  • Hong bound
  • Polynomials

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics

Cite this