Decomposable sparse polynomial systems
Taylor Brysiewicz, Jose Israel Rodriguez, Frank Sottile and, Thomas Yahl
TL;DR
This paper introduces a Macaulay2 package designed to analyze and solve decomposable sparse polynomial systems by leveraging their structure for more efficient computation.
Contribution
It presents methods and tools within the package for studying and solving decomposable sparse polynomial systems, highlighting how to exploit their structure.
Findings
The package effectively identifies decomposable structures.
Methods improve the efficiency of solving sparse polynomial systems.
Examples demonstrate practical applications.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.