Abstract
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geometry efficiently and exactly. We show a new method to compare real algebraic numbers by precomputing generalized Sturm sequences, thus avoiding iterative methods; the method, moreover handles all degenerate cases. Our first contribution is the determination of rational isolating points, as functions of the coefficients, between any pair of real roots. Our second contribution is to exploit invariants and Bezoutian subexpressions in writing the sequences, in order to reduce bit complexity. The degree of the tested quantities in the input coefficients is optimal for degree up to 3, and for degree 4 in certain cases. Our methods readily apply to real solving of pairs of quadratic equations, and to sign determination of polynomials over algebraic numbers of degree up to 4. Our third contribution is an implementation in a new module of library synaps v2.1. It improves significantly upon the efficiency of certain publicly available implementations: Rioboo’s approach on axiom, the package of Guibas-Karavelas-Russel [11], and core v1.6, maple v9, and synaps v2.0. Some existing limited tests had shown that it is faster than commercial library leda v4.5 for quadratic algebraic numbers.
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.
References
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol. 10. Springer, Heidelberg (2003)
Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Mehlhorn, K., Schömer, E.: A computational basis for conic arcs and boolean operations on conic polygons. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 174–186. Springer, Heidelberg (2002)
Bikker, P., Uteshev, A.Y.: On the Bézout construction of the resultant. J. Symbolic Computation 28(1-2), 45–88 (1999)
Cremona, J.E.: Reduction of binary cubic and quartic forms. LMS J. Computation and Mathematics 2, 62–92 (1999)
Deviller, O., Fronville, A., Mourrain, B., Teillaud, M.: Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Comp. Geom: Theory & Appl., Spec. Issue 22, 119–142 (2002)
Dos Reis, G., Mourrain, B., Rouillier, R., Trébuchet, P.: An environment for symbolic and numeric computation. In: Proc. of the International Conference on Mathematical Software 2002, pp. 239–249. World Scientific, Singapore (2002)
Dupont, L., Lazard, D., Lazard, S., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics. In: Proc. Annual ACM Symp. on Comp. Geometry, June 2003, pp. 246–255. ACM Press, New York (2003)
Emiris, I., Kakargias, A., Teillaud, M., Tsigaridas, E., Pion, S.: Towards an open curved kernel. In: Proc. Annual ACM Symp. on Computational Geometry, pp. 438–446. ACM Press, New York (2004)
Emiris, I.Z., Tsigaridas, E.P.: Comparison of fourth-degree algebraic numbers and applications to geometric predicates. Tech. Rep ECG-TR-302206-03, INRIA Sophia-Antipolis (2003)
Emiris, I.Z., Tsigaridas, E.P.: Methods to compare real roots of polynomials of small degree. Tech. Rep ECG-TR-242200-01, INRIA Sophia-Antipolis (2003)
Guibas, L., Karavelas, M., Russel, D.: A computational framework for handling motion. In: Proc. 6th Workshop (ALENEX) (January 2004) (to appear)
Hemmer, M., Schömer, E., Wolpert, N.: Computing a 3-dimensional cell in an arrangement of quadrics: Exactly and actually! In: Proc. Annual ACM Symp. Comput. Geometry, pp. 264–273 (2001)
Kaplan, D., White, J.: Polynomial equations and circulant matrices. The Mathematical Association of America (Monthly) 108, 821–840 (2001)
Karavelas, M., Emiris, I.: Root comparison techniques applied to the planar additively weighted Voronoi diagram. In: Proc. Symp. on Discrete Algorithms (SODA- 2003), January 2003, pp. 320–329 (2003)
Keyser, J., Culver, T., Manocha, D., Krishnan, S.: ESOLID: A system for exact boundary evaluation. Comp. Aided Design 36(2), 175–193 (2004)
Lazard, D.: Quantifier elimination: optimal solution for two classical examples. J. Symb. Comput. 5(1-2), 261–266 (1988)
Rioboo, R.: Real algebraic closure of an ordered field: implementation in axiom. In: Proc. Annual ACM ISSAC, pp. 206–215. ACM Press, New York (1992)
Rouillier, F., Zimmermann, P.: Efficient isolation of a polynomial real roots. Technical Report 4113, INRIA–Lorraine (2001)
Salmon, G.: Lessons Introductory to the Modern Higher Algebra. Chelsea Publishing Company, New York (1885)
Schmitt, S.: The diamond operator for real algebraic numbers. Technical Report ECG-TR-243107-01, MPI Saarbrücken (2003)
Sederberg, T.W., Chang, G.-Z.: Isolating the real roots of polynomials using isolator polynomials. In: Bajaj, C. (ed.) Algebraic Geometry and Applications, Springer, Heidelberg (1993)
Weispfenning, V.: Quantifier elimination for real algebra–the cubic case. In: Proc. Annual ACM ISSAC, pp. 258–263. ACM Press, New York (1994)
Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Computation 28, 225–242 (1999)
Yap, C.: Fundamental Problems of Algorithmic Algebra. Oxford University Press, Oxford (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emiris, I.Z., Tsigaridas, E.P. (2004). Comparing Real Algebraic Numbers of Small Degree. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive