Infallible Calculation of Polynomial Zeros to Specified Precision
- 1 January 1977
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Polynomial real root isolation using Descarte's rule of signsPublished by Association for Computing Machinery (ACM) ,1976
- Algorithms for Gaussian integer arithmeticPublished by Association for Computing Machinery (ACM) ,1976
- Polynomial real root isolation by differentiationPublished by Association for Computing Machinery (ACM) ,1976
- The minimum root separation of a polynomialMathematics of Computation, 1974
- Computer Algebra of Polynomials and Rational FunctionsThe American Mathematical Monthly, 1973
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Algorithms for exact polynomial root calculationACM SIGSAM Bulletin, 1970
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967