Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
arXiv:1506.02618
Abstract
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize and classify the polynomial systems we solved. The classification with the canonical form of a graph identifies newly submitted systems with systems that have already been solved.
arXiv commentAccepted for publication in the Proceedings of CASC 2015
References in corpus (5)
- Modernizing PHCpack through phcpy
- Computing Puiseux Series for Algebraic Surfaces
- A Polyhedral Method to Compute All Affine Solution Sets of Sparse Polynomial Systems
- Accelerating Polynomial Homotopy Continuation on a Graphics Processing Unit with Double Double and Quad Double Arithmetic
- Tracking Many Solution Paths of a Polynomial Homotopy on a Graphics Processing Unit