Cem Yuksel
ABSTRACT
We present a computationally-efficient and numerically-robust method for finding real roots of cubic and higher-order polynomials. It begins with determining the intervals where a given polynomial is monotonic. Then, the existence of a real root within each interval can be quickly identified. If one exists, we find the root using a stable variant of Newton iterations, providing fast and guaranteed convergence and satisfying the given error bound.
Supplemental Material
- Gaël Guennebaud, Benoît Jacob, 2010. Eigen v3. http://eigen.tuxfamily.org.Google Scholar
- M. A. Jenkins and J. F. Traub. 1970. A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration. SIAM J. Numer. Anal. 7, 4 (1970), 545–566.Google ScholarDigital Library
- Cem Yuksel. 2022. Polynomial Roots. http://www.cemyuksel.com/?x=polynomials.Google Scholar
Recommendations
Higher-order matching polynomials and d-orthogonality
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order ...
Strong factorization property of Macdonald polynomials and higher-order Macdonald's positivity conjecture
We prove a strong factorization property of interpolation Macdonald polynomials when q tends to 1. As a consequence, we show that Macdonald polynomials have a strong factorization property when q tends to 1, which was posed as an open question in our ...
Higher order hypergeometric Lauricella function and zero asymptotics of orthogonal polynomials
The asymptotic contracted measure of zeros of a large class of orthogonal polynomials is explicitly given in the form of a Lauricella function. The polynomials are defined by means of a three-term recurrence relation whose coefficients may be unbounded ...
Comments