Parallel Homotopy Algorithms to Solve Polynomial Systems

DOI10.1007/11832225_22zbMath1230.65062OpenAlexW1537426722WikidataQ64388294 ScholiaQ64388294MaRDI QIDQ5747817

Yan Zhuang, Jan Verschelde, Anton Leykin

Publication date: 14 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11832225_22

zbMATH Keywords

parallel computationpath followingpolynomial systemsContinuation methodspolyhedral homotopieshigh performance continuationjumpstarting homotopieslinear-product systemssimplex system

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Computational aspects in algebraic geometry (14Q99)

Related Items

Galois groups of Schubert problems via homotopy computation

Uses Software

• PHCpack
• POLSYS_PLP
• PHoMpara
• PHoM