Abstract
In Section 1 we describe classical bounds on the roots of polynomials. In Section 2 we study real roots of univariate polynomials by a method based on Descartes’s law of sign and Bernstein polynomials. These roots are characterized by intervals with rational endpoints. The method presented works only for archimedean real closed fields. In the second part of the chapter we study exact methods working in general real closed fields. Section 3 is devoted to exact sign determination in a real closed field and Section 4 to characterizations of roots in a real closed field.
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.
Bibliographical Notes
A.J.H. Vincent, Sur la résolution des équations numériques, Journal de Mathématiques Pures et Appliquées, 341–372 (1836).
J.V. Uspensky, Theory of equations, MacGraw Hill (1948).
G. Farin, Curves and surfaces for Computer Aided Design,Academic Press (1990).
M. Ben-Or, D. Kozen, J. Reif, The complexity of elementary algebra and geometry, J. of Computer and Systems Sciences, 18:251–264, (1986).
M. Coste, M.-F. Roy, Thom’s lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. Journal of Symbolic Computation 5, No.1/2, 121–129 (1988).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Basu, S., Pollack, R., Roy, MF. (2003). Real Roots. In: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05355-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-05355-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-05357-7
Online ISBN: 978-3-662-05355-3
eBook Packages: Springer Book Archive