Advertisement

Homotopy Continuation in Macaulay2

  • Anton LeykinEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10931)

Abstract

We describe the design and relationships of several Macaulay2 packages that use numerical polynomial homotopy continuation as their engine. Macaulay2 is a computer algebra system built around the classical symbolic computation tools such as Gröbner bases. However, recent Macaulay2 versions include its own fast implementation of homotopy continuation, interfaces to external numerical algebraic geometry software (Bertini and PHCpack), and a unified data structures design that allows the use of the internal and external capabilities interchangeably. The resulting numerical and hybrid tools are of general interest to Macaulay2 users interested in computational experimentation.

Keywords

Polynomial homotopy continuation Numerical algebraic geometry Macaulay2 

Notes

Acknowledgement

Research of AL is supported in part by DMS-1719968 award from NSF.

References

  1. 1.
    Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (1999)CrossRefGoogle Scholar
  2. 2.
    Bates, D.J., Gross, E., Leykin, A., Rodriguez, J.I.: Bertini for Macaulay2. arXiv:1310.3297
  3. 3.
    Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Numerically solving polynomial systems with Bertini, vol. 25. SIAM (2013)Google Scholar
  4. 4.
    Chen, J., Kileel, J.: Numerical Implicitization for Macaulay2. arXiv preprint arXiv:1610.03034 (2016)
  5. 5.
    Chen, T., Lee, T.-L., Li, T.-Y.: Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 183–190. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-44199-2_30CrossRefGoogle Scholar
  6. 6.
    Duff, T., Hill, C., Jensen, A., Lee, K., Leykin, A., Sommars, J.: Solving polynomial systems via homotopy continuation and monodromy. IMA J. Numer. Anal. (to appear)Google Scholar
  7. 7.
    Fousse, L., Hanrot, G., Lefèvre, V., Pélissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33(2), 13:1–13:15 (2007)CrossRefGoogle Scholar
  8. 8.
    Grayson, D.R., Stillman, M.E.: Macaulay2, a software system for research in algebraic geometry. http://www.math.uiuc.edu/Macaulay2/
  9. 9.
    Gross, E., Petrović, S., Verschelde, J.: Interfacing with PHCpack. J. Softw. Algebra Geometry 5(1), 20–25 (2013)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Huber, B., Sturmfels, B.: A polyhedral method for solving sparse polynomial systems. Math. Comp. 64(212), 1541–1555 (1995)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Krone, R.: Numerical Hilbert functions for Macaulay2. arXiv preprint arXiv:1405.5293 (2014)
  12. 12.
    Leykin, A.: Numerical algebraic geometry. J. Softw. Algebra Geometry 3, 5–10 (2011)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Leykin, A., del Campo, A.M., Sottile, F., Vakil, R., Verschelde, J.: Numerical schubert calculus via the littlewood-richardson homotopy algorithm. arXiv preprint arXiv:1802.00984 (2018)
  14. 14.
    Morgan, A.: Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Prentice Hall Inc., Englewood Cliffs (1987)zbMATHGoogle Scholar
  15. 15.
    Verschelde, J.: Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2), 251–276 (1999). http://www.math.uic.edu/~janCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Georgia Institute of TechnologyAtlantaUSA

Personalised recommendations