Computing Pretropisms for the Cyclic n-Roots Problem
classification
💻 cs.CG
keywords
problemcyclicn-rootsbenchmarkcomputecomputingconeconsider
read the original abstract
The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.