A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- 1 July 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (3) , 415-420
- https://doi.org/10.1145/322077.322084
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An Exact Method for Finding the Roots of a Complex PolynomialACM Transactions on Mathematical Software, 1976
- Principles for Testing Polynomial Zerofinding ProgramsACM Transactions on Mathematical Software, 1975
- Circular arithmetic and the determination of polynomial zerosNumerische Mathematik, 1971
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iterationNumerische Mathematik, 1970
- Finding zeros of a polynomial by the Q-D algorithmCommunications of the ACM, 1965
- A Machine Method for Solving Polynomial EquationsJournal of the ACM, 1961