E.G. Anastasselou, A formal comparison of the Delves--Lyness and Burniston--Siewart methods for locating zeros of analytic functions, IMA J. Numer. Anal. 6 (1986) 337--341.
E.G. Anastasselou and N.I. Ioakimidis, A new method for obtaining exact analytical formulae for the roots of transcendental equations, Lett. Math. Phys. 8 (1984) 135--143.
E.G. Anastasselou and D.E. Panayotounakos, Analytical solution of polynomial equations with an application to the quintic equation, Appl. Math. Comput. 21 (1987) 145--155.
E.G. Anastasselou and N.I. Ioakimidis, Application of the Cauchy theorem to the location of zeros of sectionally analytic functions, Z. Angew. Math. Phys. 35 (1984) 705--711.
E.G. Anastasselou and N.I. Ioakimidis, A generalization of the Siewart--Burniston method for the determination of zeros of analytic functions, J. Math. Phys. 25 (1984) 2422--2425.
E.G. Anastasselou and D.E. Panayotounakos, Analytical solution of polynomial equations with an application to the quintic equation, Appl. Math. Comput. 21 (1987) 145--155.
P.G. Anderson, M.R. Garey and L.E. Heindel, Computational aspects of deciding if all roots of a polynomial lie within the unit circle, Computing 16 (1976) 293--304.
M. Balfour and A.J. McTernan, The Numerical Solution of Equations (Heinemann, London, 1st ed., 1967).
E.J. Barbeau, Polynomials (Springer, New York, 1989).
M. Ben-Or, E. Feig, D. Kozen and P. Tiwari, A fast parallel algorithm for determining all roots of a polynomial with real roots, in: Proc. 18th Annual ACM Symp. on Theory of Computing (1986) 340--349; also: SIAM J. Comput. 17 (1988) 1081--1092.
L.C. Botten, M.S. Craig and R.C. McPhedran, Complex zeros of analytic functions, Comput. Phys. Comm. 29 (1983) 245--259.
O. Brudaru, Systolic arrays to solve non-linear equations by a non-iterative method, Analele Stiintifice Universitatea "Al I Cuza", Matematics S 33 (4) (1987) 305--310.
E.E. Burniston and C.E. Siewart, The use of Riemann problems in solving a class of transcendental equations, Proc. Cambridge Philos. Soc. 73 (1973) 111--118.
M.P. Carpentier and A.F. Dos Santos, Solution of equations involving analytic functions. J. Comput. Phys. 45 (1982) 210--220.
B. Davies, Locating the zeros of an analytic function, J. Comput. Phys. 66 (1986) 36--49.
L.M. Delves and J.N. Lyness, A numerical method for locating the zeros of an analytic function, Math. Comp. 21 (1967) 543--560.
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.
P.J. Erdelsky, Computing the Brouwer degree in R2, Math. Comp. 27 (1973) 133--137.
M.R. Farmer and G. Loizou, An algorithm for the total, or partial, factorization of a polynomial, Math. Proc. Cambridge Philos. Soc. 82 (1977) 427--437.
H. Fischer, Eine methode fur Einschliessung der Nullstellen von Polynomen mit komplexen Koeffizienten, Computing 4 (1969) 125.
E. Frank, Calculation of the zeros of a polynomial, Univ. Lisb. Rev. Fac. Ci. A Ser. 2 8 (1960) 5--19.
E. Frank, On methods for the location of the zeros of complex polynomials, Bull. Amer. Math. Soc. 53 (1947) 52.
A. Friedli, Optimal covering algorithms in methods of search for solving polynomial equations, J. Assoc. Comput. Mach. 20 (1973) 290--300.
A. Galántai, The comparison of numerical methods for solving polynomial equations, Math. Comp. 32 (1978) 391--397.
A. Galántai, Remarks on the optimization of the Lehmer--Schur method, Studia Sci. Math. Hungar. 24 (1989) 453--460.
I. Gargantini, Parallel algorithms for the determination of polynomial zeros, in: Proc. 3rd Manitoba Conf. on Numerical Mathematics, Winnipeg (1973) 195--211.
I. Gargantini, The numerical stability of the Schur--Cohn criterion, SIAM J. Numer. Anal. 8 (1971) 24--29.
W. Heitzinger, I. Troch and G. Valentin, Praxis Nichtlinearer Gleichungen (Hanser Verlag, München, 1985).
P. Henrici, Applied and Computational Complex Analysis (Wiley, New York, 1977).
P. Henrici and I. Gargantini, Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 77--113.
P. Henrici, Uniformly convergent algorithms for the simultaneous determination of all zeros of a polynomial, in: J.M. Ortega and W.C. Rheinboldt, Eds., Stud. Numer. Anal. 2 (SIAM, Philadelphia, PA, 1970) 1--8.
P. Henrici, Fast Fourier methods in computational analysis, SIAM Rev. 21 (1979) 481--527.
P. Henrici, Methods of search for solving polynomial equations, J. Assoc. Comput. Mach. 17 (1970) 273--283.
B.J. Hoenders and C.H. Slump, On the determination of the number and multiplicity of zeros of a function, Computing 47 (1992) 323--336.
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
N.I. Ioakimidis, On the simultaneous determination of zeros of analytic or sectionally analytic functions, Computing 36 (1986) 239--248.
N.I. Ioakimidis and E.G. Anastasselou, A new, simple approach to the derivation of exact analytical formulae for the zeros of analytic functions, Appl. Math. Comput. 17 (1985) 123--127.
N.I. Ioakimidis, A modification of the classical quadrature method for locating zeros of analytic functions, BIT 25 (1985) 681--688.
N.I. Ioakimidis, Closed-form solution of the equations of caustics about cracks in fracture mechanics, J. Franklin Inst. 317 (1984) 27--33.
N.I. Ioakimidis, Application of the Gauss quadrature rule to the numerical solution of nonlinear equations, Internat. J. Comput. Math. 18 (1986) 311--322.
N.I. Ioakimidis, Two elementary analytic formulae for roots of nonlinear equations, Appl. Anal. 20 (1985) 73--77.
N.I. Ioakimidis and E.G. Anastasselou, A modification of the Delves--Lyness method for locating the zeros of analytic functions, J. Comput. Phys. 59 (1985) 490--492.
N.I. Ioakimidis and E.G. Anastasselou, A simple quadrature-type method for the computation of real zeros of analytic functions in finite intervals, BIT 25 (1985) 242--249.
N.I. Ioakimidis and E.G. Anastasselou, An elementary noniterative quadrature-type method for the numerical solution of a nonlinear equation, Computing 37 (1986) 269--275.
N.I. Ioakimidis and K.E. Papadakis, A new class of quite elementary close-form integral formulae for roots of nonlinear equations, Appl. Math. Comput. 29 (1989) 185--196.
E.I. Jury, A modified stability table for linear discrete systems, Proc. IEEE 53 (1965) 184--185.
E.I. Jury and S.M. Ahn, Symmetric and innerwise matrices for the root-clustering and root-distribution of a polynomial, J. Franklin Inst. 293 (1972) 433--450.
P.S. Kamat and M. Zwass, On zero location with respect to the unit circle of discrete-time linear system polynomials, Proc. IEEE 73 (1985) 1686--1687.
H.W. Kuhn, Finding roots of polynomials by pivoting, in: S. Karamardian, Ed., Fixed Points, Algorithms and Applications (Academic Press, New York, 1977) 11--40.
D.H. Lehmer, A machine method for solving polynomial equations, J. Assoc. Comput. Mach. 8 (1961) 151--162.
D.H. Lehmer, Search procedures for polynomial equation solving, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 193--208.
T.Y. Li, On locating all zeros of an analytic function within a bounded domain by a revised Delves/Lyness method, SIAM J. Numer. Anal. 20 (1983) 865--871.
D. Loewenthal, Numerical computation of the roots of polynomials by spectral factorization, in: J.J.H. Miller, Ed., Topics in Numerical Analysis III (Academic Press, New York, 1977) 237--255.
D. Loewenthal, Improvements on the Lehmer-Schur root detection method, J. Comput. Phys. 109 (1993) 164--168.
D. Loewenthal, Numerical computation of the roots of polynomials by spectral factorization, in: J.J.H. Miller, Ed., Topics in Numerical Analysis III (Academic Press, London, 1977) 237--255.
J.N. Lyness and L.M. Delves, A numerical method for locating the zeros and poles of an analytic function, Math. Comp. 21 (1967) 543--560.
J.N. Lyness and L.M. Delves, On numerical contour integration round a closed contour, Math. Comp. 21 (1967) 561--577.
V.Y. Pan, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14 (1987) 591--622.
V.Y. Pan, Algebraic complexity of computing polynomial zeros, Comput. Math. Appl. 14 (1987) 285--304.
J.R. Pastor, On complex roots of algebraic equations, Rev. Mat. Hisp-Amer. Ser. 2 6 (1931) 129--150.
O.L. Rasmussen, Solution of polynomial equations by the method of D. Lehmer, BIT 4 (1964) 250--260.
G.W. Stewart, On Lehmer's method for finding zeros of a polynomial, Math. Comp. 23 (1969) 829--835; also: microfiche supp.
G.W. Stewart, Corrigendum to: On Lehmer's method for finding the zeros of a polynomial, Math. Comp. 25 (1971) 203.
P. Turan, On a New Method of Analysis and its Applications (Wiley, New York, 1984) 290--308.
R. Veysseyre, D. Boubel and J.P. Villemin, Nombre de zéros d'un polynôme intérieures à un cercle du plan complex, C.R. Acad. Sci. Paris Sér. A--B 274 (1972) A951--A954.
X. Ying and I.N. Katz, A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain, Numer. Math. 53 (1988) 143--163.