Abstract
Let A be a polynomial over Z, Q or Q(α) where α is a real algebraic number. The problem is to compute a sequence of disjoint intervals with rational endpoints, each containing exactly one real zero of A and together containing all real zeros of A. We describe an algorithm due to Kronecker based on the minimum root Separation, Sturm’s algorithm, an algorithm based on Rolle’s theorem due to Collins and Loos and the modified Uspensky algorithm due to Collins and Aritas. For the last algorithm a recursive version with correctness proof is given which appears in print for the first time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Collins, G. E.: Infallible Calculation of Polynomial Zeros to Specifled Precision, Mathematical Software III (Rice, J. R., ed.), pp. 35–68. New York: Academic Press 1977.
Collins, G. E.: Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Lecture Notes in Computer Science, Vol. 33, pp. 134–183. Berlin-Heidelberg- New York: Springer 1975.
Collins, G. E.: Real Root Subsystem, in SAC-2 System of Algebraic Algorithms. Available at request.
Collins, G. E., Akritas, A. G.: Polynomial Real Root Isolation Using Descartes’ Rule of Signs. SYMSAC 1976, 272–275.
Collins, G. E., Horowitz, E.: The Minimum Root Separation of a Polynomial. Math. Comp. 28, 589–597 (1974).
Collins, G. E., Loos, R.: Polynomial Real Root Isolation by Differentiation. SYMSAC 1976, 15–25.
Heindel, L. E.: Integer Arithmetic Algorithms for Polynomial Real Zero Determination. JACM 18,533–548 (1971).
Henrici, P.: Methods of Search for Solving Polynomial Equations. JACM 17, 273–283 (1970).
Henrici, P., Gargantini, I.: Uniformly Convergent Algorithms for the Simultaneous Approximation of All Zeros of a Polynomial. In: Constructive Aspects of the Fundamental Theorem of Algebra (Dejon, B., Henrici, P., eds.), pp. 77–114. London: Wiley-Interscience 1969.
Knuth, D. E.: The Art of Computer Programming, Vol. 2, Ist ed. (Seminumerical Algorithms). Reading, Mass.: Addison-Wesley 1969.
Kronecker, L.: Über den Zahlbegriff. Crelle J. reine und angew. Mathematik 101, 337–395 (1887).
Pinkert, J. R.: An Exact Method for Finding the Roots of a Complex Polynomial. TOMS 2, 351–363 (1976).
Uspensky, J. V.: Theory of Equations. New York: McGraw-Hill 1948.
Vincent, M.: Sur la Resolution des Equations Numeriques. J. de Mathematiques Pures et Appliquees 1, 341–372 (1836).
Weyl, H.: Randbemerkungen zu Hauptproblemen der Mathematik, II. Fundamentalsatz der Algebra und Grundlagen der Mathematik. Math. Z. 20, 131–150 (1924)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag/Wien
About this chapter
Cite this chapter
Collins, G.E., Loos, R. (1983). Real Zeros of Polynomials. In: Buchberger, B., Collins, G.E., Loos, R., Albrecht, R. (eds) Computer Algebra. Computing Supplementa, vol 4. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7551-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7551-4_7
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81776-6
Online ISBN: 978-3-7091-7551-4
eBook Packages: Springer Book Archive