Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers
From MaRDI portal
Publication:6335331
DOI10.1007/978-3-030-60026-6_33arXiv2002.09504MaRDI QIDQ6335331FDOQ6335331
J. Verschelde, Marc van Barel, Simon Telen
Publication date: 21 February 2020
Abstract: We consider the problem of tracking one solution path defined by a polynomial homotopy on a parallel shared memory computer. Our robust path tracker applies Newton's method on power series to locate the closest singular parameter value. On top of that, it computes singular values of the Hessians of the polynomials in the homotopy to estimate the distance to the nearest different path. Together, these estimates are used to compute an appropriate adaptive stepsize. For n-dimensional problems, the cost overhead of our robust path tracker is O(n), compared to the commonly used predictor-corrector methods. This cost overhead can be reduced by a multithreaded program on a parallel shared memory computer.
This page was built for publication: Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6335331)
