Message length effects for solving polynomial systems on a hypercube

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.

[1]  J. S. Kowalik,et al.  An efficient parallel block conjugate method for linear equations , 1982, ICPP.

[2]  R. White.  Parallel algorithms for nonlinear problems , 1986 .

[3]  L. Watson.  Numerical linear algebra aspects of globally convergent homotopy methods , 1986 .

[4]  Layne T. Watson,et al.  A parallel algorithm for simple roots for polynomials , 1984 .

[5]  Werner C. Rheinboldt,et al.  Algorithm 596: a program for a locally parameterized , 1983, TOMS.

[6]  E. Allgower,et al.  Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .

[7]  G. Golub,et al.  Linear least squares solutions by householder transformations , 1965 .

[8]  L. Shampine,et al.  Computer solution of ordinary differential equations : the initial value problem , 1975 .

[9]  Thomas A. Rice,et al.  A parallel algorithm for finding the roots of a polynomial , 1982, ICPP.

[10]  Yukio Kaneda,et al.  Highly Parallel Computing of Linear Equations on the Matrix-Broadcast-Memory Connected Array Processor System , 1982, IMACS World Congress.

[11]  A. Morgan.  A transformation to avoid solutions at infinity for polynomial systems , 1986 .

[12]  J. Yorke,et al.  Finding zeroes of maps: homotopy methods that are constructive with probability one , 1978 .

[13]  D. Heller.  A Survey of Parallel Algorithms in Numerical Linear Algebra. , 1978 .

[14]  Layne T. Watson,et al.  Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C2 Maps [C5] , 1980, TOMS.

[15]  Milan Kubicek,et al.  Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5] , 1976, TOMS.

[16]  D. A. Reed,et al.  A model of asynchronous iterative algorithms for solving large, sparse, linear systems , 1984 .

[17]  Ming-Yang Chern,et al.  A Fast Algorithm for Concurrent LU Decomposition and Matrix Inversion , 1983, ICPP.

[18]  S. Lakshmivarahan,et al.  Parallel Algorithms for Solving Certain Classes of Linear Recurrences , 1985, FSTTCS.

[19]  Layne T. Watson,et al.  Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms , 1987, TOMS.

[20]  R. White.  A nonlinear parallel algorithm with application to the Stefan problem , 1986 .

[21]  A. Morgan.  Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .

[22]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[23]  Alexander P. Morgan.  A homotopy for solving polynomial systems , 1986 .

[24]  L. Watson.  A globally convergent algorithm for computing fixed points of C2 maps , 1979 .

[25]  Daniel Gajski,et al.  Iterative algorithms for tridiagonal matrices on a WSI-multiprocessor , 1982, ICPP.

[26]  H. Schwandt.  Newton-like interval methods for large nonlinear systems of equations on vector computers , 1985 .