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/)
Keywords for this software
References in zbMATH (referenced in 131 articles , 1 standard article )
Showing results 1 to 20 of 131.
Sorted by year (- Bates, Daniel J.; Newell, Andrew J.; Niemerg, Matthew: BertiniLab: a MATLAB interface for solving systems of polynomial equations (2016)
- Chen, Liping; Han, Lixing; Zhou, Liangmin: Computing tensor eigenvalues via homotopy methods (2016)
- De Loera, Jesús A.; Petrović, Sonja; Stasi, Despina: Random sampling in computational algebra: Helly numbers and violator spaces (2016)
- Gross, Elizabeth; Harrington, Heather A.; Rosen, Zvi; Sturmfels, Bernd: Algebraic systems biology: a case study for the wnt pathway (2016)
- Hauenstein, Jonathan D.; Liddell, Alan C.: Certified predictor-corrector tracking for Newton homotopies (2016)
- Helmer, Martin: Algorithms to compute the topological Euler characteristic, Chern-Schwartz-MacPherson class and Segre class of projective varieties (2016)
- Jiao, Libin; Dong, Bo; Zhang, Jintao; Yu, Bo: Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling (2016)
- Plestenjak, Bor; Hochstenbach, Michiel E.: Roots of bivariate polynomial systems via determinantal representations (2016)
- Bliss, Nathan; Sommars, Jeff; Verschelde, Jan; Yu, Xiangcheng: Solving polynomial systems in the cloud with polynomial homotopy continuation (2015)
- Feng, Yong; Wu, Wenyuan; Zhang, Jingzhong; Chen, Jingwei: Exact bivariate polynomial factorization over $\mathbb Q$ by approximation of roots (2015)
- Hochstenbach, Michiel E.; Muhič, Andrej; Plestenjak, Bor: Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems (2015)
- Rodriguez, Jose Israel: Combinatorial excess intersection (2015)
- Bates, Daniel J.; Davis, Brent; Eklund, David; Hanson, Eric; Peterson, Chris: Perturbed homotopies for finding all isolated solutions of polynomial systems (2014)
- Bates, Daniel J.; Niemerg, Matthew: Using monodromy to avoid high precision in homotopy continuation (2014)
- Batselier, Kim; Dreesen, Philippe; De Moor, Bart: On the null spaces of the Macaulay matrix (2014)
- Batselier, Kim; Dreesen, Philippe; De Moor, Bart: A fast recursive orthogonalization scheme for the Macaulay matrix (2014)
- Chen, Tianran; Lee, Tsung-Lin; Li, Tien-Yien: Hom4ps-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods (2014)
- Chen, Tianran; Li, Tien-Yien; Wang, Xiaoshen: Theoretical aspects of mixed volume computation via mixed subdivision (2014)
- Galeani, Sergio; Henrion, Didier; Jacquemard, Alain; Zaccarian, Luca: Design of Marx generators as a structured eigenvalue assignment (2014)
- Luo, Zhongxuan; Feng, Erbao; Zhang, Jiejin: A numerical realization of the conditions of Max Nöther’s residual intersection theorem (2014)