George E. Collins
- 1.G. E. Collins. infallible calculation of polynomial zeros to specified precision. Mathemattcal Soft. ware, Academic Press, New York, pages 35-68, 1977.Google Scholar
- 2.Jeremy R. Johnson. Algorithms for polynomial real root isolation. Technical Research Report OSU- CISRC-8/91-TR21, The Ohio State University, 2036 Neil Avenue Mall, Columbus, Ohio 43210, Phone: 614-292-5813, 1991.Google Scholar
- 3.D. It. Lehmer. A machine method for solving polynomial equations, j.A.C.M., 8(2):151-162, April 1961. Google ScholarDigital Library
- 4.Morris Uarden. The geometry of the zeros of a polynomial zn a complex vamable. American Mathematical Society, New York, 1949.Google Scholar
- 5.J. R. Pinkert. Algebraic algomthms for computing the complex zeros of Gauss~an polynomzals. PhD thesis, University of Wisconsin, 1973. Google ScholarDigital Library
- 6.J. R. Pinkert. An exact method for finding the complex roots of a complex polynomial. Technical Report CS-75-4, University of Tennessee, Computer Science Department, 1975. Google ScholarDigital Library
- 7.james R. Pinkert. An exact method for finding the roots of a complex polynomial. ACM Transactions on Mathematical Software, 2(4):351-363, December 1976. Google ScholarDigital Library
- 8.Herbert S. Wilf. A global bisection algorithm for computing the zeros of polynomials in the complex plane. J.A.C.M., 25(3):415-420, July 1978. Google ScholarDigital Library
Index Terms
- An efficient algorithm for infallible polynomial complex root isolation
Recommendations
A simple but exact and efficient algorithm for complex root isolation
ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computationWe 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 ...
Root isolation of zero-dimensional polynomial systems with linear univariate representation
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the complex roots of the polynomial system are represented as linear combinations of the roots of several univariate ...
Comments