Solving Polynomial Systems with phcpy

06/28/2019
by   Jasmine Otto, et al.
0

The solutions of a system of polynomials in several variables are often needed, e.g.: in the design of mechanical systems, and in phase-space analyses of nonlinear biological dynamics. Reliable, accurate, and comprehensive numerical solutions are available through PHCpack, a FOSS package for solving polynomial systems with homotopy continuation. This paper explores new developments in phcpy, a scripting interface for PHCpack, over the past five years. For instance, phcpy is now available online through a JupyterHub server featuring Python2, Python3, and SageMath kernels. As small systems are solved in real-time by phcpy, they are suitable for interactive exploration through the notebook interface. Meanwhile, phcpy supports GPU parallelization, improving the speed and quality of solutions to much larger polynomial systems. From various model design and analysis problems in STEM, certain classes of polynomial system frequently arise, to which phcpy is well-suited.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

Decomposable sparse polynomial systems

The Macaulay2 package DecomposableSparseSystems implements methods for s...
research
07/18/2020

On Algorithmic Estimation of Analytic Complexity for Polynomial Solutions to Hypergeometric Systems

The paper deals with the analytic complexity of solutions to bivariate h...
research
02/12/2018

Quantum Algorithms for Optimization and Polynomial Systems Solving over Finite Fields

In this paper, we give quantum algorithms for two fundamental computatio...
research
11/28/2017

HomotopyContinuation.jl - a package for solving systems of polynomial equations in Julia

This paper is gives a short introduction into HomotopyContinuation.jl, a...
research
05/18/2021

Yet another eigenvalue algorithm for solving polynomial systems

In latest years, several advancements have been made in symbolic-numeric...
research
05/31/2019

On the Parallelization of Triangular Decomposition of Polynomial Systems

We discuss the parallelization of algorithms for solving polynomial syst...
research
02/11/2019

Solving QSAT in sublinear depth

Among PSPACE-complete problems, QSAT, or quantified SAT, is one of the m...

Please sign up or login with your details

Forgot password? Click here to reset