Abstract
In this note the results of A. Nourein [8] are related to the existing literature, and a more efficient computational procedure than the one given therein is presented.
Similar content being viewed by others
References
J. Boško,Remark on an Iterative Formula, Mat. Vesnik 9 (24) (1972), 370–372.
M. R. Farmer and G. Loizou,A Class of Iteration Functions for Improving, Simultaneously, Approximations to the Zeros of a Polynomial, BIT 15 (1975), 250–258.
W. B. Gragg,The Padé Table and its Relation to Certain Algorithms of Numerical Analysis, SIAM Review 14 (1972), 1–62.
H. J. Hamilton,Roots of Equations by Functional Iteration, Duke Math. J. 13 (1946), 113–121.
H. J. Hamilton,A Type of Variation on Newton's Method, Amer. Math. Monthly 57 (1950), 517–522.
I. Kiss, Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens, Z. Angew. Math. Mech. 34 (1954), 68–69.
G. Merz, Padésche Näherungsbrüche und Iterationsverfahren höheren Ordnung, Computing 3 (1968), 165–183.
A. M. Nourein,Root Determination by Use of Padé Approximants, BIT 16 (1976), 291–297.
L. Tessler and L. Eisenberg,A New Algorithm for Facorting Polynomials, Proc. IEEE 60 (1972), 737–738.
Author information
Authors and Affiliations
Additional information
Work supported in part by the NFWO-Belgium under grant number 2.0021.75.
Rights and permissions
About this article
Cite this article
Claessens, G., Loizou, G. & Wuytack, L. Comments on a root finding method using Padé approximation. BIT 17, 360–361 (1977). https://doi.org/10.1007/BF01932157
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01932157