Decomposable sparse polynomial systems

06/04/2020
by   Taylor Brysiewicz, et al.
0

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 package may be used to exploit this structure, with examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2022

The NumericalCertification package in Macaulay2

The package implements methods for certifying numerical approximations ...
research
02/11/2021

The vote Package: Single Transferable Vote and Other Electoral Systems in R

We describe the vote package in R, which implements the plurality (or fi...
research
08/16/2019

Studying Wythoff and Zometool Constructions using Maple

We describe a Maple package that serves at least four purposes. First, o...
research
01/13/2020

Solving Decomposable Sparse Systems

Amendola et al. proposed a method for solving systems of polynomial equa...
research
06/28/2019

Solving Polynomial Systems with phcpy

The solutions of a system of polynomials in several variables are often ...
research
01/12/2022

Sparse trace tests

We establish how the coefficients of a sparse polynomial system influenc...
research
10/25/2017

Learning Large Scale Ordinary Differential Equation Systems

Learning large scale nonlinear ordinary differential equation (ODE) syst...

Please sign up or login with your details

Forgot password? Click here to reset