A variant of a convergent fixed-point algorithm that avoids computing Jacobians
Augusto Ferrante, A. Lepschy, Umberto Viaro · Institutional Research Information System (University of Udine) · 2001
The paper provides a generalization of the chord method for searching the fixed points of a multidimensional function. It is derived from the algorithm in [2] which is based, instead, on the tangent procedure. The method is preferable to the alternative technique from the point of view of numerical robustness and, sometimes, converges more rapidly.