Skip Navigation

The Computer Journal 1968 11(1):87-90; doi:10.1093/comjnl/11.1.87
© 1968 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 Garside, G. R.
Right arrow Articles by Mack, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A new method for solving polynomial equations

G. R. Garside, P. Jarratt and C. Mack *

Mathematics Department, University of Bradford, Bradford, UK

An iterative method for finding the zeros of a polynomial f(z) is given, based on approximating f(z)/f'(z) by a bilinear form. The method has high order convergence for both simple and repeated zeros (whatever the multiplicity) and takes very few iterations (average < 15) per zeros however ‘difficult’ the polynomial.

First received September 1967. revised form November 1967.

* Mathematics Department, University of Bradford, Bradford, 7.


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.