Graeffe's method

F.S. Acton, Numerical Methods that Work (Harper and Row, New York, 1970).

A.C. Aitken, Note on solving algebraic equations by root cubing, Math. Gaz. 15 (1931) 490--491.

K.H. Bachmann, Rechenkontrollen und Rechenschemata zum Graeffeschen Verfahren, Wiss. Z. Tech. Hochsch. Dresden 2 (1952--1953) 327--332.

E.H. Bareiss, The numerical solution of polynomial equations and the resultant procedures, in: A. Ralston and H.S. Wilf, Eds., Mathematical Methods for Digital Computers, Vol. 2 (Wiley, New York, 1967) 185--214.

E.H. Bareiss, Resultant procedure and the mechanisation of the Graeffe process, J. Assoc. Comput. Mach. 7 (1960) 346--386.

G. Bauer, Vorlesungen über Algebra (Teubner, Leipzig, 1903).

A.A. Belanov, A universal version of Lobachevski's method for determining the roots of polynomials, U.S.S.R. Comput. Math. and Math. Phys. 33 (1993) 1661--1663.

I.S. Berezin and N.P. Zhidkov, Computing Methods, Vol. 2 (Pergamon Press, Oxford, 1965) Chapter 7.

G.C. Best, The determination of the complex zeros of a polynomial, Amer. Math. Monthly 54 (1947) 269--272.

E. Bodewig, On Graeffe's method of solving algebraic equations, Quart. Appl. Math. 4 (1946) 177--190.

D.W. Boyd, Reciprocal polynomials having small measure, Math. Comp. 35 (1980) 1361--1377; II, ibid. 53 (1989) 355--357; S1--S5.

S. Brodetsky and G. Smeal, On Graeffe's method for complex roots of algebraic equations, Proc. Cambridge Philos. Soc. 22 (1924) 83--87.

P.A. Brooker, The solution of algebraic equations on the Edsac, Proc. Cambridge Philos. Soc. 48 (1952) 255--270.

R.A. Buckingham, Numerical Methods (Pitman, London, 1957) 251--304.

F. Cajori, A History of Mathematics (Macmillan, New York, 2nd ed., 1919).

B. Carnahan, H.A. Luther and J.O. Wilkes, Applied Numerical Methods (Wiley, New York, 1969) 141--209.

S.P. Chung, An algorithm for the zeros of transcendental functions, Numer. Math. 32 (1979) 359--371.

S.P. Chung, Generalization and acceleration of an algorithm of Sebastião e Silva and its duals, Numer. Math. 25 (1976) 365--377.

C.W. Clenshaw and P.R. Turner, Root squaring using level-index arithmetic, Computing 43 (1989) 171--185.

L. Collatz, Numerische und graphische Methoden, Handbuch der Physik 2, Berlin (1955) 370--382.

N.B. Conkwright, Introduction to the Theory of Equations (Ginn, Boston, MA, 1941).

L.L. Cronvich, On the Graeffe method of solution of equations, Amer. Math. Monthly 46 (1939) 185--190.

G. Dandelin, Recherches sur la resolution des équations numériques, Nouv. Mém. Acad. Roy. Sci. Belles-Lettres Bruxelles 3 (1826) 1--71.

L. Derwidué, Introduction à l'algèbre supérieure et au calcul numérique algébrique, Masson et Cie, Paris (1957).

L.E. Dickson, Elementary Theory of Equations (Wiley, New York, 1914).

D. Dobbs and R. Hanks, A modern course on the theory of equations (Polygonal Publishers., 2nd ed., 1992).

D.E. Dobbs and R. Hanks, A Modern Course on the Theory of Equations (Polygonal Publ. House, Passic, NJ, 1980).

I.E. Durand, Solutions Numérique des Équations Algébriques. Tome I: Équations du Type F(x)=0; Racines d'une Polynôme (Masson, Paris, 1960) 279--281.

J.F. Encke, Allgemeine Auflösung der numerischen Gleichungen, J. Reine Angew. Math. 22 (1841) 193--248.

L. Euler, Nova criteria radices aequationum imaginarias dignoscendi, in: Opera Omnia Ser. 1 6 (Teubner, Leipzig, 1921) 212--239.

D.J. Evans and K. Margaritis, Systolic designs for the root-squaring method, in: D.J. Evans, Ed., Systolic Algorithms (Gordon and Breach, 1991) 69--88.

D.J. Evans and K. Margaritis, Systolic designs for the root-squaring method, Internat. J. Comput. Math. 22 (1987) 43--61.

M.R. Farmer and G. Loizou, A note an a paper by G. Polya, BIT 13 (1973) 8--15.

M.R. Farmer and G. Loizou, An algorithm for the computation of zeros of a special class of entire functions, J. Comput. Appl. Math. 12--13 (1985) 433--445.

M. Fiedler, Über das Graeffesche Verfahren, Czechoslovak Math. J. 5 (1955) 506--516.

C.E. Fröberg, Introduction to Numerical Analysis (Addison-Wesley, Reading, MA, 1969).

R.A. Frazer and W.J. Duncan, On the numerical solution of equations with complex roots, Proc. Roy. Soc. London 125 (1929) 68--82.

T.C. Fry, Some numerical methods for locating roots of polynomials, Quart. Appl. Math. 3 (1945) 89--105.

A. Galántai, The comparison of numerical methods for solving polynomial equations, Math. Comp. 32 (1978) 391--397.

C.H. Graeffe, Die Auflösung der Höheren Numerischen Gleichungen (Friedrich Schulthess, Zürich, 1837) I, II and 1--44.

C.H. Graeffe, Beweis eines Satzes aus der Theorie der numerischen Gleichungen, J. Reine Angew. Math. 10 (1833) 288--291.

A.A Grau, Modified Graeffe method (Algorithm 256), Comm. ACM 8 (1965) 379--380.

A.A. Grau, On the reduction of number range in the use of the Graeffe process, J. Assoc. Comput. Mach. 10 (1963) 538--544.

D. Greenspan, On popular methods and extant problems in the solution of polynomial equations, Math. Mag. 31 (1957--1958) 239--253.

W. Heitzinger, I. Troch and G. Valentin, Praxis Nichtlinearer Gleichungen (Hanser Verlag, München, 1985).

F.B. Hildebrand, Introduction to Numerical Analysis (McGraw-Hill, New York, 1956) 312--367; 472--475.

A. Hirschleber, Praktische Auswertung von Ausnahmefällen beim Graeffeschen Verfahren, Z. Angew. Math. Mech. 37 (1957) 257--259.

A. Hirschleber, Ausnamefälle des Graeffeschen Verfahrens, Z. Angew. Math. Mech. 36 (1956) 254--255.

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.

P.G. Hoel and D.D. Wall, The accuracy of the root-squaring method for solving equations, J. Math. and Phys. 26 (1947) 156--164.

A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).

A.S. Householder, Principles of Numerical Analysis (McGraw-Hill, New York, 1953) 86--132.

A.S. Householder and G.W. Stewart, The numerical factorization of a polynomial, SIAM Rev. 13 (1971) 38--46.

A.S. Householder, Dandelin, Lobachevskii, or Graeffe?, Amer. Math. Monthly 66 (1959) 464--466.

A.S. Householder, Postscript to "Generalizations of an algorithm of Sebastião e Silva", Numer. Math. 20 (1973) 205--207.

A.S. Householder, Generalizations of an algorithm of Sebastião e Silva, Numer. Math. 16 (1971) 375--382.

A.S. Householder and G.W. Stewart, The numerical factorization of a polynomial, SIAM Rev. 13 (1971) 38--46.

J.L. Howland, The resultant iteration for determining the stability of a polynomial, Math. Comp. 32 (1978) 779--789.

C.A. Hutchinson, On Graeffe's method for the numerical solution of algebraic equations, Amer. Math. Monthly 42 (1935) 149--161.

L.H. Jamieson and T.A. Rice, A highly parallel algorithm for root extraction, IEEE Trans. Comput. 38 (1989) 443--449.

D. Jurksch, Eine zur Programmierung geeignete Modifikation des Graeffe-Verfahrens, Z. Angew. Math. Mech. 46 (1966) 161--166.

A.N. Kostovskii, On Lehmer's method for the numerical solution of algebraic equations with complex coefficients, U.S.S.R. Comput. Math. and Math. Phys. 1 (1961) 854--861.

A.N. Kostovskii, Generalized function transformation formulae in the Lobachevsky-- Graeffe method for the numerical determination of the zeros of integral and holomorphic functions, U.S.S.R. Comput. Math. and Math. Phys. 1 (1961) 362--367.

S.V. Kozlov and A.M. Shubladze, An estimate for the performance indices of linear control systems, Automat. Remote Control 48 (1987) 299--305.

K.S. Kunz, Numerical Analysis (McGraw-Hill, New York, 1957) 1--37.

C. Lanczos, Applied Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1956) 5--48.

D.H. Lehmer, The Graeffe process as applied to power series, Math. Tables Aids Comput. 1 (1945) 377--383.

D.H. Lehmer, The complete root-squaring method, J. Soc. Indust. Appl. Math. 11 (1963) 705--717.

N.I. Lobachevski, Algebra or Calculus of Finites (Kasan, 1834) 157.

W.V. Lovitt, Elementary Theory of Equations (Prentice-Hall, New York, 1939).

?. Mineur, Techniques de Calcul Numérique (Paris, 1952) 555--556.

K. Mitchell, The Graeffe Process, Math. Tab. Aids Comp. 2 (1946/47) 57--59.

E.F. Moore, A new general method for finding roots of polynomial equations, Math Tables Aids Comput. 3 (1949) 486--488.

K.L. Nielsen, Methods in Numerical analysis (McMillan, New York, 1964).

F.W.J. Olver, The evaluation of zeros of high-degree polynomials, Philos. Trans. Roy. Soc. London Ser. A 244 (1952) 385--415.

C. Orloff, Sur la methode de Graeffe, C.R. Acad. Sci. Paris 243 (1956) 1269--1270.

A. Ostrowski, Recherches sur la methode de Graeffe et les zéros des polynômes et des series de Laurent, Acta Math. 72 (1940) 99--257; also: Acta Math. 75 (1943) 183--186.

A.M. Ostrowski, Solution of Equations and Systems of Equations (Academic Press, New York, 2nd ed., 1966).

J.-P. Dedieu, A propos de la methods de Dandelin--Graeffe, C.R. Acad. Sci. Paris 309 (1989) 1019--1022.

V.Y. Pan, Algebraic complexity of computing polynomial zeros, Comput. Math. Appl. 14 (1987) 285--304.

V.Y. Pan, Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials, in: Proc. 26th Annual IEEE Symp. on Foundation of Computer Sci., Portland, OR (1985) 522--533.

J. Peltier, Résolutions Numérique des Équations Algébriques (Paris, 1957).

J. Peltier, Résolution numérique complète d'une équation algébrique quelconque, C.R. Acad. Sci. Paris 234 (1952) 399--410.

S.M. Pizer, Numerical Computing and Mathematical Analysis (Science Research Assoc., New York, 1975) 175--250.

G. Polya, Graeffe's method for eigenvalues, Numer. Math. 11 (1968) 315--319.

G. Polya, Sur la méthode de Graeffe, C.R. Acad. Sci. Paris 156 (1913) 1145--1147.

G. Polya, Über das Graeffesche Verfahren, Z. Math. Phys. 63 (1915) 275--290.

G. Polya, Über das Graeffesche Verfahren, Z. Math. Phys. 63 (1914) 275--290.

A. Rényi and P. Turan, On the zeros of polynomials, Acta Math. Acad. Sci. Hungar. 3 (1952) 275--285.

A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis (McGraw-Hill, New York, 2nd ed., 1987) 354.

T.A. Rice and L.H. Jamieson, A highly parallel algorithm for root extraction, IEEE Trans. Comput. 38 (1989) 443--449.

C. Runge, Separation und Approximation der Wurzeln, in: Encyklopädie der Mathematischen Wissenschaften, I, 1 (Teubner, Leipzig, 1898) 404--448.

C. Runge, Praxis der Gleichungen (De Gruyter, Berlin, 1921).

C. Runge and H. König, Vorlesungen über Numerisches Rechnen (Springer, Berlin, 1924) 150--176.

H. Rutishauser, On a modification of the QD-algorithm with Graeffe-type convergence, Z. Angew. Math. Phys. 13 (1962) 493--496; also: in: C.M. Popplewell, Ed., Proc. IFIP Congress 62 (North-Holland, Amsterdam, 1963) 93--96.

N.P. Salikov, A modification of Lobatchevsky's method for calculating the moduli of the roots of an algebraic equation, U.S.S.R. Comput. Math. and Math. Phys. 3 (1963) 65--87.

R. San Juan, Compléments à la méthode de Gräffe pour la resolution des équations algébriques, Bull. Sci. Math. 59 (1935) 104--109.

H. Sanden, Practical Mathematical Analysis, translation: H. Levy (Methuen, London, 1923).

J.B. Scarborough, Numerical Mathematical Analysis (Johns Hopkins Univ. Press, Baltimore, MD, 1968) Chapters 8, 10, 11.

H.S. Sharp, A comparison of methods for evaluating the complex roots of quartic equations, J. Math. and Phys. 20 (3) (1941) 249--250.

J. Singer, Elements of Numerical Analysis (Academic Press, London, 1964) 137--199.

P. Turan, On a New Method of Analysis and its Applications (Wiley, New York, 1984) 290--308.

P. Turan, The power sum method and the approximative solution of algebraic equations, Math. Comp. 29 (1975) 311--318.

E. Waring, Miscellanea Analytica de Aequationibus Algebraicis (Cambridge Univ. Press, Cambridge, 1762) 16--25.

H. Weber, Traité d'Algèbra Supérieure (Gauthier-Villars, Paris, 1898).

H. Weber, Lehrbuch der Algebra (Chelsea, New York).

G.P. Weeg, Truncation error in the Graeffe root squaring method, J. Assoc. Comput. Mach. 7 (1960) 69--71.

E.T. Whittaker and G. Robinson, The Calculus of Observations (London, 4th ed., 1944) 78--131.

M.V. Wilkes, D.J. Wheeler and S. Gill, The Preparation of Programs for an Electronic Digital Computer (Addison-Wesley, Cambridge, MA, 1951) 66--71.

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.

F.A. Willers, Practical Analysis (Dover, New York, 1948) 205--265.

V.L. Zaguskin, Handbook of Numerical Methods for the Solution of Algebraic and Transcendental Equations (Pergamon, Oxford, 1961).

R. Zurmühl, Praktische Mathematik (Springer, Berlin, 1971).