PHCpack

Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. Polynomial systems occur in a wide variety of application domains. Homotopy continuation methods are reliable and powerful methods to compute numerically approximations to all isolated complex solutions. During the last decade considerable progress has been accomplished on exploiting structure in a polynomial system, in particular its sparsity. In this paper the structure and design of the software package PHC is described. The main program operates in several modes, is menu-driven and file-oriented. This package features a great variety of root-counting methods among its tools. The outline of one black-box solver is sketched and a report is given on its performance on a large database of test problems. The software has been developed on four different machine architectures. Its portability is ensured by the gnu-ada compiler. (Source: http://dl.acm.org/)


References in zbMATH (referenced in 203 articles , 1 standard article )

Showing results 181 to 200 of 203.
Sorted by year (citations)

previous 1 2 3 ... 8 9 10 11 next

  1. Hazaveh, K.; Jeffrey, D. J.; Reid, G. J.; Watt, S. M.; Wittkopf, A. D.: An exploration of homotopy solving in Maple (2003)
  2. Henrion, Didier; Lasserre, Jean-Bernard: Solving global optimization problems over polynomials with GloptiPoly 2.1 (2003)
  3. Hochstenbach, Michiel E.; van der Vorst, Henk A.: Alternatives to the Rayleigh quotient for the quadratic eigenvalue problem (2003)
  4. Sommese, Andrew J.; Verschelde, Jan; Wampler, Charles W.: Numerical irreducible decomposition (2003)
  5. Haas, Bertrand: A simple counterexample to Kouchnirenko’s conjecture (2002)
  6. Schreiber, H.; Meer, K.; Schmitt, B. J.: Dimensional synthesis of planar Stephenson mechanisms for motion generation using circlepoint search and homotopy methods (2002)
  7. Sommese, Andrew J.; Verschelde, Jan; Wampler, Charles W.: A method for tracking singular paths with application to the numerical irreducible decomposition (2002)
  8. Sturmfels, Bernd: Solving systems of polynomial equations (2002)
  9. Takeda, Akiko; Kojima, Masakazu; Fujisawa, Katsuki: Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method (2002)
  10. Theobald, Thorsten: An enumerative geometry framework for algorithmic line problems in (\mathbbR^3) (2002)
  11. Ceberio, Martine; Granvilliers, Laurent: Solving nonlinear systems by constraint inversion and interval arithmetic (2001)
  12. Georg, Kurt: Improving the efficiency of exclusion algorithms (2001)
  13. Granvilliers, Laurent: On the combination of interval constraint solvers (2001)
  14. Li, T. Y.; Li, Xing: Finding mixed cells in the mixed volume computation (2001)
  15. Maekawa, Masahide; Noro, Masayuki; Takayama, Nobuki; Tamura, Yasushi; Ohara, Katsuyoshi: The design and implementation of OpenXM-RFC 100 and 101 (2001)
  16. Sommese, Andrew J.; Verschelde, Jan; Wampler, Charles W.: Numerical decomposition of the solution sets of polynomial systems into irreducible components (2001)
  17. Gao, Tangan; Li, T. Y.: Mixed volume computation via linear programming (2000)
  18. Huber, Birkett; Verschelde, Jan: Pieri homotopies for problems in enumerative geometry applied to pole placement in linear systems control (2000)
  19. Sommese, Andrew J.; Verschelde, Jan: Numerical homotopies to compute generic points on positive dimensional algebraic sets (2000)
  20. Sottile, Frank: Real Schubert calculus: polynomial systems and a conjecture of Shapiro and Shapiro (2000)

previous 1 2 3 ... 8 9 10 11 next