Parallel implementation of the polyhedral homotopy method
Parallel implementation of the polyhedral homotopy method
复制标题
多面体同伦法的并行实现
DOI:
10.1109/icppw.2006.61
复制
发表时间:
2006
期刊:
影响因子:
--
通讯作者:
Yan Zhuang
中科院分区:
文献类型:
--
作者:
J. Verschelde;Yan Zhuang
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 polynomial systems, polyhedral methods give efficient homotopy algorithms. The polyhedral homotopy methods run in three stages: (1) compute the mixed volume; (2) solve a random coefficient start system; (3) track solution paths to solve the target system. This paper is about how to parallelize the second stage in PHCpack. We use a static workload distribution algorithm and achieve a good speedup on the cyclic n-roots benchmark systems. Dynamic workload balancing leads to reduced wall times on large polynomial systems which arise in mechanism design