Related papers: The NumericalCertification package in Macaulay2
The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The…
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
We introduce a new Macaulay2 package, Nauty, which gives access to powerful methods on graphs provided by the software nauty by Brendan McKay. The primary motivation for accessing nauty is to determine if two graphs are isomorphic. We also…
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly…
We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.
This note describes a package for computing seminormalization of rings within Macaulay2.
The Macaulay2 package NumericalSchubertCalculus provides methods for the numerical computation of Schubert problems on Grassmannians. It implements both the Pieri homotopy algorithm and the Littlewood-Richardson homotopy algorithm. Each…
This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
We reexamine Smale's alpha theory as a way to certify a numerical solution to an analytic system. For a given point and a system, Smale's alpha theory determines whether Newton's method applied to this point shows the quadratic convergence…
We introduce the MatrixSchubert package for the computer algebra system Macaulay2. This package has tools to construct and study matrix Schubert varieties and alternating sign matrix (ASM) varieties. The package also introduces tools for…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the…
The growing reliance on artificial intelligence in safety- and security-critical applications is raising concerns about the robustness of neural networks to erroneous or adversarial input. Certification is a methodology for ensuring model…
These notes present some extensions of a formal method introduced in an earlier paper. The formal method is designed as a tool for program verification of numerical computation and forms the basis of the software package VPC. Included in…
We describe a procedure based on the Krawczyk method to compute a verified enclosure for the stabilizing solution of a continuous-time algebraic Riccati equation $A^*X+XA+Q=XGX$ building on the work of [B.~Hashemi, \emph{SCAN} 2012] and…
{\tt AbstractSimplicialComplexes.m2} is a computer algebra package written for the computer algebra system {\tt Macaulay2} \cite{M2}. It provides new infrastructure to work with abstract simplicial complexes and related homological…
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing…
In this paper, we propose a method to factorise of arbitrary strictly nonsingular 2x2 matrix functions allowing for stable factorisation. For this purpose, we utilise the ExactMPF package working within the Maple environment previously…