ACM Transactions on Mathematical Software · 1996 · 33 citations · 5 references
ComputingComputer ScienceMathematicsAlgorithmsDynamical SystemsScientific ComputingNumerical AlgorithmsNumerical Methods For Differential EquationsComputational HomotopyNonlinear Equation SolversNonlinear System ModelingNonlinear Systems Solvers
Homotopy algorithms to solve a nonlinear system of equations f(x) = 0 involve tracking the zero curve of a homotopy map p(a, λ, x) from λ = 0 until λ = 1. When the algorithm nears or crosses the hyperplane λ = 1, an “end game” phase is begun to compute the solution x¯ satisfying p(a, λ, x¯) = f(x¯) = 0. This note compares several end game strategies, including the one implemented in the normal flow code FIXPNF in the homotopy software package HOMPACK.
5
Layne T. Watson, Stephen C. Billups, Alexander P. Morgan · ACM Transactions on Mathematical Software · 1987 · 382 citations · Full text
Globally convergent homotopy methods: a tutorial
Layne T. Watson · 1989 · 106 citations
Globally convergent homotopy methods: A tutorial
L.T. Watson · Applied Mathematics and Computation · 1989 · 105 citations · Full text