G. Alefeld and J. Herzberger, Introduction to Interval Computations (Academic Press, New York, 1983) 67--119.
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).
G. Alefeld, On the convergence of some interval-arithmetic modifications of Newton's method, in: R. Steplemen et al., Eds., Scientific Computing (North-Holland, Amsterdam, 1983) 223--230.
G. Alefeld, Eine Modifikation des Newtonverfahrens zur Bestimmung der reellen Nullstellen einer reellen Function, Z. Angew. Math. Mech. 50 (1970) T32--T33.
G. Alefeld, On the order of convergence of the interval-Newton method, Computing 39 (1987) 363--369 (in German).
G. Alefeld, Uber das Divergenzverhalten des Intervall-Newton-Verfahrens, Computing 46 (1991) 289--294.
G. Alefeld, Bounding the slope of polynomial operators and some applications, Computing 26 (1981) 227--237.
G. Alefeld and N. Apostolatos, Praktische Anwendung von Abschätzungsformeln bei Iterationsverfahren, Z. Angew. Math. Mech. 48 (1968) T46--T49.
G. Alefeld and F. Potra, A new class of interval methods with higher order of convergence, Computing 42 (1989) 69--80.
N. Apostolatos, U. Kulisch and K. Nickel, Ein Einschliebungsverfahren für Nullstellen, Computing 2 (1967) 195--201.
N. Apostolatos, A method to compute the zeros of functions, Computing 15 (1975) 1--10.
D.W. Arthur, The use of interval arithmetic to bound the zeros of real polynomials, J. Inst. Math. Appl. 10 (1972) 231--237.
L. Atanassova and A Andreev, On some higher order interval methods, in: E. Kaucher et al., Eds., Computer arithmetic, scientific computation and mathematical modelling (Baltzer, Basel, 1991) 265--279.
L. Atanassova and J. Herzberger, A General Approach to Simultaneous Inclusion Methods for Polynomial Zeros, in: L. Atanassova and J. Herzberger, Eds., Computer Arithmetic and Enclosure Methods (Elsevier, 1992) 189--197.
W. Barth, An algorithm for the computation of all real zeros in an interval, Computing 9 (1972) 327--333.
W. Barth, Nullstellenbestimmung mit der Intervallrechnung, Computing 8 (1971) 320--328.
S. Bialas, Upper bounds for the abscissae of stability of a stable interval polynomial, Bull. Polish Acad. Sci. Math. 32 (1984) 1--9.
O. Caprani and K. Madsen, Contraction mappings in interval analysis, BIT 15 (1975) 362--366.
O. Caprani and K. Madsen, Iterative methods for inclusion of fixed points, BIT 18 (1978) 42--51.
C. Carstensen and M.S. Petkovic, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, J. Comput. Appl. Math. 45 (1993) 251--266.
C. Carstensen and M.S. Petkovic, On some interval methods for algebraic, exponential and trigonometric polynomials, Computing 51 (1993) 313--326.
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.
N.S. Dimitrova and S.M. Markov, Interval methods of Newton type for nonlinear equations, PLISKA Stud. Math. Bulgar. 5 (1983) 105--117.
A. Frommer and W. Straub, Error bounds for zeros of polynomials using complex circular arithmetic, Computing 40 (1988) 273--280.
G. Glatz, Newton-Algorithmen zur Bestimmung von Polynomwurzeln unter Verwendung komplexer Kreisarithmetik, in: K. Nickel, Ed., Interval Mathematics (Springer, Berlin 1975) 205--214.
K. Grüner, Solving complex problems for polynomials and linear systems with verified high accuracy, in: E. Kaucher et al., Eds., Computer Arithmetic-Scientific Computation and Programming Languages (Teubner, Stuttgart, 1987) 199--220.
J.A. Grant and G.D. Hitchins, The solution of polynomial equations in interval arithmetic, Comput. J. 16 (1973) 69--72.
E. Grassmann and J. Rokne, The range of values of a circular complex polynomial over a circular complex interval, Computing 23 (1979) 139--169.
D.K. Gupta and C.N. Kaul, A note on the computation of fixed points in interval analysis, Z. Angew. Math. Mech. 72 (1992) 607.
E. Hansen, Interval forms of Newton's method, Computing 20 (1978) 153--165.
E. Hansen, A globally convergent interval method for computing and bounding real roots, BIT 18 (1978) 415--424.
E.R. Hansen, On solving systems of equations using interval arithmetic, Math. Comp. 22 (1968) 374--384.
R.J. Hanson, Automatic error bounds for real roots of polynomials having interval coefficients, Comput. J. 13 (1970) 284--288.
P. Henrici, Circular arithmetic and the determination of polynomial zeros, in: J.L. Morris, Ed., Conference on Applications of Numerical Analysis, Lecture Notes in Math. 228 (Springer, Berlin, 1971) 86--92.
P. Henrici, Applied and Computational Complex Analysis (Wiley, New York, 1977).
P. Henrici, Zeros of polynomials and other topics, in: E. Hansen, Ed., Topics in Interval Analysis (Clarendon Press, Oxford, 1969) 25--34.
J. Herzberger, Multipoint-Iterationsformeln hoher Ordnung zur Einschliessung von reellen Nullstellen, Z. Angew. Math. Mech. 62 (1982) T331.
J. Herzberger, Über ein intervallmässiges Newton-Verfahren, Z. Angew. Math. Mech. 66 (1986) T413--T415.
J. Herzberger, On the R-order of some recurrences with applications to inclusion-methods, Computing 36 (1986) 175--180.
J. Herzberger, Bemerkungen zu einem Verfahren von R.E. Moore, Z. Angew. Math. Mech. 53 (1973) 356--358.
J. Herzberger, Über die Optimalität von Intervalliterationen, Z. Angew. Math. Mech. 65 (1985) T379--T381.
J. Herzberger, Über die Konvergenzordnungen einiger Klassen intervallmässiger Iterationsverfahren, Z. Angew. Math. Mech. 66 (1986) 509--511.
N. Kjurkchiev and S.M. Markov, Two interval methods for algebraic equations with real roots, Pliska: Studia Mathematica Bulgarica 5 (1983) 118--131.
R. Krawczyk and A. Neumaier, Interval slopes for rational functions and associated centered form, SIAM J. Numer. Anal. 22 (1985) 604--616.
R. Krawczyk, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing 4 (1969) 187--201.
R. Krawczyk, Einschliebung von Nullstellen mit Hilfe einer Intervallarithmetik, Computing 5 (1970) 356--370.
N. Krier and P. Spellucci, Einschliessungsmengen von Polynom-Nullstellen, in: K. Nickel, Ed., Interval Mathematics (Springer, Heidelberg, 1975) 223--228.
U. Kulisch and W.L. Miranker, Eds., A New Approach to Scientific Computation (Academic Press, New York, 1983) 42--45; 99--104; 121--137.
G.S. Ladd and M. Sambandham, Numerical treatment of random polynomials, Appl. Math. Comput. 55 (1993) 13--30.
M. Monsi and M.A. Wolfe, An algorithm for the simultaneous inclusion of real polynomial zeros, Appl. Math. Comput. 25 (1988) 333--346.
M. Monsi and M.A. Wolfe, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, Appl. Math. Comput. 28 (1989) 191--209.
R.E. Moore, Introduction to algebraic problems, in: E. Hansen, Ed., Topics in Interval Analysis (Oxford Univ. Press, Oxford, 1969) 3--10.
R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1960) Section 7.2.
R.E. Moore, Reliability in Computing: the Role of Interval Methods in Scientific Computations (Academic Press, New York, 1988).
R.M. Moore, Methods and Applications of Interval Analysis, SIAM Studies in Applied Mathematics, Philadelphia (1979).
A. Neumaier, An existence test for root clusters and multiple roots, Z. Angew. Math. Mech. 68 (1988) 256--257.
K. Nickel, Die vollautomatische Berechnung einer einfachen Nullstelle von F(t)=0 einschlieblich einer Fehlerabschätzung, Computing 2 (1967) 232--245.
K. Nickel, Triplex-Algol and its applications, in: E. Hansen, Ed., Topics in Interval Analysis (Clarendon Press, Oxford, 1969) 10--24.
K. Nickel, A globally convergent ball Newton method, SIAM J. Numer. Anal. 18 (1981) 988--1003.
K. Nickel, Zeros of polynomials and other topics, in: E. Hansen, Ed., Topics in Interval Analysis (Clarendon Press, Oxford, 1969) 25--34.
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.
L.D. Petkovic and M.S. Petkovic, On the kth root in circular arithmetic, Computing 33 (1984) 27--35.
L.D. Petkovic, A note on the evaluation in circular arithmetic, Z. Angew. Math. Mech. 66 (1986) 371--373.
M.S. Petkovic and J. Herzberger, Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic, Appl. Numer. Math. 7 (1991) 241--262.
M.S. Petkovic, On an interval Newton's method derived from exponential curve fitting, Z. Angew. Math. Mech. 61 (1981) 117--119.
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 and L.V. Stefanovic, On the convergence order of accelerated root iterations, Numer. Math. 44 (1984) 463--476.
M.S. Petkovic, A family of simultaneous methods for the determination of polynomial complex zeros, Internat. J. Comput. Math. 11 (1982) 285--296.
M.S. Petkovic, Generalized root iterations for the simultaneous determination of multiple complex zeros, Z. Angew. Math. Mech. 62 (1982) 627--630.
M.S. Petkovic, On the generalization of some algorithms for the simultaneous approximation of polynomial roots, in: K. Nickel, Ed., Interval Mathematics 80 (Academic Press, New York, 1980) 461--471.
M.S. Petkovic and C. Carstensen, Some improved inclusion methods for polynomial roots with Weierstrass' corrections, Comput. Math. Appl. 25 (3) (1993) 59--68.
M.S. Petkovic and J. Herzberger, Inclusion of multiple polynomials roots in complex rectangular arithmetic, in: E.~Kaucher et al., Eds., Computer arithmetic, scientific computation and mathematical modelling (Baltzer, Basel, 1991) 367--375.
M.S. Petkovic and D. Herceg, Higher-order iterative methods for approximating zeros of analytic functions, J. Comput. Appl. Math. 39 (1992) 243--258.
M.S. Petkovic, On the efficiency of some combined methods for polynomial complex zeros, J. Comput. Appl. Math. 30 (1) (1990) 99--115.
M.S. Petkovic, Schröder-like algorithms for multiple complex zeros of a polynomial, Computing 45 (1990) 39--50.
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, Inclusion methods for the zeros of analytic functions, in: L. Atanassova and J. Herzberger, Eds., Computer Arithmetic and Enclosure Methods (Elsevier, Amsterdam, 1992) 319--328.
M.S. Petkovic and L.D. Petkovic, A computational test for the existence of polynomial zero, Comput. Math. Appl. 17 (1989) 1109--1114.
M.S. Petkovic and Z. Mitrovic, A Halley-like hybrid method for solving polynomial equations, Z. Angew. Math. Mech. 72 (1992) 447--450.
M.S. Petkovic and Lj. Cvetkovic, A hybrid method for a polynomial complex zero, Comput. Math. Appl. 21 (2/3) (1991) 181--186.
M.S. Petkovic and L.D. Petkovic, On a representation of the kth root in complex circular interval arithmetic, in: K. Nickel, Ed., Interval Mathematics 80 (Academic Press, New York, 1980) 473--479.
H. Ratschek, Centered forms, SIAM J. Numer. Anal. 17 (1980) 656--662.
H. Ratschek and J. Rokne, About the centered form, SIAM J. Numer. Anal. 17 (1980) 333--337.
J. Rokne, Optimal computation of the Bernstein algorithm for the bound of an interval polynomial, Computing 28 (1982) 239--246.
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, A note on the Bernstein algorithm for bounds for interval polynomials, Computing 21 (1979) 159--170.
J. Rokne, Range of values of a complex polynomial over a complex interval, Computing 22 (1979) 153--169.
J. Rokne, Bounds for an interval polynomial, Computing 18 (1977) 225--240.
J. Rokne, The circular centered form, Computing 28 (1982) 17--30.
S.M. Rump, Solving algebraic problems with high accuracy, in: U. Kulisch and W.L. Miranker, Eds., A New Approach to Scientific Computing (Academic Press, New York, 1983) 51--120.
U. Schendel, Introduction to Numerical Methods for Parallel Computers (Wiley, New York, 1984) 105--118.
C.B. Soh, Necessary and sufficient conditions for interval polynomials to have only real distinct roots, Lin. Algebra Appl. 144 (1991) 121--133.
F. Stummel, Rounding error analysis of interval algorithms, Z. Angew. Math. Mech. 64 (1984) 341--354.
X. Wang and S. Zheng, The quasi-Newton method in parallel circular iterations, J. Comput. Math. 4 (1984) 305--309.
X. Wang, S. Zheng and G. Shen, Bell's disk polynomial and parallel disk iteration, Numer. Math. J. Chinese Univ. 4 (1987) 328--345.
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).
W. Xing-Hua and Z. Shi-ming, The quasi-Newton method in parallel circular iteration, J. Comput. Math. 3 305--309.
S. Zuhe and M.A. Wolfe, A ball Newton point algorithm for bounding zeros of analytic functions, Appl. Math. Comput. 36 (1990) 1--14.