Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
Theory of linear and integer programming
Theory of linear and integer programming
Coefficient-parameter polynomial continuation
Applied Mathematics and Computation
A neural network modeled by an adaptive Lotka-Volterra system
SIAM Journal on Applied Mathematics
The cheater's homotopy: an efficient procedure for solving systems of polynomial equations
SIAM Journal on Numerical Analysis
Numerical continuation methods: an introduction
Numerical continuation methods: an introduction
Journal of Symbolic Computation
Homotopies exploiting Newton polytopes for solving sparse polynomial systems
SIAM Journal on Numerical Analysis
A polyhedral method for solving sparse polynomial systems
Mathematics of Computation
Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms
ACM Transactions on Mathematical Software (TOMS)
Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms
ACM Transactions on Mathematical Software (TOMS)
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Applied Mathematics and Computation
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
High Performance Grid and Cluster Computing for Some Optimization Problems
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Newton's method with deflation for isolated singularities of polynomial systems
Theoretical Computer Science
ACM Transactions on Mathematical Software (TOMS)
HOM4PS-2.0para: Parallelization of HOM4PS-2.0 for solving polynomial systems
Parallel Computing
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
International Journal of Computational Science and Engineering
Locating and characterizing the stationary points of the extended rosenbrock function
Evolutionary Computation
Chern numbers of smooth varieties via homotopy continuation and intersection theory
Journal of Symbolic Computation
Polynomial homotopy continuation with PHCpack
ACM Communications in Computer Algebra
Parallel homotopy algorithms to solve polynomial systems
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Hi-index | 0.01 |
PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedral-linear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations f(x)=0. The second module CMPSc traces the solution curves of the homotopy equations to compute all isolated solutions of f(x)=0. The third module Verify checks whether all isolated solutions of f(x)=0 have been approximated correctly. We describe numerical methods used in each module and the usage of the package. Numerical results to demonstrate the performance of PHoM include some large polynomial systems that have not been solved previously.