Billups, Stephen C.2019-07-032019-07-031985http://hdl.handle.net/10919/90914There are algorithms for finding zeros or fixed points of nonlinear systems of (algebraic) 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. The augmented Jacobian matrix algorithm is part of the software package HOMPACK, and is based on an algorithm developed by W.C. Rheinboldt. The algorithm exists in two forms-one for dense Jacobian matrices, and the other for sparse Jacobian matrices.iii, 124 leavesapplication/pdfen-USIn CopyrightLD5655.V855 1985.B544JacobiansHomotopy theoryNonlinear theoriesThesis