BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-738
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Computations related to G-stability of linear multistep
               methods
        TYPE:: Technical Report
      AUTHOR:: LeVeque, Randall J.
      AUTHOR:: Dahlquist, Germund
      AUTHOR:: Andree, Dan
        DATE:: May 1979
       PAGES:: 28
    ABSTRACT:: In Dahlquist's recent proof of the equivalence of A-stability
               and G-stability, an algorithm was presented for calculating a
               G-stability matrix for any A-stable linear multistep method.
               Such matrices, and various quantities computable from them,
               are useful in many aspects of the study of the stability of a
               given method. For example, information may be gained as to
               the shape of the stability region, or the rate of growth of
               unstable solutions. We present a summary of the relevant
               theory and the results of some numerical calculations
               performed for several backward differentiation,
               Adams-Bashforth, and Adams-Moulton methods of low order.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-738