Certifying approximate solutions to polynomial systems on Macaulay2

Kisun Lee · ACM communications in computer algebra · 2019

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.

Read the paper · More papers on PaperTik