Subscribe

Issue No.04 - April (1993 vol.4)

pp: 458-465

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219760

ABSTRACT

<p>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.</p>

INDEX TERMS

Index Termsparallel complexity; embedding algorithms; nonlinear equations; Jacobian matrix;hypercube; static rectangular grid mapping; mathematical software package; dynamicassignment; computational complexity; nonlinear equations; parallel algorithms

CITATION

A. Chakraborty, D.C.S. Allison, C.J. Ribbens, L.T. Watson, "The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations",

*IEEE Transactions on Parallel & Distributed Systems*, vol.4, no. 4, pp. 458-465, April 1993, doi:10.1109/71.219760