2000 character limit reached
The NumericalCertification package in Macaulay2
Published 2 Aug 2022 in math.NA, cs.NA, and math.AG | (2208.01784v1)
Abstract: The package \texttt{NumericalCertification} implements methods for certifying numerical approximations of solutions for a given system of polynomial equations. For certifying regular solutions, the package implements Smale's $\alpha$-theory and Krawczyk method. For a singular solution, we implement soft verification using the iterative deflation method. We demonstrate the functionalities of the package focusing on interaction with current numerical solvers in \texttt{Macaulay2}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
