Abstract
This paper summarizes results obtained in the author’s Ph.D. thesis (Johnson 1991). Improved maximum computing time bounds are obtained for isolating the real roots of an integral polynomial. In addition to the theoretical results a systematic study was initiated comparing algorithms based on Sturm sequences, the derivative sequence, and Descartes’ rule of signs. The algorithm with the best theoretical computing time bound is the coefficient sign variation method, an algorithm based on Descartes’ rule of signs. Moreover, the coefficient sign variation method typically outperforms the other algorithms in practice; however, we exhibit classes of input polynomials for which each algorithm is superior.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag/Wien
About this paper
Cite this paper
Johnson, J.R. (1998). Algorithms for Polynomial Real Root Isolation. In: Caviness, B.F., Johnson, J.R. (eds) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9459-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9459-1_13
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82794-9
Online ISBN: 978-3-7091-9459-1
eBook Packages: Springer Book Archive