Find a copy in the library
Finding libraries that hold this item...
Details
| Document Type: | Book |
|---|---|
| All Authors / Contributors: |
Samuel Schechter; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE. |
| OCLC Number: | 227480334 |
| Notes: | Research supported in part by AEC. Prepared in cooperation with New York Univ., N.Y. |
| Description: | 22 p. |
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. (Author).
Reviews
User-contributed reviews
Add a review and share your thoughts with other readers.
Be the first.
Add a review and share your thoughts with other readers.
Be the first.
Tags
Add tags for "RELAXATION METHODS FOR CONVEX PROBLEMS.".
Be the first.
