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

doi:10.1016/j.jsc.2017.05.008

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

Computer Science

Research output: Contribution to journal › Comment/debate › peer-review

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 language	English (US)
Pages (from-to)	238-241
Number of pages	4
Journal	Journal of Symbolic Computation
Volume	87
DOIs	https://doi.org/10.1016/j.jsc.2017.05.008
State	Published - Jul 1 2018

Keywords

Convex hull
Hong bound
Polynomials

ASJC Scopus subject areas

Algebra and Number Theory
Computational Mathematics

Access to Document

10.1016/j.jsc.2017.05.008

Cite this

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)). / Koprowski, Przemysław; Mehlhorn, Kurt; Ray, Saurabh.
In: Journal of Symbolic Computation, Vol. 87, 01.07.2018, p. 238-241.

Research output: Contribution to journal › Comment/debate › peer-review

@article{391bf046e9904485b4bb789ff2ac347c,

title = "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))",

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.",

keywords = "Convex hull, Hong bound, Polynomials",

author = "Przemys{\l}aw Koprowski and Kurt Mehlhorn and Saurabh Ray",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier Ltd",

year = "2018",

month = jul,

day = "1",

doi = "10.1016/j.jsc.2017.05.008",

language = "English (US)",

volume = "87",

pages = "238--241",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - 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))

AU - Koprowski, Przemysław

AU - Mehlhorn, Kurt

AU - Ray, Saurabh

PY - 2018/7/1

Y1 - 2018/7/1

N2 - 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.

AB - 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.

KW - Convex hull

KW - Hong bound

KW - Polynomials

UR - http://www.scopus.com/inward/record.url?scp=85020408854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85020408854&partnerID=8YFLogxK

U2 - 10.1016/j.jsc.2017.05.008

DO - 10.1016/j.jsc.2017.05.008

M3 - Comment/debate

AN - SCOPUS:85020408854

SN - 0747-7171

VL - 87

SP - 238

EP - 241

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

ER -

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))

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this