TL;DR
This paper develops and implements a numerical approach called the splitting circle method for accurately finding roots of polynomials with fixed precision, providing bounds and practical algorithms.
Contribution
It introduces a new implementation of the splitting circle method with derived numerical bounds for root finding under fixed precision constraints.
Findings
Effective bounds for the splitting circle method
Practical implementation for fixed precision root finding
Improved accuracy in polynomial root computations
Abstract
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Polynomial and algebraic computation · Numerical Methods and Algorithms