Skip Navigation

The Computer Journal 1975 18(3):258-264; doi:10.1093/comjnl/18.3.258
© 1975 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (14)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Grant, J. A.
Right arrow Articles by Hitchins, G. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Two algorithms for the solution of polynomial equations to limiting machine precision

J. A. Grant1 * and G. D. Hitchins2 §

1 Department of Mathematics, University of Bradford, Bradford, UK, 2 Computing Centre, University College, Cardiff, UK

Two algorithms are presented for the solution of polynomial equations, one for real coefficients, the other for complex coefficients. The theoretical development of the method used is briefly reviewed, together with a fuller account of its practical implementation.

Received August 1973.

* Department of Mathematics, University of Bradford, Bradford BD7 1DP.

§ Centre for Computer Studies, University Leeds (now at the Computing Centre, University College, Cardiff).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.