Related papers: PHCpack in Macaulay2
CylindricalAlgebraicDecomposition.m2 is the first implementation of Cylindrical Algebraic Decomposition (CAD) in Macaulay2. CAD decomposes space into 'cells' where input polynomials are sign-invariant. This package computes an Open CAD…
Given a homotopy connecting two polynomial systems we provide a rigorous algorithm for tracking a regular homotopy path connecting an approximate zero of the start system to an approximate zero of the target system. Our method uses recent…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the…
We present the Julia package SagbiHomotopy.jl for solving systems of polynomial equations using numerical homotopy continuation. The package introduces an optimal choice of a start system based on SAGBI homotopies. For square horizontally…
We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2. This package implements many data types, objects and algorithms which pertain to, among other things, filtered complexes,…
Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes…
Numerical continuation methods track a solution path defined by a homotopy. The systems we consider are defined by polynomials in several variables with complex coefficients. For larger dimensions and degrees, the numerical conditioning…
The manuscript addresses the problem of finding all solutions of power flow equations or other similar nonlinear system of algebraic equations. This problem arises naturally in a number of power systems contexts, most importantly in the…
We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
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…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
We introduce a new Macaulay 2 package, SimplicialDecomposability, which works in conjunction with the extant package SimplicialComplexes in order to compute a shelling order, if one exists, of a specified simplicial complex. Further,…
We introduce the Macaulay2 package HomologicalShiftIdeals. It allows to compute the homological shift ideals of a monomial ideal, and to check the homological shift properties, including having linear resolution, having linear quotients, or…
We present {\tt RandomPoints}, a package in \emph{Macaulay2} designed mainly to identify rational and geometric points in a variety over a finite field. We provide tools to estimate the dimension of a variety. We also present methods to…
This paper describes the RationalMaps package for Macaulay2. This package provides functionality for computing several aspects of rational maps such as whether a map is birational, or a closed embedding.
The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also introduces new objects, Sample and Model, to allow for…
Polylab is a MATLAB toolbox for multivariate polynomial scalars and polynomial matrices with a unified symbolic-numeric interface across CPU and GPU-oriented backends. The software exposes three aligned classes: MPOLY for CPU execution,…
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…