Some examples for solving systems of algebraic equations by calculating groebner bases
Journal of Symbolic Computation
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
Journal of Symbolic Computation
A polyhedral method for solving sparse polynomial systems
Mathematics of Computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
A Rank-Revealing Method with Updating, Downdating, and Applications
SIAM Journal on Matrix Analysis and Applications
Algorithm 846: MixedVol: a software package for mixed-volume computation
ACM Transactions on Mathematical Software (TOMS)
Dynamic Enumeration of All Mixed Cells
Discrete & Computational Geometry
Parallel implementation of polyhedral homotopy methods
Parallel implementation of polyhedral homotopy methods
Polynomial homotopies on multicore workstations
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Computing curve intersection by homotopy methods
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
HOM4PS-2.0 is a software package in FORTRAN 90 which implements the polyhedral homotopy continuation method for solving polynomial systems. It leads in speed over the existing software packages in the same category by huge margins. This article details the description of the parallel version of HOM4PS-2.0, named HOM4PS-2.0para. Excellent scalability in the numerical results shows that the parallelization of the homotopy method always provides a great amount of extra computing resources to help solve polynomial systems of larger size which would be very difficult to deal with otherwise.