Trajectory nets connecting all critical points of a smooth function
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
A computational method for finding all the roots of a vector function
Applied Mathematics and Computation
Numerical continuation methods: an introduction
Numerical continuation methods: an introduction
Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms
ACM Transactions on Mathematical Software (TOMS)
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Hi-index | 0.48 |
A global analysis of Branin's method (originally due to Davidenko) for finding all the real zeros of a vector function is carried out. The analysis is based on a global study of this method perceived of as a dynamical system. Since Branin's algorithm is closely related to homotopy methods, this paper sheds some light on the global performance of these methods when employed for locating all the zeros of a vector function. Following the dynamical system approach, the performance of Branin's algorithm is related to the existence of extraneous singularities as well as to the relative spatial distribution of the zeros of the vector function and singular manifolds. Branin's conjectures regarding the types and the role of extraneous singularities are examined and counterexamples are provided to disprove them. We conclude that the performance of Branin's method for locating all the zeros of a vector function is questionable even in the absence of extraneous singularities.