Show simple item record

dc.contributor.authorWatson, Layne T.en_US
dc.date.accessioned2013-06-19T14:37:06Z
dc.date.available2013-06-19T14:37:06Z
dc.date.issued2000
dc.identifierhttp://eprints.cs.vt.edu/archive/00000559/en_US
dc.identifier.urihttp://hdl.handle.net/10919/20078
dc.description.abstractProbability-one homotopy algorithms are a class of methods for solving nonlinear systems of equations that,under mild assumptions,are globally convergent for a wide range of problems in science and engineering.Convergence theory, robust numerical algorithms,and production quality mathematical software exist for general nonlinear systems of equations, and special cases suc as Brouwer fixed point problems,polynomial systems,and nonlinear constrained optimization.Using a sample of challenging scientific problems as motivation,some pertinent homotopy theory and algorithms are presented. The problems considered are analog circuit simulation (for nonlinear systems),reconfigurable space trusses (for polynomial systems),and fuel-optimal orbital rendezvous (for nonlinear constrained optimization).The mathematical software packages HOMPACK90 and POLSYS_PLP are also briefly described.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.subjectParallel computationen_US
dc.titleProbability-one Homotopies in Computational Scienceen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-00-03en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000559/01/TR-00-03.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record