BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-68-88
       ENTRY:: December 20, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Relaxation methods for convex problems
        TYPE:: Technical Report
      AUTHOR:: Schechter, Samuel
        DATE:: February 1968
       PAGES:: 20
    ABSTRACT:: Extensions and simplifications are made for convergence
               proofs of relaxation methods for nonlinear systems arising
               from the minimization of strictly convex functions. This work
               extends these methods to group relaxation, which includes an
               extrapolated form of Newton's method, for various orderings.
               A relatively simple proof is given for cyclic orderings,
               sometimes referred to as nonlinear overrelaxation, and for
               residual orderings where an error estimate is given. A less
               restrictive choice of relaxation parameter is obtained than
               that previously. Applications are indicated primarily to the
               solution of nonlinear elliptic boundary problems.
       NOTES:: [Adminitrivia V1/Prg/19951220]
         END:: STAN//CS-TR-68-88