PHoM - A polyhedral homotopy continuation method for polynomial systems

Computing (Vienna/New York)

Volumn 73, Issue 1, 2004, Pages 57-77

  Gunji, Takayuki ^a,b   Kim, Sunyoung ^a,c   Kojima, Masakazu ^a,b   Takeda, Akiko ^a,b   Fujisawa, Katsuki ^a,e   Mizutani, Tomohiko ^a,d  

^a Tokyo Institute of Technology ^*

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c Ewha Womans University   (South Korea)

^d TOSHIBA CORPORATION   (Japan)

^e TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Equation; Homotopy continuation method; Numerical experiment; Polyhedral homotopy; Polynomial; Software package

Indexed keywords

COMPUTER SIMULATION; COMPUTER SOFTWARE; CONTROL NONLINEARITIES; DATA RECORDING; LINEAR EQUATIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NUMERICAL ANALYSIS;

BERNSTEIN THEORY; HOMOTOPY CONTIUATION METHODS; NUMERICAL EXPERIMENTS; POLYHEDRAL HOMOTOPY;

POLYNOMIALS;

EID: 4243094969     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-003-0032-4     Document Type: Article

References (31)

1. Allgower, E., Georg, K.: Numerical continuation methods. Springer 1990.
2. Allison, D. C. S., Chakaborty, A., Watson, L. T.: Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube. J. Supercomputing 3, 5-20 (1989).
3. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: "LAPACK users' guide third" society for industrial and applied mathematics. Philadelphia, PA 1999.
4. Bernshtein, D. N.: The number of roots of a system of equations. Funct. Anal. Appl. 9, 183-185 (1975).
5. Boege, W., Gebauer, R., Kredel, H.: Some examples for solving systems of algebraic equations by calculating Groebner bases. J. Symbolic Comput. 2, 83-98 (1986).
6. Björck, G., Fröberg, R.: A faster way to count the solutions of unhomogeneous systems of algebraic equations, with applications to cyclic n-roots. J. Symbolic Comput. 12, 329-336 (1991).
7. Dai, Y., Kim, S., Kojima, M.: Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods. J. Comput. Appl. Math. 152, 83-97 (2003).
8. Drexler, F. J.: Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungs-systemen. Numer. Math. 29, 45-58 (1977).
9. 4). J. Pure Appl. Algebra 139, 61-88 (1999).
10. Garcia, C. B., Zangwill, W. I.: Determining all solutions to certain systems of nonlinear equations. Math. Operations Res. 4, 1-14 (1979).
11. Gao, T., Li, T. Y., Verschelde, J., Wu, M.: Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods. Appl. Math. Comput. 114, 233-247 (2000).
12. Huber, B., Sturmfels, B.: A polyhedral method for solving sparse polynomial systems. Math. Comput. 64, 1541-1555 (1995).
13. Huber, B., Verschelde, J.: Polyhedral end games for polynomial continuation. Numer. Algorithms 18, 91-108 (1998).
14. Kim, S., Kojima, M.: CMPSm: A continuation method for polynomial systems (Matlab version). In: A. M. Cohen, Xiao-Shan Gao, N. Takakayama (eds.) World Scientific: Singapore 2002.
15. Kim, S., Kojima, M.: CMPSc: A continuation method for polynomial systems (C + + version). B-378, Dept. of Math. and Comput. Sciences, Tokyo Inst. of Tech., April 2002.
16. Kojima, M.: his web site: http://www.is.titech.ac.jp/~kojima/polynomials/ .
17. Li, T. Y.: Solving polynomial systems. The Mathematical Intelligencer 9, 33-39 (1987).
18. Li, T. Y., Sauer, T., York, J. A.: The Cheater's homotopy: an efficient procedure for solving systems of polynomial equations. SIAM J. Numer. Anal. 26, 1241-1251 (1989).
19. Li, T. Y.: Solving polynomial systems by polyhedral homotopies. Taiwan J. Math. 3, 251-279 (1999).
20. Li, T. Y., Li, X.: Finding mixed cells in the mixed volume computation. Foundation Comput. Math. 1, 161-181 (2001).
21. Morgan, A.: Solving polynomial systems using continuation for engineering and scientific problems. Prentice-Hall 1987.
22. Morgan, A. P., Sommese, A. J.: Coefficient-parameter polynomial continuation. Appl. Math. Comput. 29, 123-160 (1989).
23. Noonberg, V. W.: A neural network modeled by an adaptive Lotka-Volterra system. SIAM J. Appl. Math. 49, 1779-1792 (1989).
24. Schrijver, A.: Theory of linear and integer programming. New York: Wiley 1986.
25. Takeda, A., Kojima, M., Fujisawa, K.: Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method. J. Operations Soc. Japan 45, 64-82 (2002).
26. Traverso, C.: The PoSSo test suite examples. Available at http://www.inria.fr/saga/POL.
27. Verschelde, J.: The database of polynomial systems is on his web site: http://www.math.uic.edu/~jan/.
28. Verschelde, J., Verlinden, P., Cools, R.: Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31, 915-930 (1994).
29. Verschelde, J.: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25, 251-276 (1999).
30. Watson, L. T., Billips, S. C., Morgan, A. P.: Algorithm 652: HOMPACK: a suite for codes for globally convergent homotopy algorithms. ACM Trans. Math. Softw. 13, 281-310 (1987).
31. Watson, L. T., Sosonkina, M., Melville, R. C., Morgan, A. P., Walker, H. F.: HOMPACK90: A suite of Fortran 90 codes for globally homotopy algorithms. ACM Trans. Math. Softw. 23, 514-549 (1997).