Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
Author:
- Layne T. WatsonLWLayne T. Watson
- 1 December 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 28 (4) , 529-545
Abstract
Probability one homotopy algorithms are a class of methods for solving nonlinear systems of equations that are globally convergent with probability one. These methods are theoretically powerful, and if constructed and implemented properly, are robust, numerically stable, accurate, and practical. The concomitant numerical linear algebra problems deal with rectangular matrices, and good algorithms require a delicate balance (not always achieved) of accuracy, robustness, and efficiency in both space and time. The author's experience with globally convergent homotopy algorithms is surveyed here, and some of the linear algebra difficulties for dense and sparse problems are discussed.Keywords
This publication has 67 references indexed in Scilit:
- Robust nonlinear least squares estimation using the Chow-Yorke homotopy methodJournal of Guidance, Control, and Dynamics, 1984
- Piecewise Smooth Homotopies1983
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- A homotopy method for locating all zeros of a system of polynomials1979
- The homotopy continuation method: numerically implementable topological proceduresTransactions of the American Mathematical Society, 1978
- Finding zeroes of maps: homotopy methods that are constructive with probability oneMathematics of Computation, 1978
- Homotopies for computation of fixed points on unbounded regionsMathematical Programming, 1972
- Homotopies for computation of fixed pointsMathematical Programming, 1972
- The Solution of Nonlinear Systems of Equations by A-Stable Integration TechniquesSIAM Journal on Numerical Analysis, 1971
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965