The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations

Embedding algorithms used to solve nonlinear systems of equations do so by constructing a continuous family of systems and solving the given system by tracking the continuous curve of solutions to the family. Solving nonlinear equations by a globally convergent embedding algorithm requires the evaluation and factoring of a Jacobian matrix at many points along the embedding curve. Ways to optimize the Jacobian matrix on a hypercube are described. Several static and dynamical strategies for assigning components of the Jacobian to processors on the hypercube are investigated. It is found that a static rectangular grid mapping is the preferred choice for inclusion in a robust parallel mathematical software package. The static linear mapping is a viable alternative when there are many common subexpressions in the component evaluation, and the dynamic assignment strategy should only be considered when there is large variation in the evaluation times for the components, leading to a load imbalance on the processors. >

[1]  Layne T. Watson,et al.  Preconditioned Iterative Methods for Homotopy Curve Tracking , 1992, SIAM J. Sci. Comput..

[2]  Layne T. Watson,et al.  Solving Nonlinear Equations on a Hypercube , 1986 .

[3]  Layne T. Watson,et al.  Message length effects for solving polynomial systems on a hypercube , 1989, Parallel Comput..

[4]  Layne T. Watson,et al.  Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking , 1991, SIAM J. Optim..

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

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

[7]  Alan George,et al.  QR Factorization of a Dense Matrix on a Hypercube Multiprocessor , 1990, SIAM J. Sci. Comput..

[8]  Layne T. Watson,et al.  Parallel Homotopy Curve Tracking on a Hypercube , 1989, PPSC.

[9]  S. Lennart Johnsson,et al.  Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures , 1988, ICPP.

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

[11]  Layne T. Watson,et al.  The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations , 1988 .

[12]  Layne T. Watson,et al.  The Granularity of Homotopy Algorithms for Polynomial Systems of Equations , 1987, SIAM Conference on Parallel Processing for Scientific Computing.

[13]  Layne T. Watson,et al.  Note on unit tangent vector computation for homotopy curve tracking on a hypercube , 1991, Parallel Comput..

[14]  Paul E. Plassmann,et al.  Solution of Nonlinear Least Squares Problems on a Multiprocessor , 1988, Shell Conference.

[15]  C. Bischof.  QR Factorization Algorithms for Coarse-Grained Distributed Systems , 1988 .

[16]  Layne T. Watson,et al.  A globally convergent parallel algorithm for zeros of polynomial systems , 1989 .

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

[18]  Robert B. Schnabel,et al.  Concurrent Function Evaluations in Local and Global Optimization ; CU-CS-345-86 , 1987 .

[19]  Christian H. Bischof,et al.  A Parallel QR Factorization Algorithm with Controlled Local Pivoting , 1991, SIAM J. Sci. Comput..