Parallel homotopy algorithms to solve polynomial systems

  • Authors:

  • Anton Leykin;Jan Verschelde;Yan Zhuang

  • Affiliations:

  • Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL;Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL;Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL

  • Venue:
  • ICMS'06 Proceedings of the Second international conference on Mathematical Software
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Homotopy continuation methods to compute numerical approximations to all isolated solutions of a polynomial system are known as “embarrassingly parallel”, i.e.: because of their low communication overhead, these methods scale very well for a large number of processors. Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarrassing not to develop parallel implementations of polynomial homotopy continuation methods. This paper concerns the development of “parallel PHCpack”, a project which started a couple of years ago in collaboration with Yusong Wang, and which currently continues with Anton Leykin (parallel irreducible decomposition) and Yan Zhuang (parallel polyhedral homotopies). We report on our efforts to make PHCpack ready to solve large polynomial systems which arise in applications. 2000 Mathematics Subject Classification. Primary 65H10. Secondary 14Q99, 68W30.