ISSN:
1436-4646
Keywords:
Retrogressing Paths
;
Homotopy Method
;
Fixed-point Algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract For certain functionsf fromR n toR n , the Eaves—Saigal algorithm computes a path inR n × (0, 1] which converges to a zero off. In this case, it is shown that even whenf is of classC ∞ and has a unique zero, the converging path may retrogress infinitely many times.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581651