BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-66-45
       ENTRY:: January 19, 1996
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Relaxation methods for semi-definite systems
        TYPE:: Technical Report
      AUTHOR:: Kahan, William
        DATE:: August 1966
       PAGES:: 36
    ABSTRACT:: Certain non-stationary relaxation iterations, which are
               commonly applied to positive definite symmetric systems of
               linear equations, are also applicable to a semi-definite
               system provided that system is consistent. Some of the
               convergence theory of the former application is herein
               extended to the latter application. The effects of rounding
               errors and of inconsistency are discussed too, but with few
               helpful conclusions. Finally, the application of these
               relaxation iterations to an indefinite system is shown here
               to be ill-advised because these iterations will almost
               certainly diverge exponentially.
       NOTES:: [Adminitrivia V1/Prg/19960119]
         END:: STAN//CS-TR-66-45