A homotopy for solving general polynomial systems that respects m-homogenous structures
Applied Mathematics and Computation
Computing all solutions to polynomial systems using homotopy continuation
Applied Mathematics and Computation
Finding all isolated solutions to polynomial systems using HOMPACK
ACM Transactions on Mathematical Software (TOMS)
A globally convergent parallel algorithm for zeros of polynomial systems
Non-Linear Analysis
Numerical continuation methods: an introduction
Numerical continuation methods: an introduction
Variable order Adams-Bashforth predictors with an error-stepsize control for continuation methods
SIAM Journal on Scientific and Statistical Computing
Journal of Symbolic Computation
LAPACK's user's guide
The GBQ-algorithm for constructing start systems of homotopies for polynomial systems
SIAM Journal on Numerical Analysis
Computing singular solutions to polynomial systems
Advances in Applied Mathematics
A product-decomposition bound for Bezout numbers
SIAM Journal on Numerical Analysis
Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms
ACM Transactions on Mathematical Software (TOMS)
Note on the end game in homotopy zero curve tracking
ACM Transactions on Mathematical Software (TOMS)
Complexity and real computation
Complexity and real computation
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)
ACM Transactions on Mathematical Software (TOMS)
A Method for Computing All Solutions to Systems of Polynomials Equations
ACM Transactions on Mathematical Software (TOMS)
The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations
IEEE Transactions on Parallel and Distributed Systems
Algorithm 846: MixedVol: a software package for mixed-volume computation
ACM Transactions on Mathematical Software (TOMS)
Polynomial homotopies on multicore workstations
Proceedings of the 4th International Workshop on Parallel and 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 |
Globally convergent, probability-one homotopy methods have proven to be very effective for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked and handling singular solutions have made probability-one homotopy methods even more practical. POLSYS_GLP consists of Fortran 95 modules for finding all isolated solutions of a complex coefficient polynomial system of equations. The package is intended to be used on a distributed memory multiprocessor in conjunction with HOMPACK90 (Algorithm 777), and makes extensive use of Fortran 95-derived data types and MPI to support a general linear product (GLP) polynomial system structure. GLP structure is intermediate between the partitioned linear product structure used by POLSYS_PLP (Algorithm 801) and the BKK-based structure used by PHCPACK. The code requires a GLP structure as input, and although finding the optimal GLP structure is a difficult combinatorial problem, generally physical or engineering intuition about a problem yields a very good GLP structure. POLSYS_GLP employs a sophisticated power series end game for handling singular solutions, and provides support for problem definition both at a high level and via hand-crafted code. Different GLP structures and their corresponding Bezout numbers can be systematically explored before committing to root finding.