Computer algebra: symbolic and algebraic computation (2nd ed.)
Polynomial real root isolation using Descarte's rule of signs
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A remark on the proposed syllabus for an AMS short course on computer algebra
ACM SIGSAM Bulletin
Progress report on a system for general-purpose parallel symbolic algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Efficient isolation of polynomial's real roots
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Univariate polynomial real root isolation: continued fractions revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Complexity of real root isolation using continued fractions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper an attempt is made to correct the misconception of several authors [1] that there exists a method by Upensky (based on Vincent's theorem) for the isolation of the real roots of a polynomial equation with rational coefficients. Despite Uspensky's claim, in the preface of his book [2], that he invented this method, we show that what Upensky actually did was to take Vincent's method and double its computing time. Upensky must not have understood Vincent's method probably because he was not aware of Budan's theorem [3]. In view of the above, it is historically incorrect to attribute Vincent's method to Upensky.