Abstract
Polynomial systems of equations frequently arise in many applications such as solid modelling, robotics, computer vision, chemistry, chemical engineering, and mechanical engineering. Locally convergent iterative methods such as quasi-Newton methods may diverge or fail to find all meaningful solutions of a polynomial system. Recently a homotopy algorithm has been proposed for polynomial systems that is guaranteed globally convergent (always converges from an arbitrary starting point) with probability one, finds all solutions to the polynomial system, and has a large amount of inherent parallelism. There are several ways the homotopy algorithms can be decomposed to run on a hypercube. The granularity of a decomposition has a profound effect on the performance of the algorithm. The results of decompositions with two different granularities are presented. The experiments were conducted on an iPSC-16 hypercube using actual industrial problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allgower, E., and Georg, K. 1980. Simplicial and continuation methods for approximating fixed points. SIAM Rev., 22, 1 (Jan.), 28–85.
Allison, D.C.S., Harimoto, S., and Watson, L.T. 1988. The granularity of parallel homotopy algorithms for polynomial systems of equations. In Conference Proceedings—1988 Int. Conf. on Parallel Processing (St. Charles, Ill., Aug. 16–19), IEEE Computer Society Press, pp 165–168.
Billups, S.C. 1985. An augmented Jacobian matrix algorithm for tracking homotopy zero curves. M.S. thesis, Dept. of Computer Science, VPI&SU, Blacksburg, Va.
Businger, P., and Golub, G.H. 1965. Linear least squares solutions by Householder transformations. Numer. Math., 7, 3 (May), 269–276.
Byrd, R.H., Schnabel, R.B., and Shultz, G.A. 1987. Using parallel function evaluation to improve Hessian approximation for unconstrained optimization. Tech. Rept. CS-CU-361–87, Dept. of Computer Science, University of Colorado, Boulder, Colo.
Chen, A.C., and Wu, C.L. 1984. Optimum solution to dense linear systems of equations. In Conference Proceedings—1984 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 21–24), IEEE Computer Society Press, pp. 417–425.
Chern, M.Y., and Murata, T. 1983. Fast algorithm for concurrent LU decomposition and matrix inversion. In Conference Proceedings—1983 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 23–26), Computer Society Press, pp. 79–86.
Chow, S.N., Mallet-Paret, J., and Yorke, J.A. 1978. Finding zeros of maps: Homotopy methods that are constructive with probability one. Math. Comput., 32, 143 (July), 887–899.
Dennis, J.E. Jr., and Schnabel, R.B. 1987. A view of unconstrained optimization. Tech. Rept. CU-CS-376–87, Dept. of Computer Science, University of Colorado, Boulder, Colo.
Ellis, G.H., and Watson, L.T. 1984. A parallel algorithm for simple roots of polynomials. Comput. Math. Appl., 10, 2: 107–121.
Finkel, R.A. 1987. Large-grain parallelism-Three case studies. In The characteristics of parallel algorithms (L.H. Jamieson, D.B. Gannon, and R.J. Douglass, eds.), MIT Press, Cambridge, Mass., pp. 21–63.
Gajski, D.D., Sameh, A.H., and Wisniewski, J.A. 1982. Iterative algorithms for tridiagonal matrices on a WSI-multiprocessor. In Conference Proceedings-1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24–27), IEEE Computer Society Press, pp. 82–89.
Gentzsch, W., and Schafer, G. 1984. Solution of large linear systems on vector computers. Parallel Computing 83, North Holland, Amsterdam, pp. 159–166.
Heller, D. 1978. A survey of parallel algorithms in numerical linear algebra. SIAM Rev., 20, 3 (Oct.), 740–777.
Kowalik, J.S., and Kumar, S.P. 1982. An efficient parallel block conjugate gradient method for linear equations. In Conference Proceedings—1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24–27), IEEE Computer Society Press, pp. 47–52.
Kubicek, M. 1976. Dependence of solutions of nonlinear systems on a parameter. ACM Trans. Math. Software, 2, 1 (Mar.), 98–107.
Lakshmivarahan, S., and Dhall, S.K. 1985. Parallel algorithms for solving certain classes of linear recurrences. In Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 206, Springer-Verlag, Berlin, pp. 457–477.
Morgan, A.P. 1986a. A homotopy for solving polynomial systems. Appl. Math. Comput., 18, 1 (Jan.), 87–92.
Morgan, A.P. 1986b. A transformation to avoid solutions at infinity for polynomial systems. Appl. Math. Comput., 18, 1 (Jan.), 77–86.
Morgan, A.P. 1987. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Prentice-Hall, Englewood Cliffs, N.J.
Morgan, A.P., and Watson, L.T. 1986. A globally convergent parallel algorithm for zeros of polynomial systems. Tech. Rept. TR-86–25, Dept. of Computer Science, VPI&SU, Blacksburg, Va.
Parkinson, D. 1984. The solutions of N linear equations using P processors. In Parallel Computing 83, North Holland, Amsterdam, pp. 81–87.
Pelz, W., and Watson, L.T. 1986. Message length effects for solving polynomial systems on a hypercube. Tech. Rept. TR-86–26, Dept. of Computer Science, VPI&SU, Va.
Reed, D.A., and Patrick, M.L. 1984. A model of asynchronous iterative algorithms for solving large sparse linear systems. In Conference Proceedings-1984 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 21–24), IEEE Computer Society Press, pp. 402–410.
Rheinboldt, W.C., and Burkardt, J.V. 1983. Algorithm 596: A program for a locally parameterized continuation process. ACM Trans. Math. Software, 9, 2 (June), 236–241.
Rice, T.A., and Siegel, L.J. 1982. A parallel algorithm for finding the roots of a polynomial. In Conference Proceedings—1982 Int. Conf. on Parallel Processing (Bellaire, Mich., Aug. 24–27), IEEE Computer Society Press, pp. 57–61.
Schnabel, R.B. 1986. Concurrent function evaluations in local and global optimization. Tech. Rept. CS-CU-345–86, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo.
Schnabel, R.B., and Frank, P.D. 1986. Solving systems of nonlinear equations by tensor methods. Tech. Rept. CU-CS-334–86, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo.
Schwandt, H. 1985. Newton-like interval methods for large nonlinear systems of equations on vector computers. Computer Phys. Comm., 37, 1–3 (July), 223–232.
Shampine, L.F., and Gordon, M.K. 1975. Computer Solution of Ordinary Differential Equations: The Initial Value Problem. W.H. Freeman, San Francisco, Calif.
Watson, L.T. 1979. A globally convergent algorithm for computing fixed points of C 2 maps. Appl. Math. Comput., 5, 4 (Oct.), 297–311.
Watson, L.T. 1986. Numerical linear algebra aspects of globally convergent homotopy methods. SIAM Rev., 28, 4 (Dec.), 529–545.
Watson, L.T., and Fenner, D. 1980. Chow-Yorke algorithm for fixed points or zeros of C 2 maps. ACM Trans. Math. Software, 6, 2 (June), 252–260.
Watson, L.T., Billups, S.C., and Morgan, A.P. 1987. Algorithm 652: HOMPACK: A suite of codes for globally convergent homotopy algorithms. ACM Trans. on Math. Software, 13, 3 (Sept.), 281–310.
White, R. 1986a. Parallel algorithms for nonlinear problems. SIAM J. Algebraic Discrete Methods, 7, 1 (Jan.), 137–149.
White, R. 1986b. A nonlinear parallel algorithm with application to the Stefan problem. SIAM J. Numer. Anal., 23, 3 (June), 639–652.
Author information
Authors and Affiliations
Additional information
This work was supported in part by AFOSR grant 85-0250.
Rights and permissions
About this article
Cite this article
Allison, D.C.S., Chakraborty, A. & Watson, L.T. Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube. J Supercomput 3, 5–20 (1989). https://doi.org/10.1007/BF00129645
Issue Date:
DOI: https://doi.org/10.1007/BF00129645