Principles for Testing Polynomial Zerofinding Programs
- 1 March 1975
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 1 (1), 26-34
- https://doi.org/10.1145/355626.355632
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s AlgorithmSIAM Journal on Numerical Analysis, 1974
- Practical Problems Arising in the Solution of Polynomial EquationsIMA Journal of Applied Mathematics, 1971
- A Three-Stage Algorithm for Real Polynomials Using Quadratic IterationSIAM Journal on Numerical Analysis, 1970
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's TheoremsJournal of the ACM, 1970
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iterationNumerische Mathematik, 1970
- A stopping criterion for polynomial root findingCommunications of the ACM, 1967
- An improvement to iterative methods of polynomial factorizationCommunications of the ACM, 1967