Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
There is no “Uspensky’s method.”
Akritis A.  Symbolic and algebraic computation (, Waterloo, Ont., Canada, Jul 21-23, 1986)901986.Type:Proceedings
Date Reviewed: Sep 1 1988

The continued fraction methods for solving a polynomial equation consist essentially of transforming a polynomial by using x = a + 1/x′, (for instance, to isolate the roots by reducing the number of sign variations). Thus, in stages, a continued fraction expansion for a root emerges. The author strongly advocates the recognition of the priority of A. J. H. Vincent [1] over J. V. Uspensky [2], and he shows the computational and theoretical superiority of Vincent’s work, incidentally offering improvements of his own [3].

Reviewer:  Harvey Cohn Review #: CR112388
1) Vincent, A. J. H.Sur la résolution des équations numériques. J. Math. Pures Appl. 1 (1836), 341–372.
2) Uspensky, J. V.Theory of Equations. McGraw Hill, New York, 1948.
3) Akritas, A. G. An implementation of Vincent’s Theorem. Numer. Math. 36 (1980), 53–62.
Bookmark and Share
 
Analysis Of Algorithms (I.1.2 ... )
 
 
Computations On Polynomials (F.2.1 ... )
 
 
Iterative Methods (G.1.5 ... )
 
 
Polynomials, Methods For (G.1.5 ... )
 
 
Systems (K.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Analysis Of Algorithms": Date
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II
Averbuch A., Galil Z., Winograd S. Theoretical Computer Science 86(2): 143-203, 1991. Type: Article
Dec 1 1992
Parallel algorithms for algebraic problems
von zur Gathen J. (ed) SIAM Journal on Computing 13(4): 802-824, 1984. Type: Article
May 1 1985
Computing in transcendental extensions.
Norman A.   (,2000. Type: Proceedings
Feb 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy