Computer Science Technical Reports
CS at VT

HOMPACK: A Suite of Codes for Globally Convergent Homotopy Algorithms

Watson, Layne T. and Billups, Stephen C. and Morgan, Alexander P. (1990) HOMPACK: A Suite of Codes for Globally Convergent Homotopy Algorithms. Technical Report TR-90-36, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-90-36.pdf (1590701)


There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotoppy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK provides three qualitatively different algorithms for tracking the homotopy zero curve: ordinary differential equation based, normal flow, and augmented Jacobian matrix. Separate routines are also provided for dense and sparse Jacobian matrices. A high level driver is included for the special case of polynomial systems.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:218
Deposited By:User autouser
Deposited On:05 December 2001