There 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. / M.S.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/90914 |
| Date | January 1985 |
| Creators | Billups, Stephen C. |
| Contributors | Computer Science and Applications |
| Publisher | Virginia Polytechnic Institute and State University |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Thesis, Text |
| Format | iii, 124 leaves, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 13131179 |
Page generated in 0.0017 seconds