Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation

From MaRDI portal
Publication:3454535

DOI10.1007/978-3-319-24021-3_7zbMATH Open1439.13078arXiv1506.02618OpenAlexW572464674MaRDI QIDQ3454535FDOQ3454535


Authors: Nathan Bliss, Jeff Sommars, J. Verschelde, Xiangcheng Yu Edit this on Wikidata


Publication date: 25 November 2015

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1506.02618




Recommendations





Cited In (3)

Uses Software





This page was built for publication: Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454535)