Morgan, Alexander P.Watson, Layne T.2013-06-192013-06-191986-05-01http://hdl.handle.net/10919/19749Certain classes of nonlinear systems of equations, such as polynomial systems, have properties that make them particularly amenable to solution on distributed computing systems. Some algorithms, considered unfavorably on a single processor serial computer, may be excellent on a distributed system. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube. Some computational results are reported.application/pdfenIn CopyrightGlobally Convergent Parallel Algorithm for Zeros of Polynomial SystemsTechnical reportTR-86-25http://eprints.cs.vt.edu/archive/00000032/01/TR-86-25.pdf