G. Adomian and R. Bach, On the solution of algebraic equations by the decomposition method, J. Math. Anal. Appl. 105 (1985) 141--166.
A.C. Aitken, The contributions of E.T. Whittaker to algebra and numerical analysis, Proc. Edinburgh Math. Soc. 11 (1958) 31--38.
A.C. Aitken, A series formula for the roots of algebraic and transcendental equations, Proc. Roy. Soc. Edinburgh 45 (1925) 14--22.
A.G. Akritas, A new method for polynomial real root isolation, Proc. 16th Annual Southeast Regional ACM Conf., Atlanta, GA (1978) 39--43.
A.G. Akritas and S.D. Danielopoulos, On the complexity of algorithms for the translation of polynomials, Computing 24 (1980) 51--60.
J. Albrecht, Zur simultanen Einkreisung sämtlicher Nullstellen eines Polynoms, Z. Angew. Math. Mech. 43 (1963) 377--379.
L.E. Aldritch, Solution of algebraic equations, J. Franklin Inst. 256 (1953) 59--69.
G. Alefeld und J. Herzberger, Einführung in die Intervallrechnung (Bibliographisches Institut AG, Zürich, 1974).
W.J. Alexander, Certification of Algorithm 30, Comm. ACM 3 238.
T. Anghelutza, Sur une limite des modules des zéros des polynômes, Bull. Sect. Sci. 21 (1939) 211--213.
T. Anghelutza, Sur une équation algebrique: application à la formule de Taylor, Mathematica 6 (1932) 140--145.
E. Aparo, Un procedimento iterivo per la risoluzione numerica delle equazione algebriche, Ricerva Sci. 24 (1954) 1003--1005.
E. Aparo, Applicazione di un nuovo metodo per la risoluzione numerica delle equazione algebriche, Bol. Soc. Port. Mat. Ser. A 1 (1948) 49--57.
B.H. Arnold, A topological proof of the fundamental theorem of algebra, Amer. Math. Monthly 56 (1949) 465--466.
A. Aziz, On a property of rational functions, Aligarh Bull. Math. 9 (10) (1979) 1--4.
M. Bôcher, A problem in statics and its relation to certain algebraic invariants, Proc. Amer. Acad. Arts Sci. 40 (1904) 469--484.
E. Bach and V. Shoup, Factoring polynomials using fewer random bits, J. Symbol. Comp. 9 (1990) 229--239.
K.H. Bachmann, Lösung algebraischer Gleichungen nach der Methode des stärksten Abstiegs, Z. Angew. Math. Mech. 40 (1960) 132--135.
L. Bairstow, The solution of algebraic equations with numerical coefficients in the case where several pairs of complex roots exist, Tech. Rep., Advisory Committee for Aeronautics (1914--1915) 239--252.
S. Barnett, A matrix circle in linear control theory, Bull. Inst. Math. Appl. 12 (1976) 173--177.
S. Barnett, Euclidean remainders and the Routh array from an observability matrix, in: Preprints 10th World Congress on Automatic Control, 9 (IFAC, Munich, 1987) 34--39.
P. Barrucand, Quelques polynômes a zeros reels, C.R. Acad. Sci. Paris Sér. A--B 277 (1973) A93--A96.
D.R. Barton and R.E. Zippel, A Polynomial Decomposition Algorithm, in: R.D. Jenks, Ed., Proc. 1976 Symposium on Symbolic and Algebraic Computation (ACM, New York, 1976) 356--358.
E. Batschelet, Über die Abschätzung der Wurzeln algebraischer Gleichungen, Elem. Math. 1 (1946) 73--81.
E. Batschelet, Über die absoluten Beträge der Wurzeln algebraischer Gleichungen, Acta Math. 76 (1945) 253--260.
E. Batschelet, Über die Schranken fur die absoluten Beträge der Wurzeln von Polynomen, Comment. Math. Helv. 17 (1945) 128--134.
M. Bauer, Zur Bestimmung der reellen Wurzeln einer algebraischen Gleichung durch Iteration, Jahresber. Deutsch. Math.-Verein. 25 (1917) 294--301.
F. Bauhuber, Praktische Verfahren zur Aufstellung des Hurwitz-Polynoms in der Filtersynthese, Nachrichtentechnik 9 (1956) 573--580.
L. Baur, Über die verschiedenen Wurzeln einer algebraischen Gleichung und deren Ordnungen, Math. Ann. 50 (1898) 241--246; Math. Ann. 52 (1899) 113--119.
B. Beauzamy, Polynomials with complex coefficients: Size of the factors, repartition of the zeros, Appl. Anal. 41 (1991) 193--201.
E.C. Belaga, Some problems in the computation of polynomials, Dokl. Akad. Nauk SSSR 123 (1958) 775--777.
G.A. Bendrikov and K.F. Teodorchik, The laws of root migration for third and fourth power linear algebraic equations as the free terms change continuously, Automat. Remote Control 16 (3) (1955).
E. Benz, Über lineare, verschienungstreue Funktionaloperationen und die Nullstellen ganzer Funktionen, Comment. Math. Helv. 7 (1935) 243--289.
L. Berg, Abschätzung von Nullstellen eines Polynoms, Z. Angew. Math. Mech. 67 (1987) 57--58.
E.R. Berlekamp, Factoring polynomials over finite fields, Bell System Tech. J. 46 (1967) 1853--1859.
D. Bernoulli, Comment. Acad. Sci. Petrop. 3 (1732).
D. Bernoulli, Observationes de Seriebus, Comment. Acad. Sci. Petrop. 3 (1728) 85--100.
L. Berwald, Über die Lage der Nullstellen von Linearkombination eines Polynoms und seiner Ableitungen in bezug auf einem Punkt, Tôhoku Math. J. 37 (1933) 52--68.
L. Berwald, Über einige mit dem Satz von Kakeya verwandte Sätze, Math. Z. 37 (1933) 61--76.
W.A. Beyer, A note on starting the Newton--Raphson method, Comm. ACM 7 (1964) 442.
M. Biehler, Sur une classe d'équations algébriques dont toutes les racines sont réelles, J. Reine Angew. Math. 87 (1879) 350--352; also: Nouv. Ann. Math. 19 (1880) 149--152.
M. Biernacki, Sur les équations numériques contenant des paramètres arbitraires, Bull. Acad. Polon. Sci. Lett. Cl. Sci. Math. Nat. Ser. A (1927) 541--685.
M. Biernacki, Sur les zéros des polynômes, Ann. Univ. Mariae Curie-Sklodowska Sect. A 9 (1955) 81--98.
O. Blumenthal, Über rationale Polynome mit einer Minimumeigenschaft, J. Reine Angew. Math. 165 (1931) 237--246.
R.P. Boas, Inequalities for polynomials with a prescribed zero, in: G. Szegö et al., Eds., Studies in Mathematical Analysis and Related Topics (Stanford Univ. Press, Stanford, CA, 1962) 42--47.
G. Boese, Einschluss von Exponentialpolynomen mit konstanten Koeffizienten, Z. Angew. Math. Mech. 62 (1982) T317--T320.
P. Bohl, Zur Theorie der trinomischen Gleichungen, Math. Ann. 65 (1908) 556--566.
E. Bombieri and J.D. Vaaler, Polynomials with low height and prescribed vanishing, in: Proc. Conf. on Number Theory, Stillwater, OK (1984).
A.D. Booth, An application of the method of steepest descent to the solution of systems of non-linear simultaneous equations, Quart. J. Mech. Appl. Math. 2 (1949) 460--468.
R.S. Booth, Location of zeros of derivatives, SIAM J. Appl. Math. 15 (1967) 1496--1501; ibid. 17 (1969) 409--415.
F.H. Branin Jr, Poles and zeroes, eigenvalues of matrices as roots oF polynomials by the method of signatures, in: Proc. 19th IEEE Internat. Symp. on Circuits and Systems (1977) 89--94.
F.H. Branin Jr, A systematic method for finding all the roots of a polynomial, in: Proc. 19th Midwest Symp. on Circuits and Systems (1976) 59--62.
D.A. Brannan, Coefficient regions for univalent polynomials of small degree, Mathematika 14 (1967) 165--169.
A. Brauer, Some remarks on the location of the roots of an algebraic equation, Amer. Math. Monthly 63 (1956) 530.
R.P. Brent, Efficient methods for finding zeros of functions whose derivatives are easy to evaluate, Dept. Comput. Sci., Carnegie-Mellon Univ., 1974.
H. Brolin, Invariant sets under iterations of rational functions, Ark. Mat. 6 (1966) 103--144.
L.E.J. Brouwer and B. de Loor, Intuitionistische Ergänzung des Fundamentalsatzes der Algebra, Nederl. Akad. Wetensch. Proc. 27 (1924) 631--634.
D. Budan, Nouvelle Méthode pour la Résolution des Équations de Degré Quelquonque (Paris, 1807).
S. Burgstahler, An algorithm for solving polynomial equations, Amer. Math. Monthly 93 (1986) 421--430.
C. Carstensen and E. Stein, Über die Falksche ECP-Transformation und Verallgemeinerung, Z. Angew. Math. Mech. 69 375--391.
E. Carvalho, Méthode practique pour la résolution numérique complète des équations algébriques ou transcendantes, Doctoral Thesis, Paris, 1890.
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, Mémoire sur la détermination du nombre des racines réelles dans les équations algébriques, J. École Poly. 17 (1815) 457; also: in: Oeuvres Complètes Sér. 2 1 (Gauthier-Villars, Paris) 170--257.
A. Cauchy, Mémoire sur les rapports qui existent entre le calcul de résidus et le calcul de limites et sur les avantages qu'offrent ces deux nouveaux calculs dans la résolution des équations algébriques ou transcendantes, Turin, 1831.
A.L. Cauchy, Exercises de Mathématiques, Quatrième année De Bure Frères, Paris (1829), Oeuvres Ser. II 9 (Gauthier-Villars, Paris, 1891).
A. Cayley, Note sur les fonctions de M. Sturm, J. Math. Pures Appl. 11 (1846) 297--299.
L. Cerlienco, G. Delogu and F. Piras, Prodotti esterni di s.r.l. e metodi per la ricerca approssimata delle radici di un polinomio, Rend. Sem. Fac. Sci. Univ. Cagliari 50 (suppl.) (1980) 177--191.
L. Cerlienco and F. Piras, Successioni ricorrenti lineari e divisione di polinomi, Rend. Sem. Fac. Sci. Univ. Cagliari 49 (3--4) (1979).
W.P. Champagne, On finding roots of polynomials by hook or by crook, Master's Thesis, TNN-37, Univ. Texas, 1964.
V.M. Chevskii, Some inequalities for algebraic polynomials, Ukrainian Math. J. 38 (1) (1986) 111--113.
J. Chion, Une méthode d'utilisation de l'algorithme de Routh dans la résolution des equations algébrique, RAIRO Sér. Bleue 2 (1968) 3--12.
S. Chou, On the roots of polynomials with concentration at low degrees, J. Math. Anal. Appl. 149 (1990) 424--436.
L. Collatz, Iterationsverfahren für komplexe Nullstellen algebraischer Gleichungen, Z. Angew. Math. Mech. 30 (1950) 97--101.
G.E. Collins and E. Horowitz, Minimum root separation of a polynomial, Math. Comp. 28 (126) (1974) 589--597.
A. Connes, Ordres faibles et localisation de zeros de polynômes, Séminaire Delange--Pisot--Poitou (12e annee: 1970-1971), Theorie des Nombres, Exp. No. 18, Secr. Math., Paris, 1972.
S.D. Conte and C. de Boor, Elementary Numerical Analysis (McGraw-Hill, New York, 1981) 27--90.
E. Cook, Approximating the zeros of a polynomial, Math. Mag. 35 (1962) 165--172.
M. Cosnard, Caractérisations de la convergence de la méthode des approximations successive, RAIRO 11 (1977) 225--240.
T. Craven and G. Csordas, On the betweenness condition of Rolle's theorem, Rocky Mountain J. Math. 15 (1985) 721--728.
T. Craven and G. Csordas, On the Gauss--Lucas theorem and Jensen polynomials, Trans. Amer. Math. Soc. 278 (1983) 415--429.
T. Craven and G. Csordas, Location of zeros. II. Ordered fields, Illinois J. Math. 27 (1983) 279--299.
T. Craven and G. Csordas, Location of zeros. I. Real polynomials and entire functions, Illinois J. Math. 27 (1983) 244--278.
J.N. Darroch and J. Pitman, Note on a property of the elementary symmetric functions, Proc. Amer. Math. Soc. 16 (1965) 1132--1133.
J.H. Davenport and M. Mignotte, On finding the largest root of a polynomial, Modelisation Mathematique et Analyse Numerique 24 (1990) 693--696.
D.F. Davidenko, On a new method of variation of parameters to the construction of iterative formulas of increased accuracy for numerical solutions of nonlinear equations, Dokl. Akad. Nauk SSSR 162 (1965) 702--706.
D.F. Davidenko, On a new method of numerical solution of systems of nonlinear equations, Dokl. Akad. Nauk SSSR 88 (1953) 601--602 (in Russian).
J.P. De Gua, Demonstration de la règle de Descartes, Hist. Acad. Roy. Sci. Mem. (1741) 72--96.
N.G. De Bruijn and T.A. Springer, On the zeros of composition-polynomials, Indag. Math. 9 (1947) 406--414.
B. Dejon and K. Nickel, A never failing, fast convergent root-finding algorithm, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 1--35.
H. Delange, Sur certains suites de polynomes, C.R. Acad. Sci. Paris 217 (1943) 191--193.
M.H. Delange, Sur les suites de polynomes ou de fonctions entières a zéros réels, Ann. Sci. Ecole Norm. Sup. Ser. 3 62 (1945) 115--183.
J.E. Dennis, J.F. Traub and R.P. Weber, The algebraic theory of matrix polynomials, SIAM J. Numer. Anal. 13 (1976) 831--845.
G. Di Lena, A fixed-point theorem intended for the calculation of real zeros of a function, Calcolo 17 (1980) 31--40.
J.D.H. Dickson, Least roots of equations, Trans. Roy. Soc. Edinburgh 28 (1877) 119--133.
J. Dieudonné, La Théorie Analytique des Polynômes d'une Variable (à Coefficients Quelconques), Mém. Sci. Math. 93 (Hermann, Paris, 1938).
J. Dieudonné, Sur le théorème de Grace et les relations algébriques analogues, Bull. Soc. Math. France 60 (1932) 173--196.
E.A. Dimova, On the localization of the zeros of some composed polynomials, in: Complex Analysis and Applications, Varna 83 (Bulgar. Acad. Sci., Sofia, 1985) 36--44.
J.D. Donaldson and Q.I. Rahman, Inequalities for polynomials with a prescribed zero, Pacific J. Math. 41 (1972) 375--378.
L.N. Dordjevic, An iterative solution of algebraic equations with a parameter to accelerate convergence, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 449 (1973) 179--182.
A. Douady and J. Hubbard, Étude dynamique des polynômes complexes, Publ. Math. Orsay (1984--1985).
A. Douady, Systèmes dynamiques holomorphes, Sém. Bourbaki 599.
J. Drewniak, J. Kalinowski and B. Ulewicz, On the behaviour of continuous real functions in the neighbourhood of a fixed point, Aequationes Math. 14 (1976) 123--136.
O. Dunkel, Sufficient conditions for imaginary roots of algebraic equations, Ann. of Math. (2) 10 (1908--1909) 46--54.
O. Dunkel, Solution of problem 2803, Amer. Math. Monthly 33 (1926) 229--232.
O. Dunkel, Generalized geometric means and algebraic equations, Ann. of Math. (2) 11 (1909) 21--32.
R Dussaud, Sur l'affect des équations numérique et les sous-groupes du groupe symétrique, C.R. Acad. Sci. Paris 266A (1968) 757--759.
M. Eichler, Zur numerischen Lösung von Gleichungen mit reellen Koeffizienten, J. Reine Angew. Math. 184 (1942) 124--128.
J.A. Eidsmick, A proof of Newton's power sum formulas, Amer. Math. Monthly 75 (1968) 396--397.
L. Eisenberg, Approximate roots of nth order polynomials, IEEE Trans. Automat. Control 10 (1965) 354--356.
P. Erdös and P. Turán, On the uniformly dense distribution of certain sequences of points, Ann. of Math. (2) 41 (1940) 162--173.
P. Erdös and H. Fried, On the connection between gaps in power series and the roots of their partial sums, Trans. Amer. Math. Soc. 62 (1947) 53--61.
L. Euler, Nova criteria radices aequationum imaginarias dignoscendi, in: Opera Omnia Ser. 1 6 (Teubner, Leipzig, 1921) 212--239.
L. Euler, Institutiones Calculi Differentialis, in: Opera Omnia Ser. 1 10 (Teubner, Leipzig, 1913) 422--455, 501--542.
L. Euler, De usu serierum recurrentium in radicibus aequationum indagandis, in: Opera Omnia Ser. 1 8 (Teubner, Leipzig) 339--361.
L. Euler, De usu calculi differentialis in aequationibus resolvendis, Opera Omnia Ser. 1, Vol. 10 (Teubner, Leipzig, 1921) 422--455.
G. Faber, Über die Newtonsche Näherungsformel, J. Reine Angew. Math. 138 (1910) 1--21.
M.A. Farag and M. Nassif, On regular sets of polynomials whose zeros lie in prescribed domains, J. Res. Nat. Bur. Standards 76B (1972) 153--159.
R.J. Fateman, An algorithm for deciding the convergence of the rational iteration Xn+1=f(xn), ACM Trans. Math. Software 3 (1977) 272--278.
J. Favard, Sur les zéros réels des polynômes, Bull. Soc. Math. France 59 (1931) 229--255.
J. Favard, Sur les zéros des polynômes, C.R. Acad. Sci. Paris 192 (1931) 716--718.
J. Fayard, Sur les zéros réels des polynômes, Bull. Soc. Math. France 59 (1931) 229--255.
L. Fejer, Über die Lage der Nullstellen von Polynomen die aus Minimumforderungen gewisser Art entspringen, Math. Ann. 85 (1922) 41--48.
L. Fejer, Sur les polynômes trigonométriques, C.R. Acad. Sci. Paris 157 (1913) 571--574.
L. Fejer, Einige Sätze, die sich aus das Vorseichen einer ganzen rationalen Function beziehen;..., Monatsh. Math. Phys. 35 (1928) 313--344.
L. Fejer, Über die Kreisgebiete, in denen eine Wurzel einer algebraischen Gleichung liegt, Jahresber. Deutsch. Math.-Verein. 26 (1917) 114--128.
L. Fejer, Über trigonometrische Polynome, J. Reine Angew. Math. 146 (1915) 53--82.
M. Fekete, On the structure of extremal polynomials, U.S. Nat. Acad. Sci. Proc. 37 (1951) 95--103.
M. Fekete, Über Gebiete, in denen komplexe Polynome jeden Wert zwischen zwei gegebenen annehmen, Math. Z. 22 (1925) 1--7.
M. Fekete and J.L. Walsh, On restricted infrapolynomials, J. Analyse Math. 5 (1957) 47--76.
M. Fekete and J.L. Walsh, Asymptotic behaviour of restricted extremal polynomials and of their zeros, Pacific J. Math. 7 (1957) 1037--1064.
M. Fekete and G. Polya, Über ein Problem von Laguerre, Rend. Circ. Mat. Palermo 34 (1912) 89--100.
M. Fekete and J. Von Neumann, Über die Lage der Nullstellen gewisser Minimumpolynome, Jahresber. Deutsch. Math.-Verein. 31 (1922) 125--138.
M. Fekete and J.L. Walsh, On the asymptotic behaviour of polynomials with extremal properties, and of their zeros, J. Analyse Math. 4 (1955) 49--87.
H.J. Fell, On the zeros of convex combinations of polynomials, Pacific J. Math. 89 (1980) 43--50.
L. Finzel, Untersuchungen über die wahrscheinliche Lage der Wurzeln reeller algebraischer Gleichungen, Math. Nachr. 11 (1954) 85--104.
C. Flanagan and J.E. Maxfield, Estimates of the roots of certain polynomials, J. Soc. Indust. Appl. Math. 7 (1959) 367--373.
M.G. Fouret, Sur certains types d'équations algébriques ayant toutes leurs racines réelles, C.R. Acad. Sci. Paris 106 (1888) 1220--1222.
J.B.J. Fourier, Sur l'usage du théorème de Descartes dans la recherche des limits des racines, Bull. Sci. Soc. Philos. Paris (1820) 156--165; 181--187.
R.A. Frazer and W.J. Duncan, On the numerical solution of equations with complex roots, Proc. Roy. Soc. London 125 (1929) 68--82.
J. Friedman, A density theorem for purely iterative zero finding methods, SIAM J. Comput. 19 (1990) 124--132.
G. Frobenius, Über Relationen zwischen Näherungsbrüchen von Potenzreihen, J. Reine Angew. Math. 90 (1880) 1--17.
W.D. Fryer, Applications of Routh's algorithm to network theory problems, IEEE Trans. Circuit Theory 6 (1959) 144--149.
M. Fujiwara, Über definite Polynome, Tôhoku Math. J. 6 (1914) 20--26.
H.G. Funkhauser, A short account of the history of symmetric functions of roots of equations, Amer. Math. Monthly 37 (1930) 357--365.
R. Güting, Polynomials with multiple zeros, Mathematika 14 (1967) 181--196.
G.S. Ganshin, Calculation of the real roots of a polynomial, U.S.S.R. Comput. Math. and Math. Phys. 11 (6) (1971) 283--287.
I. Gargantini, Recent results on the square-root iteration, in: R. Thomas and H.C. Williams, Eds., Proc. VIII Manitoba Conf. on Numerical Mathematics and Computing (Utilitas Math., Winnipeg, 1978) 205--215.
R.M. Garver, Determinants and the real roots of an equation, Bull. Amer. Math. Soc. 37 (1931) 350.
C.F. Gauss, Demonstratio nova theorematis omnem functionem algebraicam rationalem integram unius variabilis in factores primi vel secundi gradus resolvi posse, in: Werke 3 (1794) 1--30; 67; 112; and 8 (1794) 32.
R. Gelca, A short proof of a result on polynomials, Amer. Math. Monthly 100 (1993) 936--937.
N. Georgieva, Distribution of the zeros of one class of polynomials, Fibonacci Quart. 13 (1975) 312--314.
S. Ghaderpanah and S. Klasa, Polynomial scaling, SIAM J. Numer. Anal. 27 (1990) 117--135.
J.C. Giguerre, V. Ramachandran and M.N.S. Swamy, A proof for Talbot's conjecture, IEEE Trans. Circuits and Systems 21 (1974) 154--155.
Y. Glénisson and L. Derwidué, Une nouvelle méthode de calcul des zéros des polynômes, Acad. Roy. Belg. Bull. Cl. Sci. (5) 45 (1959) 197--204.
G. Glatz, Stabile Deflationsalgorithmen bei der numerischen Berechnung von Polynomnullstellen, Z. Angew. Math. Mech. 58 (1978) T416--418.
Y. Glenisson and L. Derwidue, Une nouvelle methode de calcul des zeros de polynomes, Acad. Roy. Belg. Bull. Cl. Sci. Ser. 5 4 (1959) 197--204.
O.E. Glenn, The theory of degenerate algebraic curves and surfaces, Amer. J. Math. 32 (1910) 75--100.
S. Goedecker, Remark on algorithms to find roots of polynomials, SIAM J. Sci. Comput. 15 (1994) 1059--1063.
I. Gohberg, P. Lancaster and L. Rodman, Spectral analysis of matrix polynomials, Linear Algebra Appl. 20 (1978) 1--44.
M. Golomb, Zeros and poles of functions defined by Taylor series, Bull. Amer. Math. Soc. 49 (1943) 581--592.
I.J. Good, The colleague matrix, a Chebyshev analogue of the companion matrix, Quart. J. Math. Oxford 12 (1961) 61--68.
R.L. Goodstein, A constructive form of the second Gauss proof of the fundamental theorem of algebra, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 69--76.
M.S. Gornstein, Numerische Lösung von Gleichungen, Dokl. Akad. Nauk SSSR 78 (2) (1951) 193--196 (in Russian).
N.K. Govil and V.K. Jain, On the Eneström--Kakeya theorem, Ann. Univ. Mariae Curie-Sklodowska Sect. A 27 (1973) 13--18.
N.V. Govorov and J.P. Lapenko, Lower bounds for the modulus of the logarithmic derivative of a polynomial, Mat. Zametki 23 (1978) 527--535.
M.-H. Kim, Topological complexity of a root finding algorithm, J. Complexity 5 (1989) 331--344.
M.-H. Kim and S. Sutherland, Polynomial root-finding algorithms and branched covers, SIAM J. Comput. 23 (1994) 415--436.
N.B. Haaser and J.A. Sullivan, Real Analysis (Van Nostrand Reinhold, New York, 1977) Chapter 5, Section 2 .
G. Haenzel, Ein neuer Satz über die Nullstellen ganzer rationaler Funktionen, Sitzungsber. Berliner Math. Ges. 27 (1928) 16--19.
W.R. Hamilton, Transforming and resolving equations of elevated degrees, Rep. British Assoc. 6 (1836) 295--348.
R. Hammer et al, Numerical Toolbox for Verified Computing with Algorithms and Pascal-XSC Programs (Springer, New York, 1993) 57--68; 87--104; 152--172.
T. Harriot, Artis Analyticae Praxis (1631).
J. Hartmanis and R.E. Stearns, Computational complexity of recursive sequences, in: Proc. Fifth Annual Symp. on Switching Circuit Theory and Logical Design (1964) 8--90.
L. Hayafil and H.T. Kung, Bounds on the speed-up of parallel evaluation of recurrences, in: Proc. Second USA-Japan Computer Conference (1975) 178--182.
W.K. Hayman, Research Problems in Function Theory (Athlone Press (Univ. of London), London, 1967) 24.
A.C. Hearn, An improved non-modular GCD algorithm, SIGSAM Bull. 6 (1972) 10--15.
P.J. Heawood, Geometrical relations between the roots of f(x)=0, f'(x)=0, Quart. J. Pure Appl. Math. 38 (1907) 84--107.
F. Heigl, Zur Verteilung der Wurzeln algebraischer Gleichungen, Monatsh. Math. 66 (1962) 313--321.
F. Heigl, Einige Schranken für die Absolutbeträge der Wurzeln algebraischer Gleichungen, Monatsh. Math. 63 (1959) 287--297.
F. Heigl, Über die Abschätzung der Wurzeln algebraischer Gleichungen, Monatsh. Math. B62 (1958) 16--55.
H. Heinrich, Zur Vorbehandlung algebraischer Gleichungen, Z. Angew. Math. Mech. 36 (1956) 145--148.
H. Heinrich, Schrittweise Verbesserung einer Eingrenzung der Eigenwerte einer Matrix und der Nullstellen eines Polynoms, Z. Angew. Math. Mech. 42 (1962) 343--355.
J. Heintz, On polynomials with symmetric Galois group which are easy to compute, Theoret. Comput. Sci. 47 (1986) 99--105.
P.E. Hennion, Reduction of a matrix containing polynomial elements (Algorithm 170), Comm. ACM 6 (1963) 165.
K. Hensel, Über die Grundlagen einer neuen Theorie der quadratischen Zahlkörper, J. Reine Angew. Math. 144 (1914) 57--70.
K. Hensel, Zahlentheorie (Goschen, Berlin, 1913).
K. Hensel, Theorie der Algebraischen Zahlen (Teubner, Leipzig, 1908) Chapter 4.
C. Hermite, Le nombre limité d'irrationalités auxquelle se réduisent les racines des équations a coefficients entiers complexes d'une degré et d'un discriminant données, J. Reine Angew. Math. 53 (1856).
C. Hermite, Sur les fonctions algébriques, C.R. Acad. Sci. Paris 32 (1851) 458--461.
J. Herzberger, Über ein Verfahren zur Bestimmung reeller Nullstellen mit Anwendung auf Parallelrechnung, Elek. Rech. 14 (1972) 250--254.
H.W. Hethcote, Error bounds for asymptotic approximations of zeros of transcendental functions, SIAM J. Math. Anal. 1 (1970) 147--152.
T.J. Higgins, R.P. Agnew, J.B. Rosser and R.J. Walker, Note on Whittaker's method for the roots of a power series, Amer. Math. Monthly 49 (1942) 462--465.
V. Horák, Zu einer Lösungsmethode der algebraischen Gleichungen mit vielen komplexen Wurzelpaaren nach dem Graeffeschen Verfahren, Casopis Pest. Mat. 82 (1957) 440--453.
F. Irwin, Some properties of polynomial curves, Ann. of Math. (2) 9 (1917--1918) 152--158.
A. Iserles, S.P. Norsett and E.B. Saff, On transformations and zeros of polynomials, Rocky Mountain J. Math. 21 (1991) 331--357.
A. Iserles and S.P. Nørsett, Bi-orthogonality and zeros of transformed polynomials, J. Comput. Appl. Math. 19 (1) (1987) 39--45.
A. Iserles and S.P. Norsett, Zeros of transformed polynomials, SIAM J. Math. Anal. 21 (1990) 483--509.
H.-J. Runckel, Zero-free regions for polynomials with applications to Padé-approximants, in: Constructive Theory of Functions (Bulgar. Acad. Sci., Sofia, 1984) 767--771.
M.V. Jakobson, Structure of polynomial mappings on a singular set, Math. USSR-Sb. 6 (1968) 97--114.
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.
M.A. Jenkins and J.F. Traub, Principles for testing polynomial zerofinding programs, ACM Trans. Math. Software 1 (1975) 26--34.
M.A. Jenkins and J.F. Traub, Principles for testing polynomial zerofinding programs, in: Proc. Mathematical Software II, Purdue Univ. (1974) 84--107.
R. Jentzsch, Question 526, Arch. Math. Phys. 25 (1917) 196.
R. Jentzsch, Über ein Klasse von algebraischen Gleichungen mit lauter reellen Wurzeln, Arch. Math. Phys. Ser. 3 17 (1911) 105.
R. Jentzsch, Sur l'extension d'un theorème de Laguerre, C.R. Acad. Sci. Paris 158 (1914) 780--782.
R. Jentzsch, Untersuchungen zur Theorie der Folgen analytischer Funktionene, Acta Math. 41 (1914) 219--251.
B. Jones, A note on Aitken's δ2 technique, SIGNUM 17 (2) (1982) 23.
G. Julia, Mémoire sur l'itération des fonctions rationelles, J. Math. Pures Appl. 4 (1918) 47--245.
E.I. Jury, Stability consideration for linear discrete systems, in: Theory and Application of the Z-Transform Method (Wiley, New York, 1964) 79--136.
E.I. Jury, Discussion on "The stability of sampled-data systems" by J. Tschauner, Regelungstechnik 8 (1960) 42--46.
A.M. Kac, Zur Frage nach einem Kriterium der aperiodischen Stabilität, Prikl. Mat. Mekh. 15 (1951) 120.
B. Kacewicz, An integral-interpolation iterative method for the solution of scalar equations, Numer. Math. 26 (1976) 355--365.
N. Karcanios, C. Giannakopoulos and M. Hubbard, Almost zeros of a set of polynomials of Rs, Internat. J. Control 38 (1983) 1213--1238.
O.J. Karetnyi and O.N. Kazmin, Identification of the domain of exponential stability in the parameter plane, Izv. Vyssh. Uchebn. Zaved. Elektromekh. (1972) 1260.
P.S. Kasimirsky, Factorization of a polynomial matrix into the product of linear factors, Ukrainian Math. J. 17 (5) (1965).
P.S. Kasimirsky, The factorization of a polynomial matrix into linear factors, Dokl. Akad. Nauk. URSR 4 (1964).
P.S. Kasimirsky, Factorization of a polynomial matrix, Dokl. Akad. Nauk URSR 7 (1965).
P.S. Kasimirsky, On the factorization of a matrix polynomial, Ukrainian Math. J. 24 (1972) 259--268.
P.S. Kasimirsky and M.I. Khudy, One method of choosing a linear factor of a matrix polynomial, Dokl. Akad. Nauk. URSR Ser. A 5 (1970).
I.S. Katz and M.D. Maergoiz, The solution of non-linear algebraic and transcendental equations in the complex plane, U.S.S.R. Comput. Math. and Math. Phys. 7 (3) (1967) 250--260.
W. Kellenberger, Ein konvergentes Iterationsverfahren zur Berechnung der Wurzeln eines Polynoms, Z. Angew. Math. Phys. 21 (1970) 647--651.
A.J. Kempner, On the separation and computation of complex roots of algebraic equations, Univ. Colorada Stud. 16 (1928) 75--87.
A.J. Kempner, Über die Separation komplexer Wurzeln algebraischer Gleichungen, Math. Ann. 85 (1922) 49--59.
E.C. Kennedy, Concerning nearly equal roots, Amer. Math. Monthly 48 (1941) 42--43.
M. Kim, Topological complexity of a root-finding algorithm, J. Complexity 5 (1989) 331--344.
Chin Kiu-shao, The Nine Sections of Mathematics (1247).
D.A. Klip, Completeness of zero curve tracing for analytic functions, J. Comput. Appl. Math. 19 (2) (1987) 243--259.
D.A. Klip, An analytic approach to the solution of non-linear equations, J. Comput. Appl. Math. 20 (1987) 299--306.
D.A. Klip, Solution of polynomial equations by directed search, in: Abstracts SIAM National Meeting (1983).
D.A. Klip, Polynomial zero isolation by directed search, in: Abstracts SIAM Fall Meeting (1979).
D.A. Klip, Solution of (complex) univariate polynomial equations, in: Abstracts SIAM National Meeting (1981).
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.
R.W. Klopfenstein, Zeros of non-linear functions, J. Assoc. Comput. Mach. 8 (1961) 366--373.
H. Kneser, Der Fundamentalsatz der Algebra und der Intuitionismus, Math. Z. 46 (1940) 287--302.
J.M. Kneser, Ergänzung zu einer Arbeit von H. Kneser über den Fundamentalsatz der Algebra, Math. Z. 177 (1981) 285--287.
M. Kneser, Bemerkungen über die Primpolynomzerlegung in endlich vielen Schritten, Math. Z. 57 (1953) 238--240.
M. Kojima, H. Nishino and N. Arima, A PL homotopy for finding all the roots of a polynomial, Math. Programming 16 (1979) 37--62.
V.E. Kondraskov, Extracting the roots of a polynomial in the order of increase of their moduli, Soviet Math. Dokl. 35 (1987) 77--81.
J. Korevaar, Approximation by polynomials whose zeros lie on a circle, Nieuw Arch. Wisk. 10 (3) (1962) 11--16.
M.D. Kostova, Über die Lambda-Folgen, C.R. Acad. Bulgar. Sci. 36 (1983) 23--25.
M. Kostowa and I. Kassandrowa, Some composition theorems, in: Complex Analysis and Applications, Varna, 1983 (Bulgar. Acad. Sci., Sofia, 1985) 127--132.
E.V. Krishnamurthy, On solving an algebraic equation using high powers of an associated matrix and the Cayley--Hamilton theorem, Quart. J. Mech. Appl. Math. 13 (1960) 508--512.
L. Kronecker, Grundzüge einer arithmetischen Theorie der algebraischen Grössen, J. Reine Angew. Math. 92 (1882) 1--121.
L. Kronsjo, Computational Complexity of Sequential and Parallel Algorithms (Wiley, New York, 1985) 123--144.
W. Krull, Über Polynomzerlegung mit endlich vielen Schritten I, Math. Z. 59 (1953) 57--60; II, 296--298; III, ibid. 60 (1954) 109--111.
V. Kucera, Linear quadratic control, state space vs. polynomial equations, Kybernetika (Prague) 19 (1983) 185--195.
H. Kuhn, Über Poloynome mit nur reellen Nullstellen der Ableitung, I, Arch. Math. (Basel) 17 (1966) 336--341; II, ibid. 17 (1966) 537--543; III, ibid. 26 (1975) 166--169.
H.W. Kuhn, Z. Wang and S. Xu, On the cost of computing roots of polynomials, Math. Programming 28 (1984) 156--164.
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.
H.W. Kuhn, A new proof of the fundamental theorem of algebra, in: M. Balinski, Ed., Mathematical Programming Study 1 (North-Holland, Amsterdam, 1974) 148--158.
S. Kulik, A method of approximating the complex roots of equations, Pacific J. Math. 8 (1958) 277--281.
H.T. Kung and J.F. Traub, Fast algorithms for algebraic functions, in: J.F. Traub, Ed., Algorithms and Complexity (Academic Press, New York, 1976) 473 (abstract).
P. Laasonen, An imbedding method of iteration with global convergence, Computing 5 (1970) 253--258.
M.A. Lachance and E.B. Saff, Bounds for algebraic polynomials with zeros in an interval, in: Second Edmonton Conf. on Approximation Theory (CMS Conf. Proc. Vol. 3), Amer. Math. Soc. (1983) 227--238.
J.L. Lagrange, De la résolution des équations numériques, Note 6, Paris (1798); also: in: Oeuvres, Vol. 2 (Gauthier-Villars, Paris, 1868) 539--578.
J.L. Lagrange, Traité de la résolution des équations numériques de tous les degrés..., Oeuvres 8 1--367.
J.L. Lagrange, Réflexions sur la résolution algébrique des équations, in: Oeuvres, Vol. 3 (Gauthier-Villars, Paris, 1869) 205--421.
E. Laguerre, Sur quelques théorèmes de M. Hermite, (extrait d'une lettre addressée à M. Bourchard), J. Reine Angew. Math. 89 (1880) 339--342.
E. Laguerre, Sur quelques propriétés des équations algébriques qui ont toutes leur racines réelles, Nouv. Ann. Math. Ser. 2 19 (1880) 224--239.
E. Laguerre, Sur la distribution dans le plan des racines d'une équation algébrique, dont le premier membre satisfait à une équation linéaire du second ordre, C.R. Acad. Sci. Paris 94 (1882) 412--416; 508--510.
E.N. Laguerre, Théorèmes généraux sur les équations algébriques, in: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 133--143.
T. Laible, Höhenkarte des Fehlerintegrals, Z. Angew. Math. Phys. 2 (1951) 484--487.
C. Lanczos, Applied Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1956) 5--48.
E. Landau, Sur quelques théorèmes de M. Petrovic relatifs aux zéros des fonctions analytiques, Bull. Soc. Math. France 33 (1905) 251--261.
E. Landau, Abschätzung der Koeffizientensumme einer Potenzreihe, Arch. Math. Phys. Ser. 3 21 (1913) 253.
F.M. Larkin, Probabilistic estimation of poles and zeros of functions, J. Approx. Theory 27 (1979) 358--371.
F.M. Larkin, A combined graphical and iterative approach to the problem of finding zeros of functions in the complex plane, Comput. J. 7 (1964) 212--219.
H. Laurent, Usage des formes quadratiques dans la théorie des équations, Nouv. Ann. Math. Ser. 4 1 (1901) 313--319.
D. Lazard, Factorization des polynômes, in: Proc. 4th Journées Algorithmiques, Poitiers (1981).
M. Lecat, Bibliographie des applications et des modifications du théorème de Sturm, Internat. Math. Ser. 2 2 (1923) 44--47.
A. Lepschy, A new criterion for evaluating the number of complex roots of an algebraic equation, Proc. IEEE 50 (1962) 1981.
B.W. Levinger, A generalisation of Pellet's theorem concerning the zeros of a polynomial, Proc. Amer. Math. Soc. 18 (1967) 767--774.
E. Lill, Résolution graphique des équations numériques d'un degré quelconque à une inconnue, C.R. Acad. Sci. Paris 65 (1867) 854--857.
E. Lindwart and G. Polya, Über einen Zusammenhang zwischen der Konvergenz von Polynomfolgen und der Verteilung ihrer Wurzeln, Rend. Circ. Mat. Palermo 37 (1914) 297--304.
J. Liouville, Sur les classes très étendues de quantités dans la valeur n'est ni algébrique ni même réductible des irrarationnelles algébriques, C.R. Acad. Sci. Paris 18 (1844) 883--885; 910--911.
S. Lipka, Über Abzählung der reelen Wurzeln von algebraischen Gleichungen, Math. Z. 47 (1941) 343--351.
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.
A. Loewy, Ein algebraische Hauptung von Gauss, Jahresber. Deutsch. Math.-Verein. 26 (1917) 101--109.
D. London, On the van der Waerden conjecture and zeros of polynomials, Linear Algebra Appl. 45 (1982) 35--41.
D. London, On a connection between the permament function and polynomials, Linear and Multilinear Algebra 1 (1973) 231--240.
F. Lucas, Propriétés géométriques des fractions rationnelles, C.R. Acad. Sci. Paris 78 (1874) 140--144; 180--183; 271--274.
Y.L. Luke, Factoring polynomials by iteration, Electro-Techn. 74 (2) (1964) 30--37.
M. Müller, Über ein Euleresches Verfahren zur Wurzelberechnung, Math. Z. 51 (1948) 474--496.
Vandermonde, Mémoire sur la résolution des équations, Mémoires de l'Acaémie de Paris (1771).
Carvallo, Méthode practique pour la résolution numérique complète des équations, Paris, 1920.
G.R. MacLane, On a conjecture of Erdös, Herzog, and Piranias, Michigan Math. J. 2 (1953--1954) 147--148.
G.R. MacLane, Polynomials with zeros on a rectifiable Jordan curve, Duke Math. J. 16 (1949) 461--477.
C. Maclaurin, Concerning the roots of equations, with the demonstration of other rules in algebra, Philos. Trans. Roy. Soc. London 36 (1729) 59--96.
K. Mahler, An inequality for the discriminant of a polynomial, Michigan Math. J. 11 (1964) 257--262.
K. Mahler, An application of Jensen's formula to polynomials, Mathematika 7 (1960) 98--100.
E. Maillet, Sur les fonctions entières et quasi-entiéres, J. Math. Pures Appl. Ser. 5 8 (1902) 329--386.
E. Malo, Note sur les équations algébriques dont toutes les racines sont réelles, J. Math. Spec. (4) 4 (1895) 7.
M. Mandl, Über die Zerlegung ganzer, ganzahliger Functionen in irreductible Factoren, J. Reine Angew. Math. 113 (1894) 252--261.
W.R. Mann, Averaging to improve convergence of iterative processes, in: M.Z. Nashed, Ed., Functional Methods in Numerical Analysis (Springer, New York, 1979) 169--179.
W.R. Mann, Mean value methods in iteration, Proc. Amer. Math. Soc. 4 (1953) 506--510.
P. Mansion, Sur l'extension du théorème de Rolle aux racines imaginaires des équations algébriques, Ann. Soc. Sci. Bruxelles 13 (1888) 42--45.
M. Marden, A generalization of Weierstrass' and Fekete's mean-value theorems, Bull. Amer. Math. Soc. 38 (1932) 434--441.
M. Marden, On the zeros of linear partial fractions, Trans. Amer. Math. Soc. 32 (1930) 81--109.
M. Marden, On the zeros of certain rational functions, Trans. Amer. Math. Soc. 32 (1930) 658--668.
M. Marden, On Stieltjes polynomials, Trans. Amer. Math. Soc. 33 (1931) 934--944.
M. Marden, A note on the zeros of sections of a partial fraction, Bull. Amer. Math. Soc. 51 (1945) 935--940.
M. Marden, On the zeros of infrapolynomials for partly arbitrary point sets, Proc. Amer. Math. Soc. 10 (1959) 391--394.
M. Marden, Location of zeros of infrapolynomials, Amer. Math. Monthly 70 (1963) 361--371.
A. Marin, Les arbres de Shub-Smale, Sém. Géom. Réelle, J.J. Risler, Publ. Univ. Paris VII, 24, 1986.
W. Markoff, Über Polynome, die in einem gegebenen Intervall möglichst wenig von Null abweichen, Math. Ann. 77 (1916) 213--258.
D. Markovitch, Sur un mode de factorisation approximative des polynômes, Bull. Soc. Math. Phys. Serbie 8 (1956) 53--58.
D.E. Mayer, Sur les équations algébriques, Nouv. Ann. Math.(3) 10 (1891) 111--124.
E. McClintock, A method for calculating simultaneously all the roots of an equation, Bull. Amer. Math. Soc. 1 (1894) 3--4; also: Amer. J. Math. 17 (1895) 89--110.
J.M. McNamee, A bibliography on roots of polynomials, J. Comput. Appl. Math. 47 391--394.
H.S. Medley and R.S. Varga, On smallest isolated Gershgorin discs for eigenvalues II, Numer. Math. 11 (1968) 320--323.
M.V. Meerov, Analytic conditions for positivity of a real function, Dokl. Akad. Nauk SSSR 165 (1965) 780--782.
R. Mehmke, Praktische Methode zur Berechnung der reellen Wurzeln..., Z. Math. Phys. 36 (1891) 158.
G. Meinardus, Über das asymptotische Verhalten von Iterationsverfahren, Z. Angew. Math. Mech. 63 (1983) 70--72.
E.P. Merkes, Starlike continued fractions and zeros of polynomials, Ann. Univ. Mariae Curie-Sklodowska Sect. A 36--37 (1982) 115--122.
F. Meyer, Zur Auflösung der Gleichungen, Math. Ann. 33 (1880) 511--524.
M. Mignotte, Critères d'irréducibilité des polynômes sur un corps de nombres, Enseign. Math. 18 (1972) 191--200.
M. Mignotte, Sur la répartition des racines des polynômes, J. Arithm. Caen (1980).
M. Mignotte, Sur la complexité de certains algorithmes où intervient la séparation des racines d'un polynôme, RAIRO Inform. Théor. 10 (1976) 51--55.
N.N. Mikhaelov, Electrical devices for solving algebraic equations, Avtomat. i Telemekh. 19 (1958) 477--490.
T. Millett and I. Tang, Using inners to determine multiple roots of polynomials, in: Second Internat. Conf. On Information Sciences and Systems, 11, Univ. Patras, 1979 (Reidel, Dordrecht, 1980) 236--246.
W.L. Miranker, Parallel methods for approximating a root of a function, IBM. J. Res. Develop. 13 (1969) 297--301.
D. Mitrovic, Automatic plotting of characteristic curves and analog solution of algebraic equations, Trans. AIEE (Commun. and Electr.) 80 (1961) 701--703.
T. Mitsui, A graphical technique for nonlinear algebraic equations, Internat. J. Comput. Math. 13 (1983) 245--261.
R.C. Mittal and R. Agarwal, Calculation of zeros of a real polynomial using scaling of its coefficients, Internat. J. Comput. Math. 48 (1993) 117--124.
T.S. Motzkin and J.L. Walsh, Least pth power polynomials on a finite point set, Trans. Amer. Math. Soc. 83 (1956) 371--396.
T.S. Motzkin and J.L. Walsh, Underpolynomials and infrapolynomials, Illinois J. Math. 1 (1957) 406--426.
T.S. Motzkin and J.L. Walsh, Polynomials of best approximation on a real finite point set, Proc. Nat. Acad. Sci. U.S.A. 43 (1957) 845--846.
T.S. Motzkin and J.L. Walsh, Location of zeros of infrapolynomials, Compositio Math. 14 (1959) 50--70.
T.S. Motzkin and J.L. Walsh, Polynomials of best approximation on a real finite point set I, Trans. Amer. Math. Soc. 91 (1959) 231--245.
L.A. Mukharev, Finding the roots of f(x)=0 by expansion in powers of a parameter introduced into the equation, U.S.S.R. Comput. Math. and Math. Phys. 29 (4) (1991) 79--82.
K. Murota, Global convergence of a modified Newton's iteration for algebraic equations, SIAM J. Numer. Anal. 19 (1982) 793--799.
P. Myrberg, Inversion der Iteration für rationale Funktionen, Ann. Acad. Sci. Fenn. Ser. I Math. 292 (1960).
P. Myrberg, Iteration der reellen Polynome zweiten Grades, Ann. Acad. Sci. Fenn. Ser. I Math. 256 (1958).
P. Myrberg, Iteration von Quadratwurzeloperationen, Ann. Acad. Sci. Fenn. Ser. I Math. 259 (1958).
P. Myrberg, Iteration der reellen Polynome zweiten Grades II, Ann. Acad. Sci. Fenn. Ser. I Math. 268 (1959).
P. Myrberg, Iteration der Binome beliebigen Grades, Ann. Acad. Sci. Fenn. Ser. I Math. 348 (1964).
P. Myrberg, Iteration der reellen Polynome zweiten Grades III, Ann. Acad. Sci. Fenn. Ser. I Math. 336 (1964).
H. Nägelsbach, Studien zur Fürstenau's neuer Methode, Arch. Math. Phys. 59 (1876--1877) 147--193; ibid. 61 19--85.
M. Nagumo, Über die Nullstellen der Integrale von gewöhnlichen linearen homogenen Differentialgleichungen I, Japan. J. Math. 4 (1927) 169--178; II, ibid. 5 (1928) 225--238.
J.v.Sz. Nagy, Die Lage der A-Stellen eines Polynoms bezüglich seiner Nullstellen, Acta Sci. Math. (Szeged) 11 (1947) 147--151.
J.v.Sz. Nagy, Verallgemeinerung eines Satzes von Jentsch, Monatsh. Math. Phys. 51 (1943) 59--62.
J.v.Sz. Nagy, Über die Nullstellen gewisser rationaler Funktionen, Tôhoku Math. J. 41 (1936) 415--423.
Yu.I. Naimark, On the problem of the distribution of the roots of polynomials (in Russian), Dokl. Akad. Nauk SSSR 58 (1947) 357--360.
K. Nasitta, Ein immer konvergentes Nullstellenverfahren für analytische Functionen, Z. Angew. Math. Mech. 44 (1964) 57--63.
E. Netto, Zur Theorie der iterirten Functionen, Math. Ann. 29 (1887) 148--153.
I. Newton, Methods of series and fluxions, in: D.T. Whiteside, Ed., The Mathematical Papers of Isaac Newton, Vol. III (Cambridge Univ. Press, Cambridge, 1969).
K. Nickel, Algorithmus 5. Die Nullstellen eines Polynoms, Computing 2 (1967) 284--288.
K. Nickel, Die numerische Berechnung der Wurzeln eines Polynoms, Numer. Math. 9 (1966) 80--98.
K. Nickel, Allgemeine Forderungen an einem numerischen Algorithmus, Z. Angew. Math. Mech. 47 (1967) T67--68.
E. Novak, Average-case results for zero finding, J. Complexity 5 (1989) 489--501.
P.J. O'Hara and R.S. Rodriguez, Polynomials with zeros uniformly distributed on the unit circle, Amer. Math. Monthly 85 (1978) 814--817.
N. Obreschkoff, Sur le théorème de Hermite et Poulain, C.R. Acad. Sci. Paris 249 (1959) 21--22.
N. Obreschkoff, Sur les zéros des derivées des fonctions rationelles, C.R. Acad. Bulgare Sci. Math. Nat. 1 (1948) 5--8.
N. Obreschkoff, Sur les racines des équations algébriques, Tôhoku Math. J. 38 (1933) 93--100.
N. Obreschkoff, Sur les polynômes univalents, C.R. Acad. Sci. Paris 198 (1934) 2049--2050.
N. Obreschkoff, Verteilung und Berechnung der Nullstellen reeller Polynome (VEB Deutscher Verlag der Wissenschaften, Berlin, 1963).
K. Ohnaka, Y. Isomoto and S. Makinouchi, On a test of programs for numerical zeros of polynomials, Computing 25 (1980) 163--174.
Y. Okada, On some algebraic equations whose roots are all real and distinct, Tôhoku Math. J. 14 (1918) 328--333.
A. Ostrowski, Sur la continuité relative des racines d'équations algébriques, C.R. Acad. Sci. Paris 209 (1939) 777--779.
A. Ostrowski, On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors IV, Arch. Rational Mech. Anal. 3 (1959) 341--347.
A. Ostrowski, Über eine Modifikation des Newtonschen Näherungsverfahrens, Akad. Nauk. SSSR (Gruz Fil Trudy) 2 (1937) 241--249.
A. Ostrowski, Über einige Sätze von Herrn M. Parodi, Math. Nachr. 19 (1958) 331--338.
A.M. Ostrowski, Note sur les parties réelles et imaginaires des racines des polynômes, J. Math. Pures Appl. (9) 44 (1965) 327--329.
A.M. Ostrowski. Une méthode générale de résolution automatique d'une équation polynômiale, in: Programmation en Mathématiques Numériques (1968) 179--182.
J.-P. Dedieu and J.-C. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numer. Algorithms 4 (1993) 1--24.
J.-P. Dedieu, Sur le calcul des racines d'un polynôme, in: Séminaire Calcul Formel et Outils Algébriques pour la Modélisation Géométrique (Paris, 1988).
C.T. Pan and K.S. Chao, Multiple solutions of nonlinear equations, IEEE Trans. Circuits and Systems 27 (1980) 825--832.
V.Y. Pan, On some methods of computing polynomial values, Problems Cybernet. 7 (1962) 20--30.
V.Y. Pan, An application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems, Comput. Math. Appl. 11 (1985) 911--917.
V.Y. Pan, Schemes for the calculation of polynomials with real coefficients, Dokl. Akad. Nauk SSSR 127 (1959) 266--269.
A.A. Panchishkin and I.Yu. Potemkin, An algorithm for polynomial factorization, using elliptic modules, Proc. All-Union Conf. on Constructive Methods and Algorithms in Number Theory, Minsk (1989).
J.G. Papadimitriou, Über die Wurzeln der Polynome, Bull. Soc. Math. Grèce 15 (1934) 36--42.
P.C. Parks, A new proof of the Hurwitz stability criterion by the second method of Lyapunov with applications to optimum transfer functions, in: 4th Joint Automation and Control Conf. (1963) 471--478.
M. Parodi, Sur la localisation de zeros des polynômes, C.R. Acad. Sci. Paris Sér. A 279 (1974) 691--694.
M. Parodi, Sur la localisation des zéros des polynômes dont les coefficients ont des valeurs voisines, Bull. Sci. Math. (2) 84 (1960) 65--73.
M. Parodi, Sur quatres méthodes d'étude des zéros des polynômes, Bull. Sci. Math. (2) 82 (1958) 106--117.
W. Patz, Tafel der Regelmässigen Kettenbrüche und ihre Vollständigen Quotienten für die Quadratwurzeln aus den Natürlichen Zahlen von 1--10000 (Akademie Verlag, Berlin, 1955).
A.E. Pellet, Sur un mode de séparation des racines des équations et la formule de Lagrange, Bull. Sci. Math. (2) 5 (1881) 393--395.
A.E. Pellet, Sur les équations ayant toutes leurs racines réelles, C.R. Acad. Sci. Paris 147 (1908) 342--343.
O. Perron, Bemerkungen zu einem Irreduzibilitätskriterium des Herrn Petterson, Math. Ann. 114 (1937) 526--529.
M.S. Petkovic, Some interval methods of the second order for the simultaneous approximation of polynomial roots, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 634--677 (1979) 74--81.
W. Pfeiffer, A graphical method for finding complex roots and its application to plasma physics problems, J. Comput. Phys. 33 (1979) 397--404.
D. Phelps and R.S. Rodriguez, Some properties of extremal polynomials for the Illieff conjecture, Bull. Tokyo Inst. Tech. (Tokyo Kogyo Daigaku) 24 (1972) 172--175.
G. Polya, Question 4240, Inter. Math. 20 (1913) 145--146.
G. Polya and J. Schur, Über zwei arten von Factorenfolgen in der Theorie der algebraischen Gleichungen, J. Reine Angew. Math. 144 (1914) 89--113.
G. Polya, Algebraische Untersuchungen über ganze Functionen vom geschlechte Null und Eins, J. Reine Angew. Math. 145 (1915) 224--249.
G. Polya and G. Szegö, Aufgaben und Lehrsätze der Analysis (Springer, Berlin, 1925) (2 volumes).
G. Polya, Vermischte Mitteilungen No 454, Arch. Math. Phys. Ser. 3 21 (1913) 289.
G. Polya, Über einer Verallgemeinerungen der Descartesschen Zeichenregel, Arch. Math. Phys. Ser. 3 23 (1915) 22--32.
G. Polya, Über die algebraische-funktionentheoretischen Untersuchungen von J.L.W.V. Jensen, Danske Vid. Selsk. Mat.-Fys. Medd. 7 (1927) 1--33.
G. Polya, Über Annäherung durch Polynome mit lauter reellen Wurzeln, Rend. Circ. Mat. Palermo 36 (1913) 279--295.
G. Polya, Über die Nullstellen gewisser ganzen funktionen, Math. Z. 2 (1918) 352--383.
G. Polya, Über Annäherung durch Polynome deren sämtliche Wurzeln in einem Winkelraum fallen, Nachr. Ges. Wiss. Göttingen (1913) 326--330.
T. Pomentale, Homotopy iterative methods for polynomial equations, J. Inst. Math. Appl. 13 (1974) 201--213.
W.G. Poole Jr and R.G. Voigt, Numerical algorithms for parallel and vector computers: an annotated bibliography, CR 15 (1974) 382--383.
M.B. Porter, On the polynomial convergents of a power series, Ann. of Math. (2) 8 (1906--1907) 189--192.
E.P. Pugachev, Notes on the proofs of certain iterative processes, Zh. Vychisl. Mat. i Mat. Fiz. 2 (1963) (5) 912--915 (in Russian); English: U.S.S.R. Comput. Math. and Math. Phys. 2 (1963) 1059--1064.
V.A. Puiseux, Recherches sur les fonctions algébriques, J. Reine Angew. Math. 15 (1850) 365--480.
L. Rédei, Lückenhafte Polynome über Endlichen Körpern (Birkháuser, Basel, 1970) 1--100.
Hadamard, Résolution d'une question relative aux déterminants, Bull. Sci. Math. 17 (1893) 240--246.
Q.I. Rahman, Some inequalities for polynomials and related entire functions II, Canad. Math. Bull. 7 (1964) 573--595.
Q.I. Rahman, Some inequalities for polynomials and related entire functions, Illinois J. Math. 5 (1961) 144--151.
M. Reed, A series solution for the root of a polynomial, Bull. Inst. Math. Appl. 16 (1980) 24--28.
M. Reimer and K. Zeller, Abschätzung der Teilsummen reeller Polynome, Math. Z. 99 (1967) 101--104.
J. Reinermann, Über Toeplitzche Iterationsverfahren und einige ihre Anwendungen in der konstructive Fixpanktheorie, Studia Math. 32 (1969) 209--227.
J. Renegar, On the worst-case arithmetic complexity of approximating zeros of polynomials, in: Proc. 2nd Symp. on the Complexity of Approximately Solved Problems (Columbia Univ., New York, 1987); also J. Complexity 3 (1987) 90--113.
R.P. Rich and H. Shaw, A method for finding all the zeros of f(z), J. Assoc. Comput. Mach. 10 (1963) 545--549.
H. Richter, Ein einfacher Beweis der Newtonschen und der Waringschen Formel für die Potenzsummen, Arch. Math. (Basel) 2 (1949--1950) 1--4.
J.F. Ritt, On the iteration of rational functions, Trans. Amer. Math. Soc. 21 (1920) 348--356.
M.I. Romanov, Algebraic criteria for aperiodicity of linear systems, Dokl. Akad. Nauk SSSR 124 (1959) 291--294.
P.C. Rosenbloom, An elementary constructive proof of the fundamental theorem of algebra, Amer. Math. Monthly 52 (1945) 562--570.
W.E. Roth, On algebraic equations having only real roots, Bull. Amer. Math. Soc. 37 (1931) 830.
E.J. Routh, A Treatise on the Stability of a Given State of Motion (Macmillan, London, 1877) 25--36.
E.J. Routh, Die Dynamik der Systeme starrer Körper, Band 2 (Leipzig, 1898).
T.S. Roy et al., A new method to solve non-linear equations, Inform. Process. Lett. 50 (1994) 75--79.
Z. Rubinstein and J.L. Walsh, Extension and some applications of the coincidence theorems, Trans. Amer. Math. Soc. 146 (1969) 413--427.
Z. Rubinstein, Remarks on a paper by A. Aziz, Proc. Amer. Math. Soc. 94 (1985) 236--238.
D. Ruelle, Some remarks on the location of zeros of the partition function for lattice systems, Comm. Math. Phys. 31 (1973) 265--277.
P. Rufini, Algebra Elementare (Modena, 1807) Chapters 4, 5.
P. Rufini, Reflessioni Intorno alla Soluzione dell'Equazioni Algebraichi (1813).
C. Runge, Entwicklung der Wurzeln einer algebraischen Gleichung in Summen von rationalen Functionen der Coefficienten, Acta Math. 6 (1885) 305--318.
C. Runge, Irreducibilität der Gleichung, J. Reine Angew. Math. 99 (1886) 89--97.
T.R. Running, Graphical solutions of cubic, quartic and quintic, Amer. Math. Monthly 50 (1943) 170--173.
H. Rutishauser, Der Quotienten-Differenzen-Algorithmus (Birkhäuser, Basel, 1957).
H. Rutishauser, Zur Problematik der Nullstellenbestimmung bei Polynomen, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 281--294.
T. Sakurai, T. Torii and H. Sugiura, An iterative method for algebraic equations by Padé approximation, Computing 46 (1991) 131--141.
G.S. Salehov, On the convergence of the process of tangent hyperbolas, Dokl. Akad. Nauk SSSR 82 (1952) 525--528 (in Russian).
K. Samelson, Faktorisierung von Polynomen durch funktionale Iteration, Bayer. Akad. Wiss. Math.-Natur. Kl. Abh. 95 (1959) 1--25.
H. Sanden, Practical Mathematical Analysis, translation: H. Levy (Methuen, London, 1923).
T. Sasake and M. Noda, Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations, J. Inform. Processing 12 (1989) 159--168.
P.E. Saylor and D.C. Smolarski, Computing the roots of complex orthogonal and kernel polynomials, SIAM J. Sci. Statist. Comput. 9 (1988) 1--13.
J. Schaeffer and D. Makarenko, Systolic polynomial evaluation and matrix multiplication with multiple precision, Comput. Arith. (1985) 110--117.
U. Schendel, Introduction to Numerical Methods for Parallel Computers (Wiley, New York, 1984) 105--118.
G. Schmeisser, Zur Lage der kritischen Punkte eines Polynoms, Rend. Sem. Mat. Univ. Padova 46 (1971) 405--415.
W.M. Schmidt, Approximation to algebraic numbers, in: Monograph. Enseign. Math. 19 (Enseignement Math., Geneva, 1972).
I.J. Schoenberg and G. Szegö, An extremum problem for polynomials, Compositio Math. 14 (3) (1959) 260--268.
I.J. Schoenberg, Zur absählung der reellen Wurzeln algebraischer Gleichungen, Math. Z. 38 (1934) 546--564.
W. Schulz, Bemerkungen zu einer Abhandlung von Herrn Takahashi, Jahresber. Deutsch. Math.-Verein. 45 (1935) 172--180.
I. Schur, untitled note, Arch. Math. Phys. 13 (1908) 367.
I. Schur, Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind, J. Reine Angew. Math. 147 (1917) 205--232; 148 (1918) 122--145.
J. Sebastião e Silva, Sur une méthode d'approximation semblable à celle de Gräffe, Portugal. Math. 2 (1941) 271--279.
B. Segre, Intorno al numero degli zeri di un polinomio nel campo reale, Rend. Accad. Naz. Lincei Cl. Sci. Fis. Mat. Nat. 29 (1960) 155--161; 225--231; 465--471.
K.I. Semerdzhiev and S.G. Tamburov, A method for determining the multiplicities of zeros of algebraic polynomials, C.R. Acad. Bulgar. Sci. 37 (1984) 1143--1145.
S. Sherman, J. Di Paola and H.F. Frissel, The simplification of flutter calculation by the use of an extended form of the Routh discriminant, J. Aeron. Sci. 12 (1945) 385--392.
O. Shisha, On generalized infrapolynomials of a certain type, Notices Amer. Math. Soc. 6 (1959) 283 (abstract).
O. Shisha, On the structure of infrapolynomials with a prescribed first and last coefficient, Notices Amer. Math. Soc. 6 (1959) 393 (abstract).
O. Shisha, A structure theorem for infrapolynomials with prescribed coefficients, Notices Amer. Math. Soc. 8 (1961) 66 (abstract).
O. Shisha and J.L. Walsh, The zeros of infrapolynomials with some prescribed coefficients, J. Analyse Math. 9 (1961) 111--160.
D.D. Siljak, An analytic test for absolute stability and positive realness, in: Proc. Second Asilomar Conf. on Circuits and Systems, Pacific Grove, CA (1968) 580--581.
R. Simeonov, On the theorem of Ruffini--Abel, Complex Analysis and Applications '85, Varna (Bulgar. Acad. Sci., Sofia, 1986) 601--603.
D.M. Simeunovic, On some estimates of approximate values of zeros of polynomials, Z. Angew. Math. Mech. 70 (1990) T545--T549.
J.G. Simmonds, A First Look at Perturbation Theory (Krieger, 1986) 29--38.
S. Simons, Modified iterations, Math. Gaz. 74 (1990) 293--295.
M. Sisler, Approximative Formeln für den Fehler bei Iterationsverfahren höherer Ordnung, Apl. Mat. 12 (1967) 1--14.
B.N. Skachkov, A property of roots of a Hurwitz polynomial, in: Qualitative Theory of Complex Systems (Leningrad Gos. Ped. Inst., Leningrad, 1986) 45--47.
T. Skolem, Zwei Sätze über kubische Kongruenzen, Norske Vid. Selsk. Forh. (Trondheim) 10 (24).
J.N. Snyder, Inverse interpolation, a real root of f(x)=0, ILLIAC 1 Library Routine H1-71, Digit. Comput. Lab., Univ. Illinois, 1953.
O.K. Sobolev, The choice of generalized parameters, Izv. Akad. Nauk SSSR Tekhn. Kibernet. (5) (1970) 191--198.
P. Sondat, Théorèmes sur les équations algébriques, Nouv. Ann. Math. Ser. 3 16 (1897) 169--171.
W. Specht, Algebraische Gleichungen mit reellen oder komplexen Koeffizienten, in: Enzyklopädie Math. Wiss., I/1, H. 3; II, 2 (Teubner, Stuttgart, 1958) 1--76.
W. Specht, Untersuchungen über die Wurzelverteilung algebraischer Gleichungen, Math. Nachr. 4 (1950--1951) 126--149.
W. Specht, Die Lage der Nullstellen eines Polynoms, Math. Nachr. 15 (1956) 353--374; ibid. 16 (1957) 257--263; ibid. 16 (1957) 369--389; ibid. 21 (1960) 201--222.
T.B. Sprague, On the nature of the curves whose intersections give the imaginary roots of an algebraic equation, Trans. Roy. Soc. Edinburgh 30 (II) (1882) .
D. Starer and A. Nehorai, Polynomial factorization algorithms for adaptive root estimation, in: Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing (1989) 1158--1161.
J.F. Steffensen, Remarks on iteration, Skand. Aktuarietidskrift 16 (1933) 64--72.
H.E. Stelson, Finding the root of an equation by iteration, Skand. Aktuarietidskrift 37 (1954) 10--18.
W.J. Sternberg, On polynomials with multiple roots, Amer. Math. Monthly 52 (1945) 440.
T.J. Stieltjes, Sur certains polynômes qui vérifient une équation différentielle, Acta Math. 2 (1885) 321--326.
T.J. Stieltjes, Quelques considérations sur la fonction rationelle entière d'une variable complexe, Arch. Néerlandaises 18 (1883) 1--19.
J. Stirling, Lineae Tertii Ordinis Neutonianae (Oxford Univ. Press, Oxford, 1717) 58--59.
C. Sturm, Démonstration d'un théorème d'algèbre de M. Sylvester, J. Math. Pures Appl. 7 (1842) 356--368.
C. Sturm, Analyse d'un mémoire sur la résolution des équations numériques, Bull. Sci. Math. Ferussac 11 (1829) 419--422.
H. Sugiyama and E.S. Lee, Stochastic approximation: a powerful method for solving deterministic numerical problems, Comput. Math. Appl. 15 (1988) 963--967.
C.T. Sullivan, A rational transformation of the complex plane with applications to the roots of polynomials, Trans. Roy. Soc. Canada (3) 30 (1936) 31--39.
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.
J.J. Sylvester, Sur une extension de la théorie des équations algébriques, in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge Univ. Press, London, 1908) 361--362.
J.J. Sylvester, Sur la théorie des racines réelles et imaginaires des équations du cinquième degré, C.R. Acad. Sci. Paris 59 (1864) 749--753; also: in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge Univ. Press, London, 1908) 371--375.
J.J. Sylvester, Mathematical questions with their solutions, Educational Times 53 (8) (1890) 33--34.
J.J. Sylvester, Algebraical researches containing a diquisition on Newton's rule for the discovery of imaginary roots, etc., Philos. Trans. Roy. Soc. London 154 (1864) 579--666; also: in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge Univ. Press, London, 1908) 376--479.
J.J. Sylvester, On an elementary proof and generalization of Sir Isaac Newton's hitherto undemonstrated rule for the discovery of imaginary roots, Proc. London Math. Soc. 1 (1865) 2nd paper; also: in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge Univ. Press, London, 1908) 498--513.
J.J. Sylvester, Sur l'enrelacement d'une fonction par rapport à une autre, J. Reine Angew. Math. 88 (1880) 1--3; also: in: Collected Mathematical Papers, 3, 449--450.
O. Szász, On sequences of polynomials and the distribution of their zeros, Bull. Amer. Math. Soc. 49 (1943) 377--383.
G. Szegö, Bemerkungen zu einem Satz von J.H. Grace über die Wurzeln algebraischer Gleichungen, Math. Z. 13 (1922) 28--55.
T. Takagi, Note on the algebraic equations, Proc. Phys.-Math. Soc. Japan (3) 3 (1921) 175--179.
I. Tang, When do polynomials have imaginary roots?, Z. Angew. Math. Mech. 57 (1977) 53--54.
L. Tasny-Tschiassny, Location of the roots of polynomial equations by the repeated evaluation of linear forms, Quart. Appl. Math. 11 (1953) 319--326.
L. Tasny-Tschiassny and A.G. Doe, Solution of polynomial equations with aid of electolytic tank, Austral. J. Sci. Res. Ser. A 4 (1951) 231--257.
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.
L. Tessler and L. Eisenberg, A new algorithm for factoring polynomials, Proc. IEEE 60 (1972) 737--738.
G.J. Thaler, Discussion of "Automatic plotting of characteristic curves and analog solution of algebraic equations", Trans. AIEE (Commun. Electr.) 80 (1961) 703.
R. Thom, L'équivalence d'une fonction differentiable et d'une polynôme, Topology 3 (1964) 297--304.
L. Throumoulopoulos, Über den Betrag der Wurzeln von Polynomen, Bull. Soc. Math. Grèce 23 (1948) 18--20; ibid. 24 (1949) 68--73.
D.D. Tosic and G.V. Milovanovic, An application of Newton's method to simultaneous determination of zeros of a polynomial, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 412--460 (1973) 175--177.
B.S. Tomic, The distribution of indefinitely increasing zeros of polynomials with alternate coefficients, Rad Jugoslav. Akad. Znan. Umjet. 413 (1984) 103--123.
B.S. Tomic, The asymptotic relations for indefinitely increasing zeros of polynomials with alternate coefficients, Rad Jugoslav. Akad. Znan. Umjet. 413 (1984) 87--102.
B.S. Tomic, Les distribution des zéros croissant indéfiniment des polynômes à coefficients positifs, Acad. Roy. Belg. Bull. Cl. Sci. (5) 50 (1964) 1151--1173.
B.S. Tomic, The distribution of the indefinitely increasing zeros of polynomials with alternating coefficients, Anal. Numér. Théor. Approx. 15 (1986) 173--189.
J. Traub, The calculation of zeros of polynomials and analytic functions, Tech. Rep. 36, Comput. Sci. Dept., Stanford Univ.
J.F. Traub, Associated polynomials and uniform methods for the solution of linear problems, SIAM Rev. 8 (1966) 277--301.
J.F. Traub, Interpolatively generated iteration functions, in: Proc. 18th Ann. ACM Conf. (1963).
J.F. Traub, On functional iteration and the calculation of roots, in: Proc. 16th Nat. ACM Conf. 5A-1 (1961) 1--4.
J.F. Traub, The theory of multipoint iteration functions, in: Proc. 17th Ann. ACM Conf., Syracuse, NY (1962) 80--81.
N. Trudi, in: D.B. Pellerano, Ed., Teoria di Deterministi e Loro Applicaziioni (Libreria Scientifica i Industriale, Naples, 1862).
R. Unbehauen, Ein Verfahren zur Hurwitz-Faktorisierung von Polynomen, Arch. Elektr. Übertr. 13 (1959) 58--62.
J.V. Uspensky, Theory of Equations (McGraw-Hill, New York, 1948).
K.G. Valeev and I.R. Karganjan, A generalization of the Weierstrass theorem, Akad. Nauk Armyan. SSR Dokl. 57 (1973) 257--263.
L.G. Valiant and S. Skykum, Fast parallel computation of polynomials using few processors, in: Lecture Notes in Comput. Sci. 118 (Springer, New York, 1981) 132--139.
B.L. Van der Waerden, Einige Bemerkungen über die Unzerlegbarkeit von Polynomen, Math. Ann. 102 (1930) 738--739.
H. Van de Vel, The Haar condition and multiplicity of zeros, Numer. Math. 39 (1982) 139.
C. Visser, A simple proof of certain inequalities concerning polynomials, Nederl. Akad. Wetensch. Proc. 48, 276--281; also: Indag. Math. 7 (1945) 81--86.
A. Vogel, Iterationsverfahren zur Auflösung einer Gleichung f(x)=0, Praxis Math. 1 (1959) 197--200.
Z. Vostry, New algorithm for polynomial spectral factorization with quadratic convergence, Kybernetika (Prague) 11 (1975) 415--422; ibid. 12 (1976) 248--259.
J. Vuillemin, La philosophie de l'algèbre, 1, Paris (1962).
J.L. Walsh, Note on the location of the critical points of harmonic functions, Proc. Nat. Acad. Sci. U.S.A. 20 (1934) 551--554.
J.L. Walsh, On infrapolynomials with prescribed constant term, J. Math. Pures Appl. (9) 37 (1958) 295--316.
J.L. Walsh, A certain two-dimensional locus, Amer. Math. Monthly 29 (1922) 112--114.
J.L. Walsh, Some two-dimensional loci connected with cross-ratios, Trans. Amer. Math. Soc. 23 (1922) 67--88.
J.L. Walsh and J.P. Evans, On the location of the zeros of certain orthogonal functions, Proc. Amer. Math. Soc. 7 (1956) 1085--1090.
J.L. Walsh, On extremal approximation, in: R.E. Langer, Ed., On Numerical Approximation (Univ. of Wisconsin Press, Madison, WI, 1959) 209--216.
J.L. Walsh and J.P. Evans, Note on the distribution of zeros of extremal polynomials, U.S. Nat. Acad. Sci. Proc. 40 (1954) 332--337.
J.L. Walsh and Z. Rubinstein, On the location of the zeros of a polynomial whose center of gravity is given, J. Analyse Math. 12 (1964) 129--142.
Z. Wang and S. Xu, Approximate zeros and computational complexity theory, Sci. Sinica Ser. A 27 (1984) 566--575.
Z. Wang, On zero distribution of a class of continuous functions, Complex Variables Theory Appl. 7 (1987) 357--361.
E. Waring, Meditationes Analyticae (Cambridge Univ. Press, Cambridge, 3rd ed., 1782) 68--115.
E. Waring, Meditationes Analyticae (Cambridge Univ. Press, Cambridge, 2nd ed., 1776) 311.
E. Wasserstrom, Root finding of polynomials as an initial value problem, J. Comput. Phys. 8 (1971) 304--308.
E. Wasserstrom, Numerical solutions by the continuation method, SIAM Rev. 15 (1973) 89--119.
J.J. Wavrik, Computers and the multiplicity of polynomial roots, Amer. Math. Monthly 89 (1982) 34--56.
M. Weill, Sur la racine carrée des nombres, Bull. Soc. Math. France 14 (1886) 128--131.
F. Weisenhorn, Ein Betrag zur Bestimmung der Nullstellen aus einem Polynom in Summenform und aus der Summe von Polynomen in Produktform, Arch. Elektr. Übertr. 24 (1970) 372--378.
F. Wenzl, Zur numerischen Auflösung algebraischer Gleichungen, Bayer. Akad. Wiss. Math.-Natur. Kl. Sitzungsber. (1952) 1--111.
E.T. Whittaker and G. Robinson, The Calculus of Observations (London, 4th ed., 1944) 78--131.
E.T. Whittaker, A formula for the solution of algebraic or transcendental equations, Proc. Edinburgh Math. Soc. 36 (1918) 103--106.
F.A. Willers, Zur Konvergenz des Newtonschen Näherungs-Verfahrens, Z. Angew. Math. Mech. 18 (1938) 197--200.
D.R. Wingo, Globally minimizing polynomials without evaluating derivatives, Internat. J. Comput. Math. 17 (1985) 287--294.
L.F. Woodruff, Notes on a method of evaluating the complex roots of sixth and higher-order equations, J. Math. Phys. 4 (3) (1925) 164--166.
H. Wronski, Résolution Générale des Équations de Tous les Degrés, Tome 3 (Mesianisme).
X. Ying and I.N. Katz, A simple reliable solver for all the roots of a nonlinear function in a given domain, Computing 41 (1989) 317--333.
J.R. Young, Theory and Solution of Algebraical Equations of the Higher Orders (Souter and Law, London, 1843) 63.
H. Zassenhaus, On the fundamental theorem of algebra, Amer. Math. Monthly 74 (1967) 485--497.
H. Zassenhaus, A real root calculus, in: J. Leech, Ed., Computational Problems in Abstract Algebra (Pergamon, Oxford, 1970) 383--392.
M. Zedek, Fejér's theorem on the zeros of extremal polynomials generalized, preliminary report, Bull. Amer. Math. Soc. 61 (1955) 49.
J.Z. Zhang and L. Yang, 2n-order cut-factor method to find the roots of a polynomial, Math. Numer. Sinica 4 (1982) 417--426.
S.P. Zhou, On a problem of Szabados, Kexue Tongbao 30 (1985) 557--558.