Engineering Applications of the Chow-Yorke Algorithm

Simple item page
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:31Zen
dc.date.available2013-06-19T14:36:31Zen
dc.date.issued1981en
dc.description.abstractThe Chow-Yorke algorithm is a scheme for developing homotopy methods that are globally convergent with probability one. Homotopy maps leading to globally convergent algorithms have been created for Brouwer fixed point problems, certain classes of nonlinear systems of equations, the nonlinear complementarity problem, some nonlinear two-point boundary value problems, and convex optimization problems. The Chow-Yorke algorithm has been successfully applied to a wide range of engineering problems, particularly those for which quasi-Newton and locally convergent iterative techniques are inadequate. Some of those engineering applications are surveyed here.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000863/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000863/01/CS81006-R.pdfen
dc.identifier.trnumberCS81006-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20352en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleEngineering Applications of the Chow-Yorke Algorithmen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS81006-R.pdf
Size:
1.14 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports