HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method

Computing (Vienna/New York)

Volumn 83, Issue 2-3, 2008, Pages 109-133

  Lee, T L ^a   Li, T Y ^a   Tsai, C H ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

Homotopy continuation methods; Numerical experiments; Polyhedral homotopy; Polynomial systems; Software package

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; KETONES; NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS; SOFTWARE PACKAGES;

BENCHMARK SYSTEMS; BERTINI; FORTRAN 90; HOMOTOPIES; HOMOTOPY CONTINUATION METHODS; NUMERICAL ALGEBRAIC GEOMETRIES; NUMERICAL EXPERIMENTS; NUMERICAL RESULTS; ONE STEPS; POLYHEDRAL HOMOTOPY; POLYNOMIAL SYSTEMS; SPEED-UP;

POLYNOMIAL APPROXIMATION;

EID: 56749179605     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-008-0015-6     Document Type: Article

References (34)

1. Bates DJ, Hauenstein JD, Sommese AJ, Wampler CW Bertini: Software for numerical algebraic geometry. Available at http://www.nd.edu/~sommese/bertini
2. DJ Bates JD Hauenstein AJ Sommese CW Wampler 2008 Adaptive multiprecision path tracking SIAM J Numer Anal 46 2 722 746
3. DN Bernshtein 1975 The number of roots of a system of equations Funct Anal Appl 9 3 183 185
4. G Björk R Fröberg 1991 A faster way to count the solutions of inhomogeneous systems of algebraic equations J Symb Comput 12 3 329 336
5. W Boege R Gebauer H Kredel 1986 Some examples for solving systems of algebraic equations by calculating Groebner bases J Symb Comput 2 83 98
6. H Cohn 1982 An explicit modular equation in two variables and Hilbert's twelfth problem Math Comp 38 227 236
7. T Dai S Kim M Kojima 2003 Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods J Comput Appl Math 152 1-2 83 97
8. T Gao TY Li 2000 Mixed volume computation via linear programming Taiwan J Math 4 599 619
9. T Gao TY Li 2003 Mixed volume computation for semi-mixed systems Discrete Comput Geom 29 2 257 277
10. T Gao TY Li M Wu 2005 Algorithm 846: MixedVol: a software package for mixed volume computation ACM Trans Math Softw 31 4 555 560
11. T Gunji S Kim M Kojima A Takeda K Fujisawa T Mizutani 2004 PHoM-a polyhedral homotopy continuation method Computing 73 57 77
12. B Huber B Sturmfels 1995 A polyhedral method for solving sparse polynomial systems Math Comp 64 1541 1555
13. B Huber J Verschelde 1998 Polyhedral end games for polynomial continuation Numer Algorithms 18 1 91 108
14. S Kim M Kojima 2004 Numerical stability of path tracing in polyhedral homotopy continuation methods Computing 73 329 348
15. YC Kuo TY Li 2008 Determining dimension of the solution component that contains a computed zero of a polynomial system J Math Anal Appl 338 2 840 851
16. Lee TL, Li TY Mixed volume computation. A revisit (submitted)
17. A Leykin J Verschelde A Zhao 2006 Newton's method with deflation for isolated singularities of polynomial systems Theor Comput Sci 359 1-3 111 122
18. Leykin A, Verschelde J, Zhao A (2007) Evaluation of Jacobian matrices for Newton's method with deflation to approximate isolated singular solutions of polynomial systems. Symb Numer Comput 269-278
19. Leykin A, Verschelde J, Zhao A (2008) Higher-order deflation for polynomial systems with isolated singular solutions. In: IMA: algorithms in algebraic geometry, vol 146. Springer, Heidelberg, pp 79-97
20. TY Li 1997 Numerical solution of multivariate polynomial systems by homotopy continuation methods Acta Numer 6 399 436
21. TY Li 1999 Solving polynomial systems by polyhedral homotopies Taiwan J Math 3 251 279
22. Li TY (2003) Solving polynomial systems by the homotopy continuation method. Handbook of numerical analysis, vol XI. North-Holland, Amsterdam, pp 209-304
23. TY Li X Li 2001 Finding mixed cells in the mixed volume computation Found Comput Mathem 1 161 181
24. TY Li T Sauer JA Yorke 1989 The cheaters homotopy: an efficient procedure for solving systems of polynomial equations SIAM J Numer Anal 26 1241 1251
25. TY Li Z Zeng 2005 A rank-revealing method with updating, downdating, and applications SIAM J Matrix Anal Appl 26 918 946
26. T Mizutani A Takeda M Kojima 2007 Dynamic enumeration of all mixed cells Discrete Comput Geom 37 351 367
27. Morgan AP (1987) Solving polynomial systems using continuation for engineering and scientific problems. Prentice-Hall, New Jersey
28. AP Morgan AJ Sommese 1992 Coefficient-parameter polynomial continuation (Errata: Appl Math Comput 51:207) Appl Math Comput 29 123 160
29. AP Morgan AJ Sommese CW Wampler 1992 A power series method for computing singular solutions to nonlinear analytic systems Numer Math 63 3 1779 1792
30. VW Noonburg 1989 A neural network modeled by an adaptive Lotka-Volterra system SIAM J Appl Math 49 1779 1792
31. A Sommese J Verschelde C Wampler 2001 Numerical decomposition of the solution sets of polynomial systems into irreducible components SIAM J Numer Anal 38 6 2022 2046
32. Sommese A, Wampler C (2005) The numerical solution of polynomial systems arising in engineering and science. World Scientific Publishing, Hackensack
33. Traverso C The PoSSo test suite at http://www.inria.fr/saga/PO.
34. Verschelde J (1999) Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans Math Softw 25:251-276. Software available at http://www.math.uic.edu/~jan