skip to content
RELAXATION METHODS FOR CONVEX PROBLEMS. Preview this item
ClosePreview this item
Checking...

RELAXATION METHODS FOR CONVEX PROBLEMS.

Author: Samuel Schechter; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center 16 FEB 1968.
Edition/Format:   Book : English
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; 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
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227480334>
library:oclcnum"227480334"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227480334>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"16 FEB 1968"
schema:datePublished"1968"
schema:description"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)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/354189503>
schema:inLanguage"en"
schema:name"RELAXATION METHODS FOR CONVEX PROBLEMS."@en
schema:numberOfPages"22"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.