Algorithm 652
Layne T. Watson, Stephen C. Billups, Alexander P. Morgan · ACM Transactions on Mathematical Software · 1987
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 homotopy 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.
Cited by 379 works. doi:10.1145/29380.214343 Open-access PDF
Authors
References
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations
- Computational Methods of Linear Algebra
- Computer solution of ordinary differential equations : the initial value problem
- Linear least squares solutions by householder transformations
- Computational Methods of Linear Algebra.
- The solution of nonlinear finite element equations
- ON THE SOLUTION OF NONLINEAR FINITE ELEMENT EQUATIONS.
- The conjugate-gradient method for solving linear systems
- Newton-type methods for unconstrained and linearly constrained optimization
- Solving Polynominal Systems Using Continuation for Engineering and Scientific Problems