D.A. Adams, A stopping criteria for polynomial root finding, Comm. ACM 10 (1967) 655--658.
G. Alefeld, Existence of solutions and iterations for nonlinear equations, in: R.E. Moore, Ed., Reliability in Computing: The Role of Interval Methods in Scientific Computing (Academic Press, New York, 1988).
R. Alt, The use of the CESTAC method in the parallel computation of roots of polynomials, in: R. Vichnevetsky and J. Vignes, Eds., Numerical Mathematics and Applications (North-Holland, Amsterdam, 1986) 3--9.
R. Alt and J. Vignes, Stabilizing Bairstow's method, Comput. Math. Appl. 8 (1982) 379--387.
D.W. Arthur, The use of interval arithmetic to bound the zeros of real polynomials, J. Inst. Math. Appl. 10 (1972) 231--237.
K. Atkinson, An Introduction to Numerical Analysis (Wiley, New York, 1978) 39--106.
W. Börsch-Supan, A posteriori error bounds for the zeros of polynomials, Numer. Math. 5 (1963) 380--398.
W. Börsch-Supan, Defektabschätzungen für Polynom-Nullstellen, Z. Angew. Math. Mech. 42 (1962) T7--T8.
W. Börsch-Supan, Estimation of errors for zeros of a polynomial using Lagrangian interpolation, Numer. Math. 14 (1970) 287--296.
W. Barrett, On approximate factors of polynomials, Quart. J. Math. Oxford Ser. (2) 6 (1955) 293--300.
F.L. Bauer, Inclusion sets for roots of polynomials, Numer. Math. 9 (1966) 173--176.
R. Bhatia, L. Elsner and G. Krause, Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix, Lin. Algebra Appl. 142 (1990) 195--209.
J.A.C. Bingham, An improvement to iterative methods of polynomial factorization, Comm. ACM 10 (1967) 57--60.
A. Björck and G. Dahlquist, Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1974).
B. Boehm, A stopping criterion for polynomial root finding, CR 9 (1968) 395--396.
Z. Bohte and J. Grad, On composite polynomial deflation by quadratic factor, Glas. Mat. 12 (1977) 199--208.
D. Braess and K.P. Hadler, Simultaneous inclusion of the zeros of a polynomial, Numer. Math. 21 (1973) 161--165.
D.R. Brillinger, The analyticity of the roots of a polynomial as functions of the coefficients, Math. Mag. 39 (1966) 145--147.
M.D. Bronshtein, Smoothness of roots of polynomials depending on a parameter, Siberian Math. J. 20 (1979) 347--352.
C.G. Broyden and J.A. Ford, A new method of polynomial deflation, J. Inst. Math. Appl. 16 (1975) 271--281.
C.G. Broyden, Error propogation in numerical processes, J. Inst. Math. Appl. 14 (1974) 131--140.
H.A. Chase, Alternate convergence criteria for iterative methods of nonlinear equations, J. Franklin Inst. 317 (1984) 89--103.
F.L. Chernousko, An optimal algorithm for finding the roots of an approximately computed function, U.S.S.R. Comput. Math. and Math. Phys. 8 (4) (1968) 1--23.
D.B. Clegg, On Newton's method with a class of rational functions, J. Comput. Appl. Math. 7 (2) (1981) 93--100.
A.M. Cohen, Is the polynomial so perfidious?, Numer. Math. 68 (1994) 225--238.
J.L. Coolidge, The continuity of the roots of an algebraic equation, Ann. of Math. (2) 9 (1908) 116--118.
F. Cucker and A.G. Corbalan, An alternate proof of the continuity of the roots of a polynomial, Amer. Math. Monthly 96 (1989) 342--345.
R.H. Dargel, F.H. Loscalzo and T.H. Witt, Automatic error bounds on real zeros of rational functions, Comm. ACM 9 (1966) 806--809.
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.W. Demmel, On condition numbers and the distance to the nearest ill-posed problem, Numer. Math. 51 (1987) 251--289.
J.W. Demmel, The probability that a numerical analysis problem is difficult, Math. Comp. 50 (1988) 449--480.
J.W. Demmell, The geometry of ill-conditioning, J. Complexity 3 (1987) 201--229.
J. Descloux, Note on round-off errors in iterative processes, Math. Comp. 17 (1963) 18--27.
D.E. Dobbs and R. Hanks, A Modern Course on the Theory of Equations (Polygonal Publ. House, Passic, NJ, 1980).
D. Elliott, Error analysis of an algorithm for summing certain finite series, J. Austral. Math. Soc. 8 (1968) 213--221.
L. Elsner, A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem, Numer. Math. 21 (1973) 425--427.
R.T. Farouki and V.T. Rajan, On the numerical condition of polynomials in Bernstein form, Comput. Aided Geom. Design 4 (1987) 191--216.
R.T. Farouki and V.T. Rajan, Algorithms for polynomials in Bernstein form, Comput. Aided Geom. Design 5 (1988) 1--26.
E.I. Filippovich, The effect of rounding errors in iterational processes, U.S.S.R. Comput. Math. and Math. Phys. 25 (4) (1985) 7--13.
J.A. Ford, Weighted least-squares polynomial deflation, J. Inst. Math. Appl. 16 (1975) 263--269.
W.T. Ford, Polynomial deflation using regression analysis, SIAM J. Numer. Anal. 15 (1978) 219--223.
G.E. Forsythe, Pitfalls in computation, Amer. Math. Monthly 77 (1960) 931--944.
A. Frommer and W. Straub, Error bounds for zeros of polynomials using complex circular arithmetic, Computing 40 (1988) 273--280.
I. Gargantini, Further applications of circular arithmetic: Schroeder-like algorithms with error bounds for finding zeros of polynomials, SIAM J. Numer. Anal. 15 (1978) 497--510.
J.V. Garwick, The limit of a convergent sequence, BIT 1 (1961) 64.
W. Gautschi, Questions of numerical condition related to polynomials, in: C. de Boor and G.H. Golub, Eds., Recent Advances in Numerical Analysis (Academic Press, New York, 1978) 45--72.
W. Gautschi, On the condition of algebraic equations, Numer. Math. 21 (1973) 405--424.
W. Gautschi, The condition of polynomials in power form, Math. Comp. 33 (1979) 343--352.
W. Gautschi, Questions of numerical condition related to polynomials, in: G.H. Golub, Ed., MAA Stud. Numer. Anal. 24 (Math. Assoc. America, Washington, DC, 1984) 140--177.
W. Gautschi, The condition of orthogonal polynomials, Math. Comp. 26 (1972) 923--924.
J.A. Grant and A.A. Rahman, Determination of the zeros of a linear combination of generalized polynomials, J. Comput. Appl. Math. 42 (1992) 269--278.
M. Gutknecht, A posteriori error bounds for zeros of a polynomial, Numer. Math. 20 (1972) 139--148.
E. Hansen, A globally convergent interval method for computing and bounding real roots, BIT 18 (1978) 415--424.
R.J. Hanson, Automatic error bounds for real roots of polynomials having interval coefficients, Comput. J. 13 (1970) 284--288.
G. Harris and C. Martin, The roots of a polynomial vary continuously as a function of the coefficients, Proc. Amer. Math. Soc. 100 (1987) 390--392.
P. Henrici, Zeros of polynomials and other topics, in: E. Hansen, Ed., Topics in Interval Analysis (Clarendon Press, Oxford, 1969) 25--34.
J. Herzberger, A note on calculation zeros of an approximately computed function, Computing 10 (1972) 23--31.
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.
D.G. Hough, Explaining and ameliorating the ill-condition of zeros of polynomials, Ph.D. Thesis, Electronics Research Lab., Univ. California, Berkeley, CA, 1977.
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
M. Igarashi, A termination criterion for iterative methods used to find the zeros of polynomials, Math. Comp. 42 (1984) 165--171.
M. Igarashi, Zeros of polynomials and an estimation of its accuracy, J. Inform. Process. 5 (1982) 172--175.
M. Igarashi, Practical problems arising for finding roots of nonlinear equations, Appl. Numer. Math. 1 (1985) 433--455.
M. Igarashi, Practical stopping rule for finding roots of nonlinear equations, J. Comput. Appl. Math. 12--13 (1985) 371--380.
W. Kahan and I. Farkas, Algorithm 168 and Algorithm 169, Comm. ACM 6 (1963) 165.
O. Kallenberg, Stability in polynomial factorization, Math. Scand. 33 (1973) 18--20.
G.M. Krauss, Bounds for the variation of matrix eigenvalues and polynomial roots, Lin. Algebra Appl. 208/209 (1994) 73--82.
R. Krawczyk, Abbrechkriterium für Iterationsverfahren, Z. Angew. Math. Mech. 52 (1972) 227--232.
N. Krier and P. Spellucci, Einschliessungsmengen von Polynom-Nullstellen, in: K. Nickel, Ed., Interval Mathematics (Springer, Heidelberg, 1975) 223--228.
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.
J.-L. Rigal and N.H. Vinh, Sur une série d'indicateurs de stabilité des solutions numérique d'un polynôme normé, C.R. Acad. Sci. Paris 260 (1965) 1558--1559.
M. LaPorte and J. Vignes, Étude statistique des erreurs dans l'arithmétique des ordinateurs; application au contrôle des résultats d'algorithmes numériques, Numer. Math. 23 (1974) 63--72.
L. Leau, Note sur la continuité des racines d'une équation algébrique, Rev. Math. Spéc. 19 (1908--1909) 113--114.
B.W. Levinger and R.S. Varga, Minimal Gerschgorin sets, II, Pacific J. Math. 17 (1966) 199--210.
S. Linnaimaa, Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms, BIT 23 (1983) 346--359.
D. Mackie and T. Scott, Pitfalls in the use of computers for the Newton--Raphson method, Math. Gaz. 69 (1985) 252--257.
G.D. Majstrovskii, On the optimality of Newton's method, Soviet Math. Dokl. 13 (1972) 838--840.
J.M. McNamee, A comparison of methods for terminating polynomial iterations, J. Comput. Appl. Math. 21 (2) (1988) 239--244.
G. Miel, On a posteriori error estimates, Math. Comp. 31 (1977) 204--213.
J. Mills, D. Tall and M. Wardle, A quartic with a thousand roots, Math. Gaz. 74 (1990) 339--346.
L.J. Mordell, On a circular region enclosing a root of an algebraic equation, J. London Math. Soc. 4 (1929) 202--204.
R.G. Mosier, Root neighbourhoods of a polynomial, Math. Comp. 47 (1986) 265--273.
A. Neumaier, An existence test for root clusters and multiple roots, Z. Angew. Math. Mech. 68 (1988) 256--257.
A.C.R. Newbery, Polynomial evaluation schemes, Math. Comp. 29 (1975) 1046--1050.
A.C.R. Newbery, Error analysis for polynomial evaluation, Math. Comp. 28 (1974) 789--793.
K. Nickel, Zeros of polynomials and other topics, in: E. Hansen, Ed., Topics in Interval Analysis (Clarendon Press, Oxford, 1969) 25--34.
K. Nickel and K. Ritter, Termination criterion and numerical convergence, SIAM J. Numer. Anal. 9 (1972) 277--283.
K. Nickel, Error bounds for approximate roots of polynomials, Computing 6 (1970) 9--27.
K. Nickel, Stability and convergence of monotonic algorithms, J. Math. Anal. Appl. 54 (1976) 157--172.
E. Novak and K. Ritter, Average errors for zero finding: lower bounds, Math. Z. 211 (1992) 671--686.
C.J. O'Neill, A numerical accuracy consideration in polynomial deflation, Math. Comp. 32 (1978) 1144--1146.
K. Ohnaka, Y. Isomoto and S. Makinouchi, On a test of programs for numerical zeros of polynomials, Computing 25 (1980) 163--174.
F.W.J. Olver, Error bounds for polynomial evaluation and complex arithmetic, IMA J. Numer. Anal. 6 (1986) 373--379.
A. Ostrowski, Les estimations des erreurs a posteriori dans les procédés itératifs, C.R. Acad. Sci. Paris Sér. A 275 (1972) 275--278.
A.M. Ostrowski, A method for automatic solution of algebraic equations, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Equation of Algebra (Wiley/Interscience, New York, 1969) 209--224.
A.M. Ostrowski, The round-off stability of iterations, Z. Angew. Math. Mech. 47 (1967) 77--81.
A.M. Ostrowski, Sur la convergence, et l'estimation des erreurs dans quelques procédés de résolution des équations numériques, in: Collection of Papers in Memory of D.A. Grave (Moscow, 1940) 213--234.
A.M. Ostrowski, A theorem on clusters of roots of polynomial equations, SIAM J. Numer. Anal. 7 (1970) 567--570.
J.-P. Faye, Synchronised implementation of CESTAC, C.R. Acad. Sci. Paris 309 (1989) 637--640.
G. Peters and J.H. Wilkinson, Practical problems arising in the solution of polynomial equations, J. Inst. Math. Appl. 8 (1971) 16--35.
L. Petkovic, The analysis of the numerical stability of iterative methods using interval arithmetic, in: L. Atanassova and J. Herzberger, Eds., Computer Arithmetic and Enclosure Methods (Elsevier, 1992) 309--317.
M.S. Petkovic and L.V. Stefanovic, On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic, Computing 36 (1986) 249--261.
M.S. Petkovic and Lj. Cvetkovic, A hybrid method for a polynomial complex zero, Comput. Math. Appl. 21 (2/3) (1991) 181--186.
NATIONAL PHYSICAL LABORATORY, Modern Computing Methods, Her Majesty's Stationary Office, London (1961).
T. Pomentale, A class of iterative methods for holomorphic functions, Numer. Math. 18 (1971) 193--203.
J.D. Pryce, Round-off error analysis with fewer tears, Bull. Inst. Math. Appl. 17 (1981) 40--47.
V. Pták, Concerning the rate of convergence of Newton's process, Comment. Math. Univ. Carolin. 16 (1975) 699--705.
A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis (McGraw-Hill, New York, 2nd ed., 1987) 354.
J.R. Rice, A theory of condition, SIAM J. Numer. Anal. 3 (1966) 287--310.
J.R. Rice, On the conditioning of polynomial and rational forms, Numer. Math. 7 (1965) 426--435.
J. Rokne, Automatic errorbounds for simple zeros of analytic functions, Comm. ACM 16 (1973) 101--104.
J. Rokne and P. Lancaster, Automatic errorbounds for the approximate solution of equations, Computing 4 (1969) 294.
J. Rokne, Errorbounds for simple zeros of λ-matrices, Computing 16 (1976) 17--27.
L.M. Roytman and M.N.S. Swamy, An expression for the Jacobian of the roots of a polynomial, Proc. IEEE 68 (1980) 737--738.
S.M. Rump, Polynomial minimum root separation, Math. Comp. 33 (1979) 327--336.
T. Sasaki and M. Sasaki, Analysis of accuracy decreasing in polynomial remainder sequence with floating point number coefficients, J. Inform. Process. 12 (1989) 394--403.
J.B. Scarborough, Numerical Mathematical Analysis (Johns Hopkins Univ. Press, Baltimore, MD, 1968) Chapters 8, 10, 11.
J.W. Schmidt and H. Dressel, Fehlerabschätzung bei Polynomgleichungen mit dem Fixpunktsatz von Brouwer, Numer. Math. 10 (1967) 42--50.
L.F. Shampine and R.C. Allen, Numerical Computing: An Introduction (Saunders, Philadelphia, PA, 1973) 87--108; 242--245.
M. Shub and S. Smale, Complexity of Bezout's theorem III. Condition number and packing, J. Complexity 9 (1993) 4--14.
W. Sibagaki, On the idea of "numerical convergence" and its some applications, Mem. Fac. Sci. Kyushu Univ. Ser. A 5 (1950) 89--97.
B.T. Smith, Error bounds for zeros of a polynomial based upon Gershgorin's theorems, J. Assoc. Comput. Mach. 17 (1970) 661--674.
W. Specht, Zur Verteilung der Nullstellen komplexer Polynome, Math. Nachr. 21 (1960) 109--126.
R.S. Stepleman, A characterization of local convergence for fixed point iterations in R1, SIAM J. Numer. Anal. 12 (1975) 887--894.
R.S. Stepleman, Monotone convergence and effective stopping criteria for numerical processes, BIT 19 (1979) 278--281.
G.W. Stewart, Error analysis of the algorithm for shifting the zeros of a polynomial by synthetic division, Math. Comp. 25 (1971) 135--139.
J. Stoer and R. Bulirsch, Introduction to Numerical Analysis (Springer, New York, 1980) 270--299.
F. Stummel, Rounding error analysis of elementary numerical algorithms, in: G. Alefeld and R.D. Grigorieff, Eds., Fundamentals of Numerical Computation (Proc. Conf., Berlin, 1979), Computing, Suppl. 2 (1980) 169--195.
M. Tienari, On the control of floating-point mantissa length in iterative computations, in: A. Gunther, B. Levrat and H. Lipps, Eds., International Computing Symposium (Elsevier, New York, 1974) 315--322.
J. Todd, Basic Numerical Mathematics, Vol. 1: Numerical Mathematics (Birkhäuser, Basel, 1979).
J. Todd, On smallest isolated Gershgorin discs for eigenvalues, Numer. Math. 7 (1965) 171--175.
F. Uhlig, Are the coefficients of a polynomial well-conditioned functions of it roots?, Numer. Math. 61 (1992) 383--393.
M. Urabe, Error estimation in numerical solution of equations by iteration process, J. Sci. Hiroshima Univ. Ser. A-I 26 (1962) 77--91.
M. Urabe, Convergence of numerical iteration in solution of equations, J. Sci. Hiroshima Univ. Ser. A 19 (1956) 479--489.
A. van der Sluis, Domains of uncertainty for perturbed operator equations, Computing 5 (1970) 312--323.
J.S. Vandergraft, Introduction to Numerical Computations (Prentice-Hall, Englewood Cliffs, NJ, 1964).
R. Varga, On smallest isolated Gershgorin discs for eigenvalues, Numer. Math. 6 (1964) 366--376.
J. Vignes, New methods for evaluating the validity of the results of mathematical computations, Math. Comput. Simulation 20 (4) (1978) 227--249.
J. Vignes, Zéro mathématique et zéro informatique, C.R. Acad. Sci. Paris Sér. I 303 (1986) 997--1000.
N.H. Vinh, Approximation d'un vecteur et applications aux polynômes a coefficients incertains, in: Programmation en Mathématiques Numériques (1968) 57--62.
H. Weber, Traité d'Algèbra Supérieure (Gauthier-Villars, Paris, 1898).
W. Werner, A posteriori error bounds for polynomial zeros, Beitr. Numer. Math. 12 (1984) 205--211.
H.S. Wilf, The numerical solution of polynomial equations, in: A. Ralston and H.S. Wilf, Eds., Mathematical Methods for Digital Computers (Wiley, New York, 1960) 233--241.
J.H. Wilkinson, The evaluation of the zeros of ill-conditioned polynomials. Parts I and II, Numer. Math. 1 (1959) 150--180.
J.H. Wilkinson, Rounding Errors in Algebraic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1963) 34--78.
J.H. Wilkinson, The perfidious polynomial, in: G.H. Golub, Ed., Studies in Numerical Analysis (Math. Assoc. Amer., Washington, DC, 1984) 1--28.
F.A. Willers, Practical Analysis (Dover, New York, 1948) 205--265.
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.
W. Xing-hua, On the error estimates for some numerical root-finding methods, Acta Math. Sinica 22 (1979) 638--642.
T. Yamamoto, An existence theorem for solution of nonlinear systems and its application to algebraic equations, in: 3rd USA--Japan Computer Conf. Proc. (AFIPS Press, Reston, VA, 1978) 300--304.
S. Yamashita and S. Satake, On the calculation limit of roots of algebraic equations, Inform. Process. Japan 7 (1967) 18--23.
D.M. Young and R.T. Gregory, A Survey of Numerical Mathematics, Vol. I (Addison-Wesley, Reading, MA, 1972) 93--245.
M. Zedek, Continuity and location of zeros of linear combinations of polynomials, Proc. Amer. Math. Soc. 16 (1965) 78--84.