Sciweavers

6 search results - page 1 / 2
» Parallel Implementation of the Polyhedral Homotopy Method
Sort
View
COMPUTING
2006
127views more  COMPUTING 2006»
13 years 4 months ago
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
T. Gunji, S. Kim, K. Fujisawa, M. Kojima
ICPPW
2006
IEEE
13 years 10 months ago
Parallel Implementation of the Polyhedral Homotopy Method
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
Jan Verschelde, Yan Zhuang
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
CAP
2010
12 years 11 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe
ICPPW
2005
IEEE
13 years 10 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde