arXiv Open Access 2016

Computing Pretropisms for the Cyclic n-Roots Problem

Jeff Sommars Jan Verschelde

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CG

Penulis (2)

Jeff Sommars

Jan Verschelde

Format Sitasi

APA MLA BibTeX

Sommars, J., Verschelde, J. (2016). Computing Pretropisms for the Cyclic n-Roots Problem. https://arxiv.org/abs/1602.07348

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓