Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems
(1986) Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems. Technical Report TR-86-25, Computer Science, Virginia Polytechnic Institute and State University.
Full text available as: |
Abstract
Certain 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.
| Item Type: | Departmental Technical Report |
|---|---|
| Subjects: | Computer Science > Historical Collection(Till Dec 2001) |
| ID Code: | 32 |
| Deposited By: | User autouser |
| Deposited On: | 03 November 2005 |