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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
