The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations

dc.contributor.authorAllison, Donald C. S.en
dc.contributor.authorHarimoto, S.en
dc.contributor.authorWatson, Layne T.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:52Zen
dc.date.available2013-06-19T14:35:52Zen
dc.date.issued1988-05-01en
dc.description.abstractPolynomial systems consist of n polynomial functions in n variables, with real or complex coefficients. Finding zeros of such systems is challenging because there may be a large number of solutions, and Newton-type methods can rarely be guaranteed to find the complete set of solutions. There are homotopy algorithms for polynomial systems of equations that are globally convergent from an arbitrary starting point with probability one, are guaranteed to find all the solutions, and are robust, accurate, and reasonably efficient. There is inherent parallelism at several levels in these algorithms. Several parallel homotopy algorithms with different granularities are studied on several different parallel machines, using actual industrial problems from chemical engineering and solid modeling.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000089/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000089/01/TR-88-04.pdfen
dc.identifier.trnumberTR-88-04en
dc.identifier.urihttp://hdl.handle.net/10919/20006en
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.titleThe Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equationsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR-88-04.pdf
Size:
1.02 MB
Format:
Adobe Portable Document Format