A globally convergent method for finding zeros of smooth functions

作者:

Highlights:

摘要

Computing a zero of a smooth function is an old and extensively researched problem in numerical computation. While a large body of results and algorithms has been reported on this problem in the literature, to the extent we are aware, the published literature does not contain a globally convergent1 algorithm for finding a zero of an arbitrary smooth function. In this paper we present the first globally convergent algorithm for computing a zero (if one exists) of a general smooth function. After presenting the algorithm and a proof of global convergence, we also clarify the connection between our algorithm and some known results in topological degree theory.

论文关键词:Global convergence,Parallel homotopy,Root-finding,Degree theory,Smooth function

论文评审过程:Available online 27 September 2001.

论文官网地址:https://doi.org/10.1016/S0096-3003(01)00244-2