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/)
Keywords for this software
References in zbMATH (referenced in 203 articles , 1 standard article )
Showing results 201 to 203 of 203.
- Verschelde, Jan: Toric Newton method for polynomial homotopies (2000)
- Wise, Steven M.; Sommese, Andrew J.; Watson, Layne T.: Algorithm 801: POLSYS_PLP. A partitioned linear product homotopy code for solving polynomial systems of equations. (2000)
- Verschelde, Jan: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation (1999)