On the complexity of real solving bivariate systems

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2007, Pages 127-134

  Diochnos, Dimitrios I ^a   Emiris, Ioannis Z ^a   Tsigaridas, Elias P ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b LORIA   (France)

Author keywords

Maple; Polynomial system; Real algebraic number; Realsolving; Topology of real algebraic curve

Indexed keywords

INTERSECTION MULTIPLICITIES; POLYNOMIAL SYSTEMS; REAL ALGEBRAIC CURVES; REAL ALGEBRAIC NUMBER;

DIGITAL LIBRARIES; MATRIX ALGEBRA; NUMERICAL METHODS; TOPOLOGY;

POLYNOMIALS;

EID: 36349036028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277548.1277567     Document Type: Conference Paper

References (35)

1. J. Abbott. Quadratic interval refinement for real roots. In ISSAC 2006, poster. www.dima.unige.it/~abbott/.
2. D. Anion, S. McCallum. A polynomial time algorithm for the topological type of a real algebraic curve. JSC, 5:213-236, 1988.
3. S. Basu, R. Pollack, and M-F.Roy. Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics. Springer-Verlag, 2nd edition, 2006.
4. J. Canny. Some algebraic and geometric computations in PSPACE. In Proc. STOC, pp. 460-467, 1988.
5. F. Cazals, J.-C. Faugère, M. Pouget, and F. Rouillier. The implicit structure of ridges of a smooth parametric surface. Comput. Aided Geom. Des., 23(7):582-598, 2006.
6. D. I. Diochnos, I. Z. Emiris, and E. P. Tsigaridas. On the complexity of real solving bivariate systems. Research Report 6116, INRIA, 2007. https://hal.inria.fr/inria-00129309.
7. Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. Int. Workshop on Symbolic Numeric Computing, pp. 81-93, Beijing, 2005.
8. A. Eigenwillig, M. Kerber, N. Wolpert. Fast and Exact Geometric Analysis of Real Algebraic Plane Curves. In ISSAC, 2007. ACM Press.
9. A. Eigenwillig, V. Sharma, and C. K. Yap. Almost tight recursion tree bounds for the Descartes method. In ISSAC, pp. 71-78, 2006. ACM Press.
10. I.Z. Emiris, B. Mourrain, and E.P. Tsigaridas. Real Algebraic Numbers: Complexity Analysis and Experimentation. Reliable Implementations of Real Number Algorithms: Theory and Practice, LNCS (to appear). Springer Verlag, 2007. also available in www.inria.fr/rrrt/rr-5897.html.
11. I.Z. Emiris and E.P. Tsigaridas. Real solving of bivariate polynomial systems. In Proc. Comp. Algebra in Scient. Comput., vol. 3718 LNCS, pp. 150-161. Springer, 2005.
12. L. González-Vega and M. El Kahoui. An improved upper complexity bound for the topology computation of a real algebraic plane curve. J. Complexity, 12(4):527-544, 1996.
13. L. González-Vega, H. Lombardi, T. Recio, and M.-F. Roy. Sturm-Habicht Sequence. In ISSAC, pp. 136-146, 1989. ACM Press.
14. L. Gonzalez-Vega and I. Necula. Efficient topology determination of implicitly defined algebraic plane curves. Comp. Aided Geom. Design, 19(9):719-743, 2002.
15. J. Klose. Binary segmentation for multivariate polynomials. J. Complexity, 11(3):330-343, 1995.
16. K. Ko, T. Sakkalis, and N. Patrikalakis. Resolution of multiple roots of nonlinear polynomial systems. Int. J. Shape Modelling, 11(1):121-147, 2005.
17. T. Lickteig and M.-F. Roy. Sylvester-Habicht Sequences and Fast Cauchy Index Computation. JSC, 31(3):315-341, 2001.
18. H. Lombardi, M.-F. Roy, and M. Safey El Din. New Structure Theorem for Subresultants. JSC, 29(4-5):663-689, 2000.
19. M. Mignotte and D. Stefanescu. Polynomials: An algorithmic approach. Springer, 1999.
20. P. Mllne. On the solution of a set of polynomial equations. In B. Donald, D. Kapur, and J. Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence, pp. 89-102. Academic Press, 1992.
21. B. Mourrain and J.-P. Pavone. Subdivision methods for solving polynomial equations. TR-5658, INRIA Sophia-Antipolis, 2005.
22. B. Mourrain, S. Pion, S. Schmitt, J.-P. Técourt, E. Tsigaridas, and N. Wolpert. Algebraic issues in computational geometry. Effective Computational Geometry for Curves and Surfaces, pp. 117-155. Springer-Verlag, 2006.
23. B. Mourrain and P. Trébuchet. Solving projective complete intersection faster. In ISSAC, pp. 231-238, 2000. ACM Press.
24. V. Pan. Univariate polynomials: Nearly optimal algorithms for numerical factorization and rootfinding. JSC, 33:701-733, 2002.
25. P. Pedersen, M-F. Roy, and A. Szpirglas. Counting real zeros in the multivariate case. In Computational Algebraic Geometry, vol. 109 of Progress in Mathematics, pp. 203-224. Birkhäuser, Boston, 1993.
26. D. Reischert. Asymptotically fast computation of subresultants. In ISSAC, pp. 233-240, 1997. ACM Press.
27. J. Renegar. On the worst-case arithmetic complexity of approximating zeros of systems of polynomials. SIAM J. Computing, 18:350-370, 1989.
28. F. Rouillier. Solving zero-dimensional systems through the rational univariate representation. J. AAECC, 9:433-461, 1999.
29. T. Sakkalis. Signs of algebraic numbers. Computers and Mathematics, pp. 131-134, 1989.
30. T. Sakkalis and R. Farouki. Singular points of algebraic curves. JSC, 9(4):405-421, 1990.
31. M. van Hoeij and M. Monagan. A modular GCD algorithm over number fields presented with multiple extensions. In ISSAC, pp. 109-116, 2002. ACM Press.
32. J. von zur Gathen and T. Lücking. Subresultants revisited. TCS, 1-3(297):199-239, 2003.
33. N. Wolpert. An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics. PhD thesis, MPI Informatik, 2002.
34. N. Wolpert, R. Seidel. On the exact computation of the topology of real algebraic curves. In SoCG, pp.107-115, 2005
35. C. Yap. Fundamental Problems of Algorithmic Algebra. Oxford Univ. Press, New York, 2000.