arXiv · 2512.01355
A priori bounds for certified Krawczyk homotopy tracking
Abstract
We establish the first complexity analysis for Krawczyk-based certified homotopy tracking. It consists of explicit a priori stepsize bounds ensuring the success of the Krawczyk test, and an iteration count bound proportional to the weighted length of the solution path. Our a priori bounds reduce the overhead of interval arithmetic, resulting in fewer iterations than previous methods. Experiments using a proof-of-concept implementation validate the results.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kisun Lee. 2025-12-01. A priori bounds for certified Krawczyk homotopy tracking. https://arxiv.org/abs/2512.01355
Cite the original work for its findings. Save a collection to share your selection of sources.