References
- Alberth , O. 1973 . Iteration methods for finding all zeros of a polynomial simultaneously . Math. Computation , 27 : 339 – 344 .
- Alefeld , G. and Herzberger , J. 1974 . Einführung in die Intervallrechnung Zürich
- Börsch-Supan , W. 1963 . A posteriori error bounds for the zeros of polynomials . Numer. Math , 5 : 380 – 398 .
- Dočev , K. 1962 . Vidoizmenen metod na Njuton za ednovremenno priblizitelno presmjatane na vsički koreni na dadeno algebrično uravnenie . Fiz.-Mat. Spis. B'lgar. Akad. Nauk , 5 : 136 – 139 .
- Dočev , K. and Byrnev , P. 1964 . Certain modifications of Newton's method for the approximate solution of algebraic equations . Ž. Vyčisl. Mat. i Fiz. , 4 : 915 – 920 .
- Ehrlich , L.W. 1967 . A modified Newton method for polynomials . Comm. ACM , 10 : 107 – 108 .
- Farmer , M.R. and Loizou , G. 1975 . A class of iteration functions for improving simultaneously approximations to the zeros of a polynomial . BIT , 15 : 250 – 258 .
- Gargantini , I. 1974 . Parallel algorithms for the determination of polynomial zeros . Proc. 3rd Manitoba Conf Numer. Math . 1974 . pp. 195 – 211 . Winnipeg : Princeton University Press .
- Gargantini , I. 1978 . Further applications of circular arithmetic: Schroeder-like algorithms with error bounds for finding zeros of polynomials . SIAM J. Numer. Anal , 3 : 497 – 510 .
- Gargantini , I. and Henrici , P. 1972 . Circular arithmetic and the determination of polynomial Zeros . Numer. Math , 18 : 305 – 320 .
- Glatz , G. 1975 . “ Newton-Algorithmen zur Bestimmung von Polynom wurzeln unter Verwendung komplexer Kreisarithmetik ” . In Interval Mathematics , Edited by: Nickel , K. 205 – 214 . Berlin : Springer-Verlag .
- Hansen , E. and Patrick , M. 1977 . A family of root finding methods . Numer. Math , 27 : 257 – 269 .
- Henrici , P. 1971 . Circular arithmetic and the determination of polynomial zeros . Springer Lecture Notes , 228 : 86 – 92 .
- Henrici , P. 1974 . Applied and Computational Complex Analysis Vol. I , New York
- Kerner , I.O. 1966 . Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen . Numer. Math , 8 : 290 – 294 .
- Maehly , H.J. 1954 . Zur iterativen Auflösung algebraischer Gleichungen . Z. angew. Math. Phys , 5 : 260 – 263 .
- Moore , R.E. 1979 . “ SIAM Studies in Applied Mathematics ” . In Methods and Applications of Interval Analysis Philadelphia
- Nourein , A.W. 1975 . An iteration formula for the simultaneous determination of the zeroes of a polynomial . J. Comput. Appl. Math , 4 : 251 – 254 .
- Nourein , A.W. 1977 . An improvement on two iteration methods for simultaneous determination of the zeroes of a polynomial . Int. J. Comput. Math , 3 : 241 – 252 .
- Nourein , A.W. 1977 . An improvement of Nourein's method for the simultaneous determination of the zeroes of a polynomial . J. Comput. Appl. Math , 2 : 109 – 112 .
- Petković , M.S. 1979 . Some interval methods of the second order for the simultaneous approximation of polynomial roots . Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz , 634 : 74 – 81 . 677
- Petković , M.S. 1981 . On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic . Computing , 27 : 37 – 55 .
- Prešić , S.B. 1966 . Un procédé itératif pour la factorisation des polynomes . C.R. Acad. Sei. Paris , 262 : 862 – 863 .
- Weierstrass , K. 1903 . “ Neuer Beweis des Satzes, dass jede Ganze Rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus Linearen Functionen darstelben Veränderlichen ” . In Ges. Werke , Vol. 3 , 251 – 269 . Springer-Verlag .