A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial-Reference-Cited by-同舟云学术

A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial

Published:1975-09 Issue:3 Volume:15 Page:250-258
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Farmer M. R.,Loizou G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01933657.pdf

Reference18 articles.

1. G. Alefeld and J. Herzberger,On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots, SIAM J. Numer. Anal. 11 (1974), 237–243.

2. W. Börsch-Supan,A Posteriori Error Bounds for the Zeros of Polynomials, Numer. Math. 5 (1963), 380–398.

3. K. Dochev and P. Byrnev,Certain Modifications of Newton's Method for the Approximate Solution of Algebraic Equations, Ž. Vyčisl. Mat. i Mat. Fiz. 4 (1964), 915–920.

4. E. Durand,Solutions Numériques des Équations Algébriques. Tome I, Masson, Paris (1960).

5. L. W. Ehrlich,A Modified Newton Method for Polynomials, Comm. ACM 10 (1967), 107–108.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros;Journal of Computational and Applied Mathematics;2020-04

2. On the rediscovery of Halley’s iterative method for computing the zero of an analytic function;Journal of Computational and Applied Mathematics;2018-06

3. Iteration Functions re-visited;Journal of Computational and Applied Mathematics;2017-02

4. Methods Involving Second or Higher Derivatives;Studies in Computational Mathematics;2013

5. The improved Farmer–Loizou method for finding polynomial zeros;International Journal of Computer Mathematics;2012-03