Message Length Effects for Solving Polynomial Systems on a Hypercube
1986) Message Length Effects for Solving Polynomial Systems on a Hypercube. Technical Report TR-86-26, Computer Science, Virginia Polytechnic Institute and State University. (
Comparisons between problems solved on uniprocessor systems and those solved on distributed computing systems generally ignore the overhead associated with information transfer from one process to another. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube and some timing results for different situations.
|Item Type:||Departmental Technical Report|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||User autouser|
|Deposited On:||03 November 2005|