Spiral Endgames for Computing Singular Endpoints of Homotopy Paths
Abstract
We develop a new endgame for numerically computing singular solutions to complex analytic systems by means of a homotopy path whose endpoint is the solution to be computed. When the solution is singular, prediction-correction path tracking may fail at the endpoint. Instead of tracking the path all the way to its end, endgames sample nonsingular points on the incoming path and approximate the endpoint by interpolating the samples with a truncated Puiseux series. By collecting sample points along a logarithmic spiral in the complex plane, the proposed spiral endgame balances between the superior numerical conditioning of a circular sample (known as the Cauchy endgame) and the update efficiency of a linear sample (known as the power series endgame), these being tied together as two extremes of the new approach. The numerical conditioning of the methods are analyzed and compared, and computational examples illustrate the effectiveness of the new spiral sampling method compared with the circular sampling method of the Cauchy endgame.
Related
- Component-wise accurate fixed point iterations for computing the square root of a singular M-matrix
- A Structure-Preserving LOBPCG Method for Computing Several of the Largest Generalized Singular Triplets
- Asymptotic expansions for random walks conditioned to stay positive with arbitrary endpoints
- On optimal endpoints for integral kernel operators
- The endpoints p-=1 and p+=∞ for the maximal operator on Lp(·) over spaces of homogeneous type
BibTeX
@misc{cobian2026spiral,
title = {{Spiral Endgames for Computing Singular Endpoints of Homotopy Paths}},
author = {Emma R. Cobian and Jonathan D. Hauenstein and Charles W. Wampler},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.26370},
eprint = {2609.26370},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.26370},
}
RIS
TY - UNPB
TI - Spiral Endgames for Computing Singular Endpoints of Homotopy Paths
AU - Emma R. Cobian
AU - Jonathan D. Hauenstein
AU - Charles W. Wampler
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.26370
UR - https://arxiv.org/abs/2609.26370
AB - We develop a new endgame for numerically computing singular solutions to complex analytic systems by means of a homotopy path whose endpoint is the solution to be computed. When the solution is singular, prediction-correction path tracking may fail at the endpoint. Instead of tracking the path all the way to its end, endgames sample nonsingular points on the incoming path and approximate the endpoint by interpolating the samples with a truncated Puiseux series. By collecting sample points along a logarithmic spiral in the complex plane, the proposed spiral endgame balances between the superior numerical conditioning of a circular sample (known as the Cauchy endgame) and the update efficiency of a linear sample (known as the power series endgame), these being tied together as two extremes of the new approach. The numerical conditioning of the methods are analyzed and compared, and computational examples illustrate the effectiveness of the new spiral sampling method compared with the circular sampling method of the Cauchy endgame.
ER -