Note on the end game in homotopy zero curve tracking
- 1 September 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 22 (3) , 281-287
- https://doi.org/10.1145/232826.232843
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- A globally convergent parallel algorithm for zeros of polynomial systemsNonlinear Analysis, 1989
- Globally convergent homotopy methods: A tutorialApplied Mathematics and Computation, 1989
- Algorithm 652ACM Transactions on Mathematical Software, 1987