Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods

Yang Dai, Sunyoung Kim, Masakazu Kojima

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute all isolated nonsingular solutions of the equations efficiently by the polyhedral homotopy continuation method and to verify the correctness of the generated approximate solutions. Numerical results on the cyclic-8 to the cyclic-12 polynomial equations, including their solution information, are given.

Original languageEnglish
Pages (from-to)83-97
Number of pages15
JournalJournal of Computational and Applied Mathematics
Volume152
Issue number1-2
DOIs
StatePublished - 1 Mar 2003

Bibliographical note

Funding Information:
Research supported by KRF 2001-015-DP0023.

Keywords

  • Homotopy continuation methods
  • Nonlinear programming
  • Systems of equations

Fingerprint

Dive into the research topics of 'Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods'. Together they form a unique fingerprint.

Cite this