BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-67-63
       ENTRY:: January 03, 1996
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Graeffe's method for eigenvalues
        TYPE:: Technical Report
      AUTHOR:: Polya, George
        DATE:: April 1967
       PAGES:: 11
    ABSTRACT:: Let an entire function F(z) of finite genus have infinitely
               many zeros which are all positive, and take real values for
               real z. Then it is shown how to give two-sided bounds for all
               the zeros of F in terms of the coefficients of the power
               series of F, and of coefficients obtained by Graeffe's
               algorithm applied to F. A simple numerical illustration is
               given for a Bessel function.
       NOTES:: [Adminitrivia V1/Prg/19960103]
         END:: STAN//CS-TR-67-63