A simple but exact and efficient algorithm for complex root isolation
Chee Keng Yap, Michael Sagraloff · International Symposium on Symbolic and Algebraic Computation · 2011
We present a new exact subdivision algorithm CEVAL for isolating the complex roots of a square-free polynomial in any given box. It is a generalization of a previous real root isolation algorithm called EVAL. Under suitable conditions, our approach is applicable for general analytic functions. CEVAL is based on the simple Bolzano Principle and is easy to implement exactly. Preliminary experiments have shown its competitiveness.
Cited by 57 works. doi:10.1145/1993886.1993938
Authors
References
- The fundamental theorem of algebra and complexity theory
- Cambridge University Press
- Polynomial real root isolation using Descarte's rule of signs
- Real Zeros of Polynomials
- Interval analysis for computer graphics
- Solving a Polynomial Equation: Some History and Recent Progress
- Fundamental Problems of Algorithmic Algebra
- A bibliography on roots of polynomials
- Efficient isolation of polynomial's real roots
- An Exact Method for Finding the Roots of a Complex Polynomial