G. Alefeld and J. Herzberger, Introduction to Interval Computations (Academic Press, New York, 1983) 67--119.
G. Alefeld and F. Potra, On two higher order enclosing methods of J.W. Schmidt, Z. Angew. Math. Mech. 68 (1988) 331--337.
N. Anderson and A. Bjork, A new high order method of reguli falsi type for computing a root of an equation, BIT 13 (1973) 253--264.
H.A. Antosiewicz and J.M. Hammersley, The convergence of numerical iteration, Amer. Math. Monthly 60 (1953) 604--607.
B.W. Arden and K.N. Astill, Numerical Algorithms: Origins and Applications (Addison-Wesley, Reading, MA, 1970) 54--80.
K. Atkinson, An Introduction to Numerical Analysis (Wiley, New York, 1978) 39--106.
K.H. Bachmann, Der Konvergenzgrad bei iterativer Lösung von Gleichungen durch inverse Interpolation, Z. Angew. Math. Mech. 34 (1954) 282--283.
M. Balfour and A.J. McTernan, The Numerical Solution of Equations (Heinemann, London, 1st ed., 1967).
P. Baptist, Konvergenz und monotone Einschliessung für das Steffensen-Verfahren, Elem. Math. 37 (1982) 33--40.
P. Baptist, Monotone enclosings of solutions of the Steffensen-type, Internat. J. Math. Ed. Sci. Tech. 13 (1982) 273--280.
E.J. Barbeau, Polynomials (Springer, New York, 1989).
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.
C.A. Barlow Jr and E.L. Lyons, A method for the solution of roots of a nonlinear equation and for solution of the general eigenvalue problem, J. Assoc. Comput. Mach. 13 (1966) 135--142.
I. Barrodale and K.B. Wilson, A Fortran program for solving a nonlinear equation by Muller's method, J. Comput. Appl. Math. 4 (2) (1978) 159--166.
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, Ein ableitungsfreies Dreistuffenverfahren mit quadratischer Konvergenz zur Berechnung von Nullstellen, Rostock Math. Kolloq. 13 (1980) 119--122.
M. Besson and E. Brassey, Résolution des équations algébriques par la règle à calcul, Elem. Math. 5 (1950) 125--131.
A. Björck and G. Dahlquist, Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1974).
J.A. Blackburn and Y. Beaudoin, A note on Chamber's method, Math. Comp. 28 (1974) 573--574.
A.D. Booth, Numerical Methods (Butterworth, London, 1955).
R. Brent, An algorithm with guaranteed convergence for finding a zero of a function, Comput. J. 14 (1971) 422--425.
R. Brent, S. Winograd and P. Wolfe, Optimal iterative processes for root-finding, Numer. Math. 20 (1973) 327--341.
R.P. Brent, Multiple-precision zero-finding methods and the complexity of elementary function evaluation, in: J.F. Traub, Ed., Analytic Computational Complexity (Academic Press, New York, 1976) 151--176.
R.P. Brent and H.T. Kung, Fast algorithms for manipulating formal power series, J. Assoc. Comput. Mach. 25 (1978) 581--595.
R.A. Buckingham, Numerical Methods (Pitman, London, 1957) 251--304.
V.G. Bunkov, A combined method of determining the zeros of a polynomial, U.S.S.R. Comput. Math. and Math. Phys. 15 (2) (1975) 202--206.
J.C.P. Bus and T.J. Dekker, Two efficient algorithms with guaranteed convergence for finding a zero of a function, ACM Trans. Math. Software 1 (1975) 330--345.
B. Carnahan, H.A. Luther and J.O. Wilkes, Applied Numerical Methods (Wiley, New York, 1969) 141--209.
J. Carnoy, Cours d'Algèbre supérieure (Gauthier-Villars, Paris, 1900).
V. Casulli and D. Trigiante, Multipoint iterative parallel methods for solving equations, Calcolo 15 (1978) 147--160.
V. Casulli and D. Trigiante, Sui procedimenti iterativi composti, Calcolo 13 (1976) 403--420.
V. Casulli and D. Trigiante, The convergence order for iterative multipoint procedures, Calcolo 14 (1977) 25--44.
V. Casulli and D. Trigiante, Computational complexity for a class of multipoint iterative procedures without or with internal memory, Calcolo 14 (1977) 225--235.
A. Cauchy, Sur la résolution numérique des équations algébriques et transcendantes, C.R. Acad. Sci. Paris 11 (1840) 829--847.
L.G. Chambers, A quadratic formula for finding the root of an equation, Math. Comp. 25 (1971) 305--307.
H.A. Chase, On convergence criteria for Jarratt's method, J. Franklin Inst. 317 (1984) 383--401.
D. Chen, On the convergence of a class of generalized Steffensen's iterative procedures and error bounds analysis, Internat. J. Comput. Math. 31 (1990) 195--203.
H.H.Y. Chien, A multiphase algorithm for single variable equation solving, J. Inst. Math. Appl. 9 (1972) 290--298.
D.M. Claudio, An algorithm for solving nonlinear equations based on the regula falsi and Newton methods, Z. Angew. Math. Mech. 64 (1984) T407--T408.
D.M. Claudio, Hybrid interval algorithms and their Implementation on the HP-25, Z. Angew. Math. Mech. 66 (1986) T294--T296.
L. Collatz et al., Eds., Functional Analysis and Numerical Mathematics (Academic Press, New York, 1966).
L. Collatz, Funktionanalysis und Numerische Mathematik (Springer, Berlin, 1964).
W.A. Coppel, The solution of equations by iteration, Proc. Cambridge Philos. Soc. 51 (1955) 41--43.
M.G. Cox, A bracketing technique for computing a zero of a function, Comput. J. 13 (1970) 101--102.
M.G. Cox, A note on Chamber's method for finding a zero of a function, Math. Comp. 26 (1972) 749--750.
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.
H. Dörrie, Praktische Algebra (Oldenbourg, München, 1959).
J.W. Daniel, Correcting approximations to multiple roots of polynomials, Numer. Math. 9 (1960) 99--102.
J.E. Dawson, A formula approximatting the root of a function, Inst. Math. Appl. J. Numer. Anal. 2 (1982) 371--375.
T.J. Dekker, Finding a zero by means of successive linear interpolation, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 37--48.
T.J. Dekker, Correctness proof and machine arithmetic, in: B. Fosdick and L. Dudley, Eds., Performance Evaluation of Numerical Software (Elsevier, Amsterdam, 1979) 31--44.
J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Non-linear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
A.H. Desboves, Séparation des racines d'une équation algébrique par la méthode des différences, Nouv. Ann. Math. 13 (1854) 60--71.
J. Dieudonné, Calcul Infinitésimal (Hermann, Paris, 1968).
D. Dobbs and R. Hanks, A modern course on the theory of equations (Polygonal Publishers., 2nd ed., 1992).
M. Dowell and P. Jarratt, The "Pegasus" method for computing the root of an equation, BIT 12 (1972) 503--508.
M. Dowell and P. Jarratt, A modified reguli falsi method for computing the root of an equation, BIT 11 (1971) 168--174.
D.K. Dunaway, A composite algorithm for finding zeros of real polynomials, Ph.D. Thesis, Southern Methodist Univ., Dallas, TX, 1972.
D.K. Dunaway and B.L. Turlington, Modifications to the Garside, Jarratt, and Mack method for solving ill-conditioned polynomial equations, J. Inst. Math. Appl. 10 (1972) 358--368.
D.K. Dunaway and B. Turlington, Some major modifications to a new method for solving ill-conditioned polynomial equations, in: Proc. ACM 1972 Annual Conf. (Assoc. Computing Machinery, New York, 1972) 636--643.
D.K. Dunaway, Calculation of zeroes of a real polynomial through factorization using Euclid's algorithm, SIAM J. Numer. Anal. 11 (1974) 1087--1104.
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.
C.C. Dyer, A modified Muller routine for finding the zeroes of non-analytic complex functions, J. Comput. Phys. 53 (1984) 530--534.
T.O. Espelid, On the behaviour of the secant method near a multiple root, BIT 12 (1972) 112--115.
H. Esser, An always quadratically convergent modification of the Steffensen-procedure, Computing 14 (1975) 367--369.
L.R. Ford, The solution of equations by the method of successive approximations, Amer. Math. Monthly 32 (1925) 272--287.
G.E. Forsythe, M.A. Malcolm and C.B. Moler, Computer Methods for Mathematical Computation (Prentice Hall, Englewood Cliffs, NJ, 1977) 156--168.
W.L. Frank, Finding zeros of arbitrary functions, J. Assoc. Comput. Mach. 5 (1958) 154--160.
R.L. Franks and R.P. Marzec, A theorem on mean value iterations, Proc. Amer. Math. Soc. 30 (1971) 324--326.
L.E. Garey and R.E. Shaw, A Steffensen-type method for computing a root, Internat. J. Comput. Math. 18 (1985) 185--190.
G.R. Garside, P. Jarratt and C. Mack, A new method for solving polynomial equations, Comput. J. 11 (1968) 87--90.
C.F. Gerald, Applied Numerical Analysis (Addison-Wesley, Reading, MA, 1984) 1--79.
G.H. Gonnet, On the structure of zero finders, BIT 17 (1977) 170--183.
G.H. Gonnet, A short note on convergence near a high-order zero, BIT 16 (1976) 338--339.
R.L. Goodstein and T.A. Broadbent, The convergence of iterative processes, J. London Math. Soc. 22 (1947) 168--171.
D. Greenspan, On popular methods and extant problems in the solution of polynomial equations, Math. Mag. 31 (1957--1958) 239--253.
R.W. Hamming, Introduction to Applied Numerical Analysis (McGraw-Hill, New York, 1971).
R.W. Hamming, Numerical Methods for Scientists and Engineers (McGraw-Hill, New York, 1962) 356--359.
W. Heitzinger, I. Troch and G. Valentin, Praxis Nichtlinearer Gleichungen (Hanser Verlag, München, 1985).
P. Henrici, Elements of Numerical Analysis (Wiley, New York, 1964) 79--81; 99--101; 305--309.
J.G. Herriot, Algorithm 26: Rootfinder III, Comm. ACM 3 (11) (1960) 603.
J. Herzberger, Über Matrixdarstellungen für Iterationsverfahren bei nichtlinearen Gleichungen, Computing 12 (1974) 215--222.
A.C. Hindmarsh, Optimality in a class of rootfinding algorithms, SIAM J. Numer. Anal. 9 (1972) 205--214.
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.
W. Hofmann, Monotoniesätze für Regula-falsi und Newton-Verfahren, Computing 8 (1971) 143--150.
D.J. Hopgood, Improved root-finding methods derived from inverse interpolation, J. Inst. Math. Appl. 14 (1974) 217--228.
R.W. Hornbeck, Numerical Methods (Quantum, New York, 1975).
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.
L.C. Hsu, A few useful modifications of Newton's approximation method of solving real equations, Math. Student 26 (1958) 145--153.
L.C. Hsu, An efficient process of successive approximation for solving algebraical or transendental equations, Acta Math. Acad. Sci. Hungar. 9 (1958) 292--297.
E. Isaacson and H.B. Keller, Analysis of Numerical Methods (Wiley, New York, 1966) 85--133.
S.R.K. Iyengar and R.K. Jain, Derivative free multipoint iterative methods for simple and multiple roots, BIT 26 (1986) 93--99.
B. Jankó, Sur l'analogue de la méthode de Tchebycheff et de la méthode des hyperboles tangentes, Mathematica (Cluj) 2 (25) (1960) 269--275.
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, An iterative method for locating turning points, Comput. J. 10 (1967) 82--84.
P. Jarratt, A numerical method for determining points of inflection, BIT 8 (1968) 31--55.
T.A. Jeeves, Secant modification of Newton's method, Comm. ACM 1 (8) (1967) 9--10.
W. Jennings, First Course in Numerical Methods (MacMillan, New York, 1964) 5--12; 23--39.
L.W. Johnson and R.D. Riess, Numerical Analysis (Addison-Wesley, Reading, MA, 1982) 142--201.
R.L. Johnston, Numerical Methods: A Software Approach (Wiley, New York, 1982).
B. Jones, Extrapolation for higher orders of convergence J. Inst. Math. Appl. (1976) 27--36.
L.P. Jones, Root isolation methods based upon Lagrangian interpolation, Internat. J. Comput. Math. 24 (1988) 343--355.
B.-K. Park and S. Hitotumatu, A study on new Muller's method, Publ. Res. Inst. Math. Sci. 23 (1987) 667--672.
W. Kahan, Personal calculator adds key to solve any equation f(x)=0, Hewlett-Packard J. (December 1979) 20--26.
Al-Khwarizmi, Liber Algebrae et Almucabala (825); Latin translation: Robert of Chester (c. 1140); English translation: F. Rosen (Oriental Translation Fund, London, 1831).
W.M. Kincaid, Solution of equations by interpolation, Ann. of Math. Statist. 19 (1948) 207--219.
R.F. King, Tangent methods for nonlinear equations, Numer. Math. 18 (1972) 298--304.
R.F. King, A family of fourth order methods for nonlinear equations, SIAM J. Numer. Anal. 10 (1973) 876--879.
R.F. King, An improved Pegasus method for root finding, BIT 13 (1973) 423--427.
R.F. King, A secant method for multiple roots, BIT 17 (1977) 321--328.
R.F. King, Methods without secant steps for finding a bracketed root, Computing 17 (1976) 49--57.
J.B. Kioustelidis, A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros, Numer. Math. 33 (1979) 385--389.
G. Koenigs, Recherches sur les substitutions uniformes, Bull. Sci. Math. Ser. 2 7 (1883) 340--357.
R. Krautstengel, On one iterative method of calculating a single root of equation f(x)=0, U.S.S.R. Comput. Math. and Math. Phys. 8 (6) (1968) 186--188.
G.K. Kristiansen, Zeros of arbitrary function, BIT 3 (1963) 205--206.
G.K. Kristiansen, A rootfinder using a monotone rational approximation, SIAM J. Sci. Statist. Comput. 6 (1985) 118--127.
L.I. Kronsjö, Algorithms: Their Complexity and Efficiency (Wiley, Chichester, 1979) 10--89.
H.T. Kung and J.F. Traub, Optimal order and efficiency for iterations with two evaluations, SIAM J. Numer. Anal. 13 (1976) 84--99.
H.T. Kung and J.F. Traub, Optimal order of one-point and multi-point iteration, J. Assoc. Comput. Mach. 21 (1974) 643--651.
K.S. Kunz, Numerical Analysis (McGraw-Hill, New York, 1957) 1--37.
S.S. Kuo, Computer Applications of Numerical Methods (Addison-Wesley, Reading, MA, 1972).
V.A. Kurchatov, The method of linearized residuals for accelerating the convergence of an iteration method, Sov. Math. (Iz. VUZ) 23 (8) (1979) 34--45.
G.S. Ladd and M. Sambandham, Numerical treatment of random polynomials, Appl. Math. Comput. 55 (1993) 13--30.
G.N. Lance, Numerical Methods for High Speed Computers (Iliffe, London, 1960) 123--137.
F.M. Larkin, A modification of the secant rule derived from a maximum likelihood principle, BIT 19 (1979) 214--222.
F.M. Larkin, Root finding by divided differences, Numer. Math. 37 (1981) 93--104.
F.M. Larkin, Root-finding by fitting rational functions, Math. Comp. 35 (1980) 803--816.
M.D. Lax, Numerical solution of random nonlinear equations, Stochastic Anal. Appl. 3 (1985) 163--169.
D. Le, An efficient derivative-free method for solving nonlinear equations, ACM Trans. Math. Software 11 (1985) 250--262; correction: ibid. 15 (1989) 287.
D. Le, Three new rapidly convergent algorithms for finding a zero of a function, SIAM J. Sci. Statist. Comput. 6 (1985) 193--208.
G. Lemaitre, L'itération rationelle, Acad. Roy. Belg. Bull. Cl. Sci. (5) 28 (1942) 347--354.
G.R. Lindfield and J.E.T. Penny, Microcomputers in Numerical Analysis (Wiley, New York, 1989) Chapter 2.
C.C. MacDuffee, Theory of Equations (Wiley, New York, 1954) Chapter 7.
I. Manning, A method for improving iteration procedures, Proc. Cambridge Philos. Soc. 63 (1967) 183--186.
R.P. Manohar and T.-Y. Ngai, On an iterative method for solving nonlinear equations, in: R.S.D. Thomas and H.C. Williams, Eds., Proc. Manitoba Conf. on Numerical Mathematics, Winnipeg (1971) 527--542.
M.J. Maron and R.J. Lopez, The secant method and the golden mean, Amer. Math. Monthly 100 (1993) 676--678.
W.E. Milne, Numerical Calculus (Princeton, 1949).
W.L. Miranker, Parallel methods for solving equations, in: M. Feilmeier, Ed., Parallel Computers---Parallel Mathematics (1977) 9--15; also: Math. Comput. Simulation 20 (2) (1978) 93--101.
W.L. Miranker, A survey of parallelism in numerical analysis, SIAM. Rev. 13 (1971) 532--536.
W.L. Miranker, Parallel methods for approximating a root of a function, IBM. J. Res. Develop. 13 (1969) 297--301.
D.E. Muller, A method for solving algebraic equations using an automatic computer, Math. Tables Aids Comput. 10 (1956) 208--215.
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.
E. Netto, Über einen Algorithmus zur Auflösung numerischer algebraischer Gleichungen, Math. Ann. 29 (1887) 141--147 .
A. Neumaier, Divided differences, shift transformations, and Larkin's root finding method, Math. Comp. 45 (1985) 181--196.
A. Neumaier, An interval version of the secant method, BIT 24 (1984) 366--372.
V. Norton, Algorithm 631: Finding a bracketed zero by Larkin's method of rational interpolation, ACM Trans. Math. Software 11 (1985) 120--134.
V. Norton, Remark on algorithm 631, ACM Trans. Math. Software 12 (1986) 72.
A. Ostrowski, Über Verfahren von Steffensen und Householder zur Konvergenzverbesserung von Iterationen, Z. Angew. Math. Phys. 7 (1956) 218--219.
A.M. Ostrowski, Solution of Equations and Systems of Equations (Academic Press, New York, 2nd ed., 1966).
A.M. Ostrowski, On approximation of equations by algebraic equations, J. Soc. Indust. Appl. Math. Numer. Anal. Ser. B 1 (1964) 104--130.
A.M. Ostrowski, The round-off stability of iterations, Z. Angew. Math. Mech. 47 (1967) 77--81.
K. Ozawa, Some globally convergent iterative methods based on the bisection iteration for solving scalar equations, Comput. Math. Appl. 28 (6) (1994) 83--91.
A.E. Pellet, Calcul de racines réelles d'une équation, C.R. Acad. Sci. Paris 133 (1901) 917--918.
G. Peters and J.H. Wilkinson, Eigenvalues of Ax = λBx with band-symmetric A and B, Comput. J. 12 (1969) 398--404.
A. Peyerimhoff, E. Stickel and E. Wirsing, On the rate of convergence for two-term recursions, Computing 40 (1988) 329--335.
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.
T. Pomentale, Homotopy iterative methods for polynomial equations, J. Inst. Math. Appl. 13 (1974) 201--213.
D.B. Popovski, An improvement of the Ostrowski root finding method, Z. Angew. Math. Mech. 61 (1981) T303--T305.
D.B. Popovski, Method of parabolic approximation for solving the equation x=f(x), Internat. J. Comput. Math. 9 (1981) 243--248.
F.A. Potra, Efficient hybrid algorithms for finding zeros of convex functions, J. Complexity 10 (1994) 199--215.
F.A. Potra and V. Pták, Nondiscrete induction and a double-step secant method, Math. Scand. 46 (1980) 236--250.
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.
E.J. Putzer, A numerical method for solving scalar equations, Amer. Math. Monthly 69 (1962) 408--411.
A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis (McGraw-Hill, New York, 2nd ed., 1987) 354.
J. Renegar, On the cost of approximating all roots of a complex polynomial, Math. Programming 32 (1985) 319--336.
J. Renegar, On the complexity of a piece-wise linear algorithm for approximating roots of complex polynomials, Math. Programming 32 (1985) 301--318.
B.E. Rhoades, Comments on two fixed point iteration methods, J. Math. Anal. Appl. 56 (1976) 741--750.
J.R. Rice, Numerical Methods, Software and Analysis (McGraw-Hill, New York, 1983) 217--264.
J.R. Rice, Matrix representations of nonlinear equation iterations---application to parallel computation, Math. Comp. 25 (1971) 639--647.
C.J.F. Ridders, Three-point iterations derived from exponential cuve fitting, IEEE Trans. Circuits and Systems 26 (1979) 669--670.
J. Rissanen, On optimum root-finding algorithms, J. Math. Anal. Appl. 36 (1971) 220--225.
F. Robert, Machine iteration for a linear function, Comput. Math. Appl. 12B (1986) 1259--1274.
R. Ross, A method of solving algebraic equations, Nature 78 (1908) 663--665.
C. Runge, Praxis der Gleichungen (De Gruyter, Berlin, 1921).
M.G. Salvadori and M.L. Baron, Numerical Methods in Engineering (Prentice Hall, New York, 1952).
H.E. Salzer, On calculating the zeros of polynomials by the method of Lucas, J. Res. Nat. Bur. Standards 49 (1952) 133--134.
P.A. Samuelson, Iterative computation of complex roots, J. Math. and Phys. 28 (1949) 259--267.
P.A. Samuelson, A convergent iterative process, J. Math. and Phys. 24 (1945) 131--134.
L. Sancery, De la méthode des substitutions successives pour le calcul des racines des équations, Nouv. Ann. Math. Ser. 2 1 (1862) 305--315.
J.B. Scarborough, Numerical Mathematical Analysis (Johns Hopkins Univ. Press, Baltimore, MD, 1968) Chapters 8, 10, 11.
U. Schendel, Introduction to Numerical Methods for Parallel Computers (Wiley, New York, 1984) 105--118.
C.E. Schmidt and L.R. Rabiner, A study of techniques for finding the zeros of linear phase FIR digital filters, IEEE Trans. Acoust. Speech Signal Process. 25 (1977) 96--98.
J.W. Schmidt, Eingrenzung von Lösungen nichtlinearer Gleichungen durch Verfahren mit höherer Konvergenzgeschwindigkeit, Computing 8 (1971) 208--215.
J.W. Schmidt, Monotone Einschliessung mit der Regula falsi bein konvexen Functionen, Z. Angew. Math. Mech. 50 (1970) 640--643.
L.F. Shampine and R.C. Allen, Numerical Computing: An Introduction (Saunders, Philadelphia, PA, 1973) 87--108; 242--245.
G.S. Shedler, Parallel numerical methods for the solution of equations, Comm. ACM 10 (5) (1967) 286--291.
R.I. Shrager, A rapid robust rootfinder, Math. Comp. 44 (1985) 151--165.
J. Singer, Elements of Numerical Analysis (Academic Press, London, 1964) 137--199.
V.I. Smirnov, A Course of Higher Mathematics, Vol. I (Pergamon, Oxford, 1964) 480--505.
P.A. Stark, Introduction to Numerical Methods (Macmillan, New York, 1970) 68--122.
G.W. Stewart, The convergence of multipoint iterations to multiple zeros, SIAM J. Numer. Anal. 11 (1974) 1105--1120.
G.W. Stewart, The behaviour of a multiplicity independent root-finding scheme in the presence of error, BIT 20 (1980) 526--528.
G.W. Stewart, Some iterations for factoring a polynomial. II. A generalization of the secant method, Numer. Math. 22 (1973) 33--36.
E.L. Stiefel, An Introduction to Numerical Mathematics (Academic Press, New York, 1963).
J. Stoer and R. Bulirsch, Introduction to Numerical Analysis (Springer, New York, 1980) 270--299.
R.G. Strongin, A stochastic approach to finding the zero of a function, U.S.S.R. Comput. Math. and Math. Phys. 12 (1) (1972) 1--14.
F. Stummel and K. Hainer, Introduction to Numerical Analysis, translation: E.R. Dawson (Scottish Academic Press, 1980) 19--35.
A. Swift and G.R. Lindfield, Comparison of a continuation method with Brent's method for the numerical solution of a single non-linear equation, Comput. J. 21 (1978) 359--362.
H.C. Thatcher, Algorithm 15: Rootfinder II, Comm. ACM 3 (8) (1960) 475.
J. Todd, Motivations for working in numerical analysis, Comm. Pure Appl. Math. 8 (1955) 98--100.
L. Tornheim, Convergence of multipoint iterative methods, J. Assoc. Comput. Mach. 11 (1964) 210--220.
J. Traub and H. Wozniakowski, A General Theory of Optimal Algorithms (Academic Press, New York, 1980) 150--172.
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.M. Trojan, Tight bounds on the complexity index of one-point iterations, Comput. Math. Appl. 6 (1980) 433--441.
J.S. Vandergraft, Introduction to Numerical Computations (Prentice-Hall, Englewood Cliffs, NJ, 1964).
V.I. Verbuk and D.I. Milman, Wegstein's method as a modification to the secant method, U.S.S.R. Comput. Math. and Math. Phys. 17 (2) (1977) 215--216 (in Russian).
M. Vianello and R. Zanovello, On the superlinear convergence of the secant method, Amer. Math. Monthly 99 (1992) 758--761.
A. Vogel, Iterationsverfahren zur Auflösung einer Gleichung f(x)=0, Praxis Math. 1 (1959) 197--200.
R. von Mises and H. Geiringer, Praktische Verfahren der Gleichungsauflösung, zusammenfassender Bericht, Z. Angew. Math. Mech. 9 (1929) 58--79; 152--164.
R. Wait, The Numerical Solution of Algebraic Equations (Wiley, Chichester, 1979).
D.D. Wall, The order of an iteration formula, Math. Tables Aids Comput. 10 (1956) 167--168.
H. Weber, Traité d'Algèbra Supérieure (Gauthier-Villars, Paris, 1898).
H. Weber, Lehrbuch der Algebra (Chelsea, New York).
J.H. Wegstein, Accelerating convergence of iterative processes, Comm. ACM 1 (6) (1958) 9--13.
J.H. Wegstein, Algorithm 2: Rootfinder, Comm. ACM 3 (2) (1960) 74.
S.E. Weinstein, On the numerical solution of nonlinear equations through nonlinear interpolation or approximation, SIAM J. Numer. Anal. 11 (1974) 461--471.
S.E. Weinstein, Solution of nonlinear equations by iterative procedures which use approximation techniques, SIAM J. Numer. Anal. 6 (1969) 272--283.
F. Wenzl, Iterationsverfahren zur Berechnung komplexer Nullstellen von Gleichungen, Z. Angew. Math. Mech. 32 (1952) 85--87.
V.W. Whitley, Certification of Algorithm 196: Muller's method for finding roots of an arbitrary function, Comm. ACM 11 (1968) 12--14.
E.T. Whittaker and G. Robinson, The Calculus of Observations (London, 4th ed., 1944) 78--131.
J.H. Wilkinson, The evaluation of the zeros of ill-conditioned polynomials. Parts I and II, Numer. Math. 1 (1959) 150--180.
F.A. Willers, Practical Analysis (Dover, New York, 1948) 205--265.
F.A. Willers, Anschauliches zur Konvergens des Iterationsverfahrens Steffensen, Z. Angew. Math. Mech. 28 (4) (1948) 125--126.
J. Wimp, Derivative-free iteration processes, SIAM J. Numer. Anal. 7 (1970) 329--334.
M.A. Wolfe, Interval methods for algebraic equations, in: R.E. Moore, Ed., Reliability in Computing. International Workshop on the Role of Interval Mathematics in Scientific Computing (Academic Press, New York, 1988).
D. Woodhouse, A note on the secant method, BIT 15 (1975) 323--327.
H. Wozniakowski, Maximal stationary iterative methods for the solution of operator equations, SIAM J. Numer. Anal. 11 (1974) 939--949.
H. Wozniakowski, Numerical stability of iterations for solution of nonlinear equations and large linear systems, in: J.F. Traub, Ed., Analytic Computational Complexity (Academic Press, New York, 1976) 177--190.
H. Wozniakowski, Numerical stability for solving nonlinear equations, Numer. Math. 27 (1977) 373--390.
P. Wynn, On a device for computing the em(Sn) transformation, Math. Tables Aids Comput. 10 (1956) 91--95.
W. Xing-hua, On the convergence of King--Werner's iteration procedures for solving nonlinear equations, Math. Numer. Sinica 4 (1982) 70--79.
W. Xing-hua, On the error estimates for some numerical root-finding methods, Acta Math. Sinica 22 (1979) 638--642.
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.
J.G. Zhang, An iterative method of global convergence without derivatives in the class of smooth functions, J. Comput. Appl. Math. 43 (1992) 273--289.
J.G. Zhang, A family of iteration methods in C(R), with global convergence and without derivatives of higher order, Math. Numer. Sinica 7 (1) (1985) 14--23.
R. Zurmühl, Praktische Mathematik (Springer, Berlin, 1971).