G. Alefeld and J. Herzberger, Introduction to Interval Computations (Academic Press, New York, 1983) 67--119.
G. Alefeld, Stets konvergente Verfahren höherer Ordnung zur Berechnung von reellen Nullstellen, Computing 13 (1974) 55--65.
G. Alefeld and F. Potra, A new class of interval methods with higher order of convergence, Computing 42 (1989) 69--80.
G. Alefeld, On the convergence of Halley's method, Amer. Math. Monthly 88 (1981) 530--536.
M. Altman, Iterative methods of higher order, Bull. Acad. Pol. Sci. Ser. Sci. Math. Astr. Phys. 9 (1961) 63--68.
F.K. Arslanov and R.R. Tagirov, Optimization of the convergence of a modification of Newton's method with respect to the order of the speed of convergence, J. Soviet Math. 43 (1988) 2468--2469.
K. Atkinson, An Introduction to Numerical Analysis (Wiley, New York, 1978) 39--106.
M. Balfour and A.J. McTernan, The Numerical Solution of Equations (Heinemann, London, 1st ed., 1967).
E.H. Bareiss, The numerical solution of polynomial equations and the resultant procedures, in: A. Ralston and H.S. Wilf, Eds., Mathematical Methods for Digital Computers, Vol. 2 (Wiley, New York, 1967) 185--214.
E.H. Bateman, Solution of algebraic and transcendental equations by iteration, Math. Gaz. 37 (1953) 96--101.
H. Bateman, Halley's method of solving algebraic and transcendental equations, Amer. Math. Monthly 45 (1938) 11--17.
F. Bauhuber, Direkte Verfahren zur Berechnung zur Nullstellen von Polynomen, Computing 5 (1970) 97--118.
I.S. Berezin and N.P. Zhidkov, Computing Methods, Vol. 2 (Pergamon Press, Oxford, 1965) Chapter 7.
L. Berg, Stabile Iterationsverfahren beliebiger Ordnung zur Berechnung von Wurzeln, Z. Angew. Math. Mech. 61 (1981) 396--399.
W.G. Bickley, An extension of Newton's formula for approximating to the roots of equations, Math. Gaz. 26 (1942) 102--104.
D.R. Blaskett and H. Schwertfeger, A formula for the solution of an arbitrary analytic equation, Quart. Appl. Math. 3 (1945) 266--268.
J. Bosko, Remark on an iterative formula, Mat. Vesnik 9 (24) (1972) 370--372.
E. Bodewig, Konvergenztypen und das Verhalten von Approximationen in der Nähe einer mehrfachen Wurzel einer Gleichung, Z. Angew. Math. Mech. 29 (1949) 44--51.
E. Bodewig, Über das Eulersche Verfahren zur Auflösung numerischer Gleichungen, Comment. Math. Helv. 8 (1935) 1--4.
E. Bodewig, On types of convergence and on the behaviour of approximations in the neighbourhood of a multiple root of an equation, Quart. Appl. Math. 7 (1949) 325--333.
E. Bodewig, Sur la méthode de Laguerre, pour l'approximation des racines de certaines équations algébriques et sur la critique d'Hermite, Nederl. Akad. Wetensch. Proc. 49 (1946) 911--921; also: Indag. Math. 8 (1946) 570--580.
L.C. Botten, M.S. Craig and R.C. McPhedran, Complex zeros of analytic functions, Comput. Phys. Comm. 29 (1983) 245--259.
R.P. Brent, Some high-order zero-finding methods using almost orthogonal polynomials, J. Austral. Math. Soc. Ser. B 1 (1975) 1--29.
R.P. Brent, A class of optimal order zero-finding methods using derivative evaluations, in: J.F. Traub, Ed., Analytic Computational Complexity (Academic Press, New York, 1976) 59--73.
S. Breuer and G. Zwas, Polynomial iterations for root extraction, Comp. Educ. 12 (1988) 289--300.
S. Breuer and G. Zwas, Rectified approximations for the solution of nonlinear equations, J. Comput. Appl. Math. 11 (2) (1984) 251--258.
G.H. Brown, On Halley's variation of Newton's method, Amer. Math. Monthly 84 (1977) 726--727.
J.-C. Yakoubsohn, Sur un procédé de construction d'algorithmes de calcul approché des racines d'une équation du type f(x)=0, C.R. Acad. Sci. Paris 308 (1989) 433--436.
V. Casulli and D. Trigiante, Multipoint iterative parallel methods for solving equations, Calcolo 15 (1978) 147--160.
V. Casulli and D. Trigiante, The convergence order for iterative multipoint procedures, Calcolo 14 (1977) 25--44.
A. Cauchy, Sur la résolution des équations numériques et sur la théorie d'élimination, in: Oeuvres Complètes Sér. 2 9 (Gauthier-Villars, Paris, 1891) 87--161.
A. Cauchy, Sur la determination approximative des racines d'une équation algébrique ou transcendante, in: Oeuvres Complètes Sér. 2 4 (Gauthier-Villars, Paris, 1899) 573--609.
D. Chen, Standard Kantorovich theorem of the Chebyshev method on complex plane, Internat. J. Comput. Math. 42 (1992) 67--70.
G. Claessens, G. Loizou and L. Wuytack, Comments on a root finding method using Padé approximants, BIT 17 (1977) 360--361.
L. Collatz, Funktionanalysis und Numerische Mathematik (Springer, Berlin, 1964).
S.A. Corey, A method of solving numerical equations, Amer. Math. Monthly 21 (1914) 290--292.
C.L. Critchfield and J. Beek Jr, A method for finding the roots of the equation f(x)=0 where f is analytic, J. Res. Nat. Bur. Standards 14 (1935) 595--600.
H.B. Curry, Note on iterations with convergence of higher degree, Quart. Appl. Math. 9 (1951) 204--205.
J.H. Curry, On zero finding methods of higher order from data at one point, J. Complexity 5 (1989) 219--237.
A. Cuyt, in: A. Cuyt and L. Wuytack, Eds., Nonlinear Methods in Numerical Analysis, North-Holland Math. Stud. 136, Stud. Comput. Math. 1 (North-Holland, Amsterdam, 1987) 220--237.
B. Döring, Einige Sätze über das Verfahren der tangierenden Hyperbeln in Banach-Räumen, Apl. Mat. 15 (1970) 418--464.
M. Davies and B. Dawson, Globally convergent monotonic suppression techniques for automatic root finders in vibration analysis, Internat. J. Numer. Methods Engrg. 23 (1986) 25--34.
M. Davies and B. Dawson, An automatic search procedure for finding real zeros, Numer. Math. 31 (1978--1979) 299--312.
M. Davies and B. Dawson, On the global convergence of Halley's iteration formula, Numer. Math. 24 (1975) 133--135.
M. Davies and B. Dawson, The iterative solution of two-point linear differential eigenvalue problems II, Quart. J. Mech. Appl. Math. 27 (1974) 17--26.
M. Davies and B. Dawson, The incrementation parameter in square root iteration, J. Inst. Math. Appl. 17 (1975) 219--223.
B. Dawson and M. Davies, An accelerated automatic root search algorithm for iterative methods in vibration analysis, Internat. J. Numer. Methods Engrg. 12 (1978) 809--820.
B. Dawson and M. Davies, An extended matrix transfer method with an automatic root search capability, Internat. J. Numer. Methods Engrg. 10 (1976) 67--76.
T.J. Dekker, Newton--Laguerre iteration, in: Colloq. Internat. CNRS No. 165, Programmation en Mathématiques Numériques (1968) 189--200.
L. Derwidué, Introduction à l'algèbre supérieure et au calcul numérique algébrique, Masson et Cie, Paris (1957).
G. Di Lena and D. Trigante, Metodo di Euler e ricerva delle radici di una equazione, Calcolo 13 (1976) 377--396; Calcolo 14 (1977) 121--131.
G. Di Lena, A fixed-point theorem intended for the calculation of real zeros of a function, Calcolo 17 (1980) 31--40.
G. Di Lena and R.I. Peluso, Una variazione del metodo di Halley, Calcolo 14 (3) (1977) 195--204.
G. Di Lena, Un algoritmo computer oriented convergente in grande a zeri reali di una funzione, Quaderni IAC Ser. 3 38 (1977) 1--20.
C. Domb, On iterative solutions of algebraic equations, Proc. Cambridge Philos. Soc. 45 (1949) 237--240.
I.E. Durand, Solutions Numérique des Équations Algébriques. Tome I: Équations du Type F(x)=0; Racines d'une Polynôme (Masson, Paris, 1960) 279--281.
H. Ehrmann, Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung, Arch. Rational Mech. Anal. 4 (1959) 65--88.
H. Ehrmann, Zur Konstruktion and Durchführung von Iterationsverfahren bestimmter Ordnung, Z. Angew. Math. Mech. 39 (1959) 364--365.
M.R. Farmer and G. Loizou, An algorithm for the computation of zeros of a special class of entire functions, J. Comput. Appl. Math. 12--13 (1985) 433--445.
A. Feldstein and R.M. Firestone, A study of Ostrowski efficiency for composite iteration algorithms, in: Proc. 1969 ACM Nat. Conf. (Assoc. Comput. Machinery, New York, 1969) 147--155.
D.A. Field, Convergence rates for Padé-based iterative solution of equations, J. Comput. Appl. Math. 32 (1990) 69--75.
L.V. Foster, Generalizations of Laguerre's method: higher order methods, SIAM J. Numer. Anal. 18 (1981) 1004--1018.
J.S. Frame, A variation of Newton's method, Amer. Math. Monthly 51 (1944) 36--38.
J.S. Frame, The solution of equations by continued fractions, Amer. Math. Monthly 60 (1953) 293--305.
J.S. Frame, Remarks on a variation of Newton's method, Amer. Math. Monthly 52 (1945) 212--214.
E. Frank, On the calculation of roots of equations, J. Math. and Phys. 34 (1955) 187--197.
H. Górecki and A.B. Turowicz, Sur la résolution des équations algébriques par la méthode de Euler, Ann. Polon. Math. 12 (1962) 185--190.
L. Galeone, Generalizzazione del metodi di Laguerre, Calcolo 14 (1977) 121--131.
L. Galeone, Un metodo iterativo non stazionario per la risoluzione di equazioni algebriche, Calcolo 15 (1978) 289--298.
W. Gander, On Halley's iteration method, Amer. Math. Monthly 92 (1985) 131--134.
I. Gargantini, Comparing parallel Newton's method with parallel Laguerre's method, Comput. Math. Appl. 2 (1976) 201--206.
I. Gargantini, Parallel Laguerre iterations: the complex case, Numer. Math. 26 (1976) 317--323.
I. Gargantini, The numerical stability of simultaneous iterations via square-rooting, Comput. Math. Appl. 5 (1979) 25--31.
I. Gargantini, Parallel square-root iterations for multiple roots, Comput. Math. Appl. 6 (1980) 279--288.
E. Halley, Methodus nova, accurata et facilis inveniendi radices aequationum quarumcumque generaliter, sine praevia reductione (A new, exact and easy method of finding the roots of equations generally, and that without any previous reduction), Philos. Trans. Roy. Soc. London 18 (1694) 136--145; also: abridges of above by C. Hutton, G.Shaw and R. Pearson (1809).
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.
E. Hansen and M. Patrick, Estimating the multiplicity of a root, Numer. Math. 27 (1976) 121--131.
E. Hansen, M. Patrick and J. Rusnack, Some modifications of Laguerre's method, BIT 17 (1977) 409--417.
E. Hansen and M. Patrick, A family of root-finding methods, Numer. Math. 27 (1977) 257--269.
J. Heinz, Polynom-Nullstellen mit dem Rechenstab, Praxis Math. 5 (4) (1963) 97--99.
P. Henrici, Applied and Computational Complex Analysis (Wiley, New York, 1977).
M.A. Hernandez and M.A. Salanova, A family of Chebyshev--Halley type methods, Internat. J. Comput. Math. 47 (1993) 59--63.
M.A. Hernandez, A note on Halley's method, Numer. Math. 59 (1991) 273--276.
J. Herzberger, Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen, Computing 12 (1974) 215--222.
J. Hines, On approximating the roots of an equation by iteration, Math. Mag. 24 (1951) 123--127.
M.W. Hirsch and S. Smale, On algorithms for solving f(x)=0, Comm. Pure Appl. Math. 32 (1979) 281--312.
S. Hitotumatu, A method of successive approximation based on the expansion of second order, Math. Japon. 7 (1962) 31--50.
U. Hochstrasser, Numerical methods for finding solutions of nonlinear equations, in: J. Todd, Ed., Survey of Numerical Analysis (McGraw-Hill, New York, 1962) 255--278.
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
A.S. Householder, Principles of Numerical Analysis (McGraw-Hill, New York, 1953) 86--132.
A.S. Householder, Schröder and Trudi: A historical excursion, SIAM Rev. 16 (1974) 344--348.
A.S. Householder, Polynomial iterations to roots of algebraic equations, Proc. Amer. Math. Soc. 2 (1951) 718--719.
L.C. Hsu, An efficient process of successive approximation for solving algebraical or transendental equations, Acta Math. Acad. Sci. Hungar. 9 (1958) 292--297.
L.C. Hsu, On the unconditional convergence of an iteration process, Notices Amer. Math. Soc. 20 (1973) A-577.
M. Hurley, Improbability of nonconvergence in a cubic root-finding method, J. Math. Anal. Appl. 133 (1988) 461--465.
A.V. Ivanisov and V.K. Polishchuk, Finding polynomial roots: A fast algorithm convergent on the complex plane, Commun. Appl. Numer. Meth. 1 (1985) 287--291.
A.V. Ivanisov and V.K. Polishchuk, A method of finding the roots of polynomials which converge for any initial approximation, U.S.S.R. Comput. Math. and Math. Phys. 25 (3) (1985) 1--7.
M.K. Jain, Fifth order implicit multipoint methods for solving equations, BIT 25 (1985) 250--255.
P. Jarratt, A review of methods for solving nonlinear algebraic equations in one variable, in: P. Rabinowitz, Ed., Numerical Methods for Nonlinear Algebraic Equations (Gordon and Breach, New York, 1970) 1--26.
P. Jarratt, A note on the asymptotic error constant of a method for solving equations, Comput. J. 9 (1967) 408--409.
P. Jarratt, A rational iteration function for solving equations, Comput. J. 9 (1966) 304--307.
P. Jarratt, Some efficient fourth order multipoint methods for solving equations, BIT 9 (1969) 119--124.
P. Jarratt and D. Nudds, The use of rational functions in the iterative solution of equations on a digital computer, Comput. J. 8 (1965) 62--65.
R.L. Johnston, Numerical Methods: A Software Approach (Wiley, New York, 1982).
W.B. Jordan, An iterative process, Math. Tables Aids Comput. 5 (1951) 183.
B. Kacewicz, An integral-interpolation iterative method for the solution of scalar equations, Numer. Math. 26 (1976) 355--365.
W. Kahan, Laguerre's method and a circle which contains at least one zero of a polynomial, SIAM J. Numer. Anal. 4 (1967) 474--482.
W. Kahan, Where does Laguerre's method come from?, in: Fourth Annual Princeton Conf. on Information Science and Systems (1970) 143.
I.N. Katz and M.A. Franklin, Two strategies for root finding on multiprocessor systems, SIAM J. Sci. Statist. Comput. 6 (1985) 314--333.
M. Kim, On approximate zeros and root-finding algorithms for a complex polynomial, Math. Comp. 51 (1988) 707--719.
I. Kiss, Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens, Z. Angew. Math. Mech. 34 (1954) 68--69.
D.A. Klip, Isolation of the zeros of a complex polynomial by exploiting function structure, in: V. Lakshmikantham, Ed., Trends in the Theory and Practice of Non-Linear Analysis, North-Holland Math. Stud. 110 (North-Holland, Amsterdam, 1985) 207--215.
E. Kobald, Notiz, betreffend die Berechnung der Wurzeln numerischer Gleichungen, Monatsh. Math. Phys. 2 (1891) 331--332.
W. Kotzé, Notes on numerical analysis, IV. On accelerating iteration procedures with superlinear convergence, Canad. Math. Bull. 7 (1964) 425--430.
L.I. Kronsjö, Algorithms: Their Complexity and Efficiency (Wiley, Chichester, 1979) 10--89.
S. Kulik, On the solution of algebraic equations, Proc. Amer. Math. Soc. 10 (1959) 185--192.
S. Kulik, A method for approximating the zeros of analytic functions, Duke Math. J. 24 (1957) 137--141.
S. Kulik, On the Laguerre method for separating the roots of algebraic equations, Proc. Amer. Math. Soc. 8 (1957) 841--843.
S. Kulik, A method of approximating the zeros of functions by quadratic formulas, Proc. Amer. Math. Soc. 12 (1961) 476--483.
V.A. Kurchatov, Conditions for the convergence of an iteration process of (k+1)st order for the solution of nonlinear functional equations under rough initial data, Soviet Math. (Iz. VUZ) 19 (4) (1975) 29--32.
H.L. Lagouanelle, Sur une méthode de calcul de l'ordre de multiplicité des zéros d'un polynôme, C.R. Acad. Sci. Paris A 262 (1966) 626--627.
J.L. Lagrange, De la résolution des équations numériques de tous les degrés, in: Oeuvres, Vol. 8 (Gauthier-Villars, Paris, 1879).
E.N. Laguerre, Sur une méthode pour obtenir par approximation les racines d'une équation algébrique qui a toutes ses racines réelles, in: Ouevres, Vol. 1 (Gauthier-Villars, Paris, 1898) 87--103; 461.
P. Lancaster, Convergence of the Newton--Raphson method for arbitrary polynomials, Math. Gaz. 48 (1964) 291--295.
M.R. Leuze, A hybrid Laguerre method, BIT 23 (1983) 132--138.
G.R. Lindfield and J.E.T. Penny, Microcomputers in Numerical Analysis (Wiley, New York, 1989) Chapter 2.
R. Ludwig, Über Iterationsverfahren für Gleichungen und Gleichungssysteme, Z. Angew. Math. Mech. 34 (1954) 210--225; 404--416.
H.J. Maehly, Zur iterativen Auflösung algebraischer Gleichungen, Z. Angew. Math. Phys. 5 (1954) 260--263.
G. Merz, Padésche Näherungsbrüche und Iterationsverfahren höheren Ordnung, Computing 3 (1968) 165--183.
I. Munro, Some results concerning efficient and optimal algorithms, in: Third Annual ACM Symp. on the Theory of Computers, Shaker Heights (1971) 40--44.
D. Nerinckx and A. Hagemans, A comparison of non-linear equation solvers, J. Comput. Appl. Math. 2 (2) (1976) 145--148.
P.F. Nesdore, The determination of an algorithm which uses the mixed strategy technique for the solution of a single nonlinear equation, in: P. Rabinowitz, Ed., Numerical Methods for Nonlinear Algebraic Equations (Gordon and Breach, London, 1970) 27--45.
B. Neta, Several new methods for solving equations, Internat. J. Comput. Math. 23 (1988) 265--282.
B. Neta, A new family of higher order methods for solving equations, Internat. J. Comput. Math. 14 (1983) 191--195.
A. Neumaier, An interval version of the secant method, BIT 24 (1984) 366--372.
N. Osada, An optimal multiple root-finding method of order three, J. Comput. Appl. Math. 51 (1994) 131--133.
A. Ostrowski, A method of speeding up iterations with super-linear convergence, J. Math. Mech. 7 (1958) 117--120.
A. Ostrowski, Le développement de Taylor de la fonction inverse, C.R. Acad. Sci. Paris 244 (1957) 429--430.
A.M. Ostrowski, Solution of Equations and Systems of Equations (Academic Press, New York, 2nd ed., 1966).
B. Parlett, Laguerre's method applied to the matrix eigenvalue problem, Math. Comp. 18 (1964) 464--485.
S. Paszkowski, Optimum choice of initial approximations in interpolation methods of solving equations, Zastos. Mat. XII 2 (1971) 201--216.
M.L. Patrick and D. Saari, A globally convergent algorithm for determining approximate real zeros of a class of functions, BIT 15 (1975) 296--303.
R.I. Peluso, Una famiglia di metodi iterativi per ogni ordine superiore al seconde, Calcolo 10 (1973) 145--149.
L. Petkovic and M. Petkovic, Generalized Ostrowski root-finding method, Appl. Math. Comput. 57 (1993) 275--287.
M.S. Petkovic, Some interval iterations for finding a zero of a polynomial with error bounds, Comput. Math. Appl. 14 (1987) 479--495.
M.S. Petkovic, Schröder-like algorithms for multiple complex zeros of a polynomial, Computing 45 (1990) 39--50.
M.S. Petkovic, On a generalization of the root iterations for polynomial complex zeros in circular interval arithmetic, Computing 27 (1981) 37--55.
M.S. Petkovic and L.V. Stefanovic, On some improvements of square root iteration for polynomial complex zeros, J. Comput. Appl. Math. 15 (1) (1986) 13--25.
M.S. Petkovic, On Halley-like algorithms for simultaneous approximation of polynomial complex zeros, SIAM J. Numer. Anal. 26 (1989) 740--763.
M.S. Petkovic and L.V. Stefanovic, The numerical stability of the generalized root iterations for polynomial zeros, Comput. Math. Appl. 10 (1984) 97--106.
M.S. Petkovic and L.V. Stefanovic, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, BIT 27 (1987) 111--122.
M.S. Petkovic and L.V. Stefanovic, On some parallel higher-order methods of Halley's type for finding multiple polynomial zeros, in: G.V. Milanovic, Ed., Proc. Conf. on Numerical Methods and Approximation Theory, Nis (1988) 329--337.
M.S. Petkovic, G.V. Milovanovic and L.V. Stefanovic, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, Comput. Math. Appl. 12A (1986) 951--962.
M.S. Petkovic and Z. Mitrovic, A Halley-like hybrid method for solving polynomial equations, Z. Angew. Math. Mech. 72 (1992) 447--450.
E. Pflanz, Über ein Verallgemeinerung des Verfahrens der Kombination von Newtonscher Methode und Regula falsi zur Auflösung einer Gleichung f(x)=0, Z. Angew. Math. Mech. 28 (1948) 114--122.
E. Pflanz, Zur Bestimmung reeller Nullstellen von reellen Funktionen einer Variablen, Z. Angew. Math. Mech. 29 (1949) 85--91.
D. Pham and M. Ghinea, Sur une méthode d'itération dans la théorie des equations, C.R. Acad. Sci. Paris 249 (1959) 2262--2264.
C.A. Pickover, A note on chaos and Halley's method, Comm. ACM 31 (1988) 1326--1329.
T. Pomentale, A class of iterative methods for holomorphic functions, Numer. Math. 18 (1971) 193--203.
M.B.S. Popov, Sur un procédé de résolution numérique des équations, Bull. Sci. Math. Ser. 2 81 (1957) 29--31.
D.B. Popovski, Numerical solution of equations on the basis of approximation by the curve (x-p1)[y(x)-p2]2-p3=0, Internat. J. Numer. Methods Engrg. 14 (1979) 1574.
D.B. Popovski, Sixth order methods for solving equations, Z. Angew. Math. Phys. 33 (1982) 434--438.
D.B. Popovski, A family of one-point iteration formulae for finding roots, Internat. J. Comput. Math. 8 (1980) 85--88.
D.B. Popovski and P.B. Popovski, Some new one-point iteration functions of order three for solving equations, Z. Angew. Math. Mech. 62 (1982) T344--T345.
D.B. Popovski, A note on Neta's family of sixth-order methods for solving equations, Internat. J. Comput. Math. 10 (1981) 91--93.
D.B. Popovski, Methods of tangential parabolic approximation for solving the equation x=f(x), Z. Angew. Math. Mech. 64 (1984) T417--T418.
W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Vetterling, Numerical Recipes-the Art of Scientific Computing (Cambridge University Press, New York, 1986) 240--273.
A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis (McGraw-Hill, New York, 2nd ed., 1987) 354.
Theremin, Recherches sul la résolution des équations de tous les degrés, J. Reine Angew. Math. 49 (1855) 187--243.
J.R. Rice, Matrix representations of nonlinear equation iterations---application to parallel computation, Math. Comp. 25 (1971) 639--647.
H.E. Salzer, Note on a formula for the solution of an arbitrary analytic equation, Quart. Appl. Math. 4 (1946) 306--307.
E. Schröder, Über unendlich viele Algorithmen zur Auflösung der Gleichungen, Math. Ann. 2 (1870) 317--365.
E. Schröder, Über iterierte Functionen, Math. Ann. 3 (1871) 296--322.
H. Schwerdtfeger, Notes on numerical analysis I. Polynomial iteration, Canad. Math. Bull. 2 (1959) 97--110.
R.E. Shafer, On quadratic approximation, SIAM J. Numer. Anal. 7 (1974) 447--460.
M. Shub and S. Smale, Computational complexity: on the geometry of polynomials and a theory of cost II, SIAM J. Comput. 15 (1986) 145--161.
M. Shub and S. Smale, Computational complexity; on the geometry of polynomials and a theory of cost I, Ann. Sci. École Norm. Sup. (4) 18 (1985).
S. Smale, On the efficiency of the algorithms of analysis, Bull. Amer. Math. Soc. (2) 13 (1985) 87--121.
B.T. Smith, ZERPOL, a zero finding algorithm for polynomials using Laguerre's method, in: Proc. 1967 Army Numerical Analysis Conference, Madison, WI (1967) 153--174.
W.F. Smyth, The construction of rational iteration functions, Math. Comp. 32 (1978) 811--827.
R.W. Snyder, One more correction formula, Amer. Math. Monthly 62 (1955) 722--725.
G.W. Stewart, On a companion operator for analytic functions, Numer. Math. 18 (1971) 26--43.
J.K. Stewart, Another variation of Newton's method, Amer. Math. Monthly 58 (1951) 331--334.
Z. Szabó, Newton-parabola combined method for solving equations, in: C. Brezinski and U. Kulisch, Eds., Computational and Applied Mathematics I (North-Holland, Amsterdam, 1992) 447--452.
Z. Szabó, Combined iteration method for solving equations, in: D. Greenspan, Ed., Numerical Methods, Miscolc, Colloquia Mathematica Societatis Janos Bolyai 50 (North-Holland, Amsterdam, 1986) 581---588.
B. Taylor, An attempt towards the improvement of the method of approximating, in the extraction of the roots of equations by numbers, Philos. Trans. Roy. Soc. London 30 (1717) 610--618.
J.F. Traub, The solution of transcendental equations, in: A. Ralston and H.S. Wilf, Eds., Mathematical Methods for Digital Computers, Vol. II (Wiley, New York, 1967) 171--184.
J.F. Traub, Iterative Methods for the Solution of Equations (Prentice-Hall, Englewood Cliffs, NJ, 1964); (Chelsea, New York, 1982).
J.F. Traub, Theory of optimal algorithms, in: D.J. Evans, Ed., Software for Numerical Mathematics (Academic Press, New York, 1974) 1--13.
J.F. Traub, On Newton--Raphson iteration, Amer. Math. Monthly 74 (1967) 996--998.
J.F. Traub, Computational complexity of iterative processes, SIAM J. Comput. 1 (1972) 167--179.
J.F. Traub, Optimal m-invariant iteration functions, Notices Amer. Math. Soc. 9 (1962) 122.
J.F. Traub, On a class of iteration formulas and some historical notes, Comm. ACM 4 (6) (1961) 276--278.
J.F. Traub, On the nth derivative of the inverse function, Amer. Math. Monthly 69 (1962) 904--907.
J.M. Trojan, How to decrease the combinatory complexity, Demonstratio Math. 11 (1978) 807--811.
J.C. van der Corput, Sur l'approximation de Laguerre des racines d'une équation algébrique qui a toutes ses racines réelles, Nederl. Akad. Wetensch. Proc. 49 (1946) 922--929; also: Indag. Math. 8 (1947) 911--928.
C.E. Van Orstrand, Reversion of power series, Philos. Mag. Ser. 6 19 (1910) 366--376.
V.A. Varyukin and S.A. Kas'yanyuk, Iterative methods of determining the roots of equations more accurately, U.S.S.R. Comput. Math. and Math. Phys. 9 (3) (1969) 247--252.
M.A.H. Verón, A note on Halley's method, Numer. Math. 59 (1991) 273--276.
E.R. Vrscay and W.J. Gilbert, Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions, Numer. Math. 52 (1988) 1--16.
E.R. Vrscay, Julia sets and Mandelbrot-like sets associated with higher order Schröder rational iteration functions: a computer assisted study, Math. Comp. (1986) 151--169.
A.-W.M. Nourein, Root determination by use of Padé approximants, BIT 16 (1976) 291--297.
H.S. Wall, A modification of Newton's method, Amer. Math. Monthly 55 (1948) 90--94.
H.S. Wall, Polynomials whose zeros have negative real parts, Amer. Math. Monthly 52 (1945) 308--322.
S.E. Weinstein, Solution of nonlinear equations by iterative procedures which use approximation techniques, SIAM J. Numer. Anal. 6 (1969) 272--283.
W. Werner, Some improvement of classical iterative methods for the solution of nonlinear equations, in: E.L. Allgower, K. Glashoff and N.-O. Peitgen, Eds., Proc. Numerical Solution of Nonlinear Equations (Springer, Bremen, 1980) 426--440.
W. Werner, Iterationsverfahren höherer Ordnung zur Lösung nichtlinearer Gleichungen, Z. Angew. Math. Mech. 61 (1981) T322--T324.
A.G. Werschulz, Multipoint methods with memory using Hermitian information, in: Proc. 1979 Conf. on Information Science and Systems (Johns Hopkins Univ. Press, Baltimore, MD, 1979).
J.M. Wolfe, A determinant formula for higher order approximations of roots, Math. Mag. 31 (1958) 197--199.
H. Wozniakowski, Maximal stationary iterative methods for the solution of operator equations, SIAM J. Numer. Anal. 11 (1974) 939--949.
P. Wynn, On a cubically convergent process for determining the zeros of certain functions, Math. Tables Aids Comput. 10 (1956) 97--100.
D.M. Young and R.T. Gregory, A Survey of Numerical Mathematics, Vol. I (Addison-Wesley, Reading, MA, 1972) 93--245.
A. Zajta, Untersuchungen über die Verallgemeinerung der Newton--Raphsonschen Wurzelapproximation, Acta Tech. Acad. Sci. Hungar. 15 (1956) 233--260; ibid. 19 (1957) 25--60.