.png){kind=icon}
Return
A ROBUST NUMERICAL PATH TRACKING ALGORITHM FOR POLYNOMIAL HOMOTOPY CONTINUATION
.png){kind=icon}
OA
AI
DOI：10.1137/19M1288036.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is robust in the sense that it is designed to prevent path jumping, and in many cases it can be used in (only) double precision arithmetic. It is based on an adaptive stepsize predictor that uses Pade techniques to detect local difficulties for function approximation and danger for path jumping. We show the potential of the new path tracking algorithm through several numerical examples and compare it with existing implementations.
Keywords:
homotopy continuation
Pade approximant
polynomial systems
a priori stepsize control
Fabry ratio theorem
power series
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more