ISSN:
0945-3245
Keywords:
AMS(MOS): 65F05
;
CR: G1.3
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary In this paper we consider an extension to nonlinear algebraic systems of the class of algorithms recently proposed by Abaffy, Broyden and Spedicato for general linear systems. We analyze the convergence properties, showing that under the usual assumptions on the function and some mild assumptions on the free parameters available in the class, the algorithm is locally convergent and has a superlinear rate of convergence (per major iteration, which is computationally comparable to a single Newton's step). Some particular algorithms satisfying the conditions on the free parameters are considered.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01397545
Permalink