Skip to main content
Springer Nature Link
Log in

Computing the irreducible real factors and components of an algebraic curve

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducible real components. We show that our algorithms are of polynomial bit complexity in the degree of the equation and the size of its coefficients. Our construction is based on computing the irreducible complex factors and then investigating high precision complex floating point coefficients of these factors and the complex norms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

7. References

  1. Arnon, D.S., Collins, G.E., McCallum, S.: Cylindrical algebraic decomposition I: the basic algorithm. SIAM J. Comp.13, 865–877 (1984)

    Google Scholar 

  2. Canny, J.: Some algebraic and geometric computations in P-space. Proc. 20th Annual ACM Symp. Theory Comp. 460–467 (1988)

  3. Chistov, A.L., Grigoryev, D.Yu.: Subexponential-time solving of systems of algebraic equations I. Tech. Rep. E-9-83, Steklov Mathematical Institute, Leningrad, 1983

    Google Scholar 

  4. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Proc. 2nd GI Conf. Automata Theory Formal Lang. Lecture Notes in Computer Science, vol. 33, pp. 515–532. Berlin, Heidelberg, New York: Springer 1975

    Google Scholar 

  5. Collins, G.E.: Infallible calculation of polynomial zeros to specified precision. In: Mathematical Software III. Rice, J.R. (ed.) pp. 35–68. New York: Academic Press 1977

    Google Scholar 

  6. Collins, G.E., Horowitz, E.: The minimum root separation of a polynomial. Math. Comput.28, 589–597 (1974)

    Google Scholar 

  7. Dvornicich, R., Traverso, C.: Newton symmetric functions and the arithmetic of algebraically closed fields. In: Proc. AAECC-5, Lecture Notes Computer Science, vol. 356; pp. 216–224. Berlin, Heidelberg, New York: Springer 1987

    Google Scholar 

  8. Jacobson, N.: Basic algebra I. San Francisco: W. H. Freeman 1974

    Google Scholar 

  9. Kaltofen, E.: Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. SIAM J. Comp.14, 469–489 (1985)

    Google Scholar 

  10. Kaltofen, E.: Fast parallel absolute irreducibility testing. J. Symbolic Comput.1, 57–67 (1985)

    Google Scholar 

  11. Kaltofen, E.: Deterministic irreducibility testing of polynomials over large finite fields. J. Symbolic Comput.4, 77–82 (1987)

    Google Scholar 

  12. Landau, E.: Sur quelques théorèmes de M. Petrovic relatifs aux zéros des fonctions analytiques. Bull. Soc. Math. France33, 251–261 (1905)

    Google Scholar 

  13. Lipson, J.: Elements of algebra and algebraic computing. Reading, MA: Addison-Wesley 1981

    Google Scholar 

  14. Loos, R.: Computing in algebraic extensions. In: Computer algebra, 2nd. Buchberger, B. et al. (eds.) pp. 173–187. Wien: Springer 1982

    Google Scholar 

  15. Mahler, K.: An inequality for the discriminant of a polynomial. Michigan Math. J.11, 257–262 (1964)

    Google Scholar 

  16. Mignotte, M.: Some useful bounds. In: Computer algebra. 2nd ed. Buchberger, B. et al. (eds.) pp. 259–263. Wien: Springer 1982

    Google Scholar 

  17. Pinkert, J.R.: An exact method for finding roots of a complex polynomial. ACM Trans. Math. Software2(4, 351–363 (1976)

    Google Scholar 

  18. Renegar, J.: A faster P-space algorithm for deciding the existential theory of the reals. Proc. 29th Annual Symp. Foundations of Comp. Sci. pp. 291–295 (1988)

  19. Schönhage, A.: The fundamental theorem of algebra in terms of computational complexity. Tech. Report, University of Tübingen, 1982

  20. Seidenberg, A.: A new decision method for elementary algebra. Ann. Math.60, 365–374 (1954)

    Google Scholar 

  21. Trager, B.M.: Integration of algebraic functions. Ph. D. Thesis, MIT, 1984

  22. van der Waerden, B.L.: Modern algebra. New York: F. Ungar 1953

    Google Scholar 

  23. Wilf, H.S.: A global bisection algorithm for computing the zeros of polynomials in the complex plane. J. ACM25(3), 415–420 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rensselaer Polytechnic Institute, 12180-3590, Troy, NY, USA

    Erich Kaltofen

Authors
  1. Erich Kaltofen
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This material is based on work supported by the National Science Foundation under Grant No. CCR-87-05363 and under Grant No. CDA-8805910. A preliminary version of this paper appears in the Proceedings of the 5th Annual Symposium on Computational Geometry, ACM Press, pp. 79–87 (1989)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaltofen, E. Computing the irreducible real factors and components of an algebraic curve. AAECC 1, 135–148 (1990). https://doi.org/10.1007/BF01810297

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01810297

Keywords