Certifying approximate solutions to polynomial systems on Macaulay2-Reference-Cited by-同舟云学术

Certifying approximate solutions to polynomial systems on Macaulay2

Published:2019-11-08 Issue:2 Volume:53 Page:45-48
ISSN:1932-2240
Container-title:ACM Communications in Computer Algebra
language:en
Short-container-title:ACM Commun. Comput. Algebra

Author:

Lee Kisun¹

Affiliation:

1. Georgia Institute of Technology

Abstract

We present the Macaulay2 package NumericalCertification for certifying roots of square polynomial systems. It employs the interval Krawczyk method and α -theory as main methods for certification. The package works with output data computed in Macaulay2 with no need for external software. Also, our implementation supports the Krawczyk method which uses interval arithmetic.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3371991.3371995

Reference11 articles.

1. M. Burr K. Lee and A. Leykin. Effective certification of approximate solutions to systems of equations involving analytic functions. arXiv preprint arXiv:1901.10384 2019. M. Burr K. Lee and A. Leykin. Effective certification of approximate solutions to systems of equations involving analytic functions. arXiv preprint arXiv:1901.10384 2019.

2. J. P. Dedieu and M. Shub. On simple double zeros and badly conditioned zeros of analytic functions of n variables. Mathematics of computation pages 319--327 2001. J. P. Dedieu and M. Shub. On simple double zeros and badly conditioned zeros of analytic functions of n variables. Mathematics of computation pages 319--327 2001.

3. D. R. Grayson and M. E. Stillman. Macaulay2 a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/ 2002. D. R. Grayson and M. E. Stillman. Macaulay2 a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/ 2002.

4. Z. Hao W. Jiang N. Li and L. Zhi. Computing simple multiple zeros of polynomial systems. arXiv preprint arXiv:1703.03981 2017. Z. Hao W. Jiang N. Li and L. Zhi. Computing simple multiple zeros of polynomial systems. arXiv preprint arXiv:1703.03981 2017.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Certified homotopy tracking using the Krawczyk method;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Implementing real polyhedral homotopy;Journal of Software for Algebra and Geometry;2024-04-30

3. Effective Alpha Theory Certification Using Interval Arithmetic: Alpha Theory over Regions;Lecture Notes in Computer Science;2024

4. Certifying Zeros of Polynomial Systems Using Interval Arithmetic;ACM Transactions on Mathematical Software;2023-03-21

5. Euclidean Distance Degree and Mixed Volume;Foundations of Computational Mathematics;2021-09-07