Approximate Newton methods and homotopy for stationary operator equations

A quadratically convergent algorithm based on a Newton-type iteration is defined to approximate roots of operator equations in Banach spaces. Fréchet derivative operator invertibility is not required; approximate right inverses are used in a neighborhood of the root. This result, which requires an initially small residual, is sufficiently robust to yield existence; it may be viewed as a generalized version of the Kantorovich theorem. A second algorithm, based on continuation via single, Euler-predictor-Newton-corrector iterates, is also presented. It has the merit of controlling the residual until the homotopy terminates, at which point the first algorithm applies. This method is capable of yielding existence of a solution curve as well. An application is given for operators described by compact perturbations of the identity.

[1]  Layne T. Watson,et al.  Fixed points of C2 maps , 1979 .

[2]  Iterative methods of contractor directions , 1980 .

[3]  J. E. Dennis,et al.  On Newton-like methods , 1968 .

[4]  W. Rheinboldt,et al.  On the Discretization Error of Parametrized Nonlinear Equations , 1983 .

[5]  D. Rose,et al.  Global approximate Newton methods , 1981 .

[6]  Arthur Wouk,et al.  A course of applied functional analysis , 1979 .

[7]  L. Kantorovich,et al.  Functional analysis in normed spaces , 1952 .

[8]  L. Watson.  A globally convergent algorithm for computing fixed points of C2 maps , 1979 .

[9]  J. Jerome.  A criterion for isolated solution structure and global computability for operator equations , 1986 .

[10]  W. Rheinboldt,et al.  On steplength algorithms for a class of continuation methods siam j numer anal , 1981 .

[11]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[12]  J. Yorke,et al.  Finding zeroes of maps: homotopy methods that are constructive with probability one , 1978 .

[13]  L. Kantorovich,et al.  Functional analysis and applied mathematics , 1963 .

[14]  J. Ortega.  The Newton-Kantorovich Theorem , 1968 .

[15]  Richard A. Tapia,et al.  The Kantorovich Theorem for Newton's Method , 1971 .

[16]  R. Tapia,et al.  Optimal Error Bounds for the Newton–Kantorovich Theorem , 1974 .

[17]  Tony F. Chan,et al.  Arc-Length Continuation and Multigrid Techniques for Nonlinear Elliptic Eigenvalue Problems , 1982 .

[18]  P. J. Davis,et al.  Introduction to functional analysis , 1958 .

[19]  J. Jerome.  Fixed Point and Implicit Function Theorems and Their Applications , 1984 .

[20]  Werner C. Rheinboldt,et al.  Solution Fields of Nonlinear Equations and Continuation Methods , 1980 .

[21]  R. Kellogg,et al.  A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results , 1976 .

[22]  Layne T. Watson,et al.  Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C2 Maps [C5] , 1980, TOMS.

[23]  A. Ostrowski.  Solution of equations and systems of equations , 1967 .

[24]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[25]  Randolph E. Bank,et al.  Numerical Methods for Semiconductor Device Simulation , 1983 .

[26]  J. Partington,et al.  Introduction to Functional Analysis , 1981, The Mathematical Gazette.

[27]  Joseph W. Jerome,et al.  An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner , 1985 .

[28]  W. Rheinboldt.  A unified convergence theory for a class of iterative processes. , 1968 .

[29]  Richard A. Tapia,et al.  THE KANTOROVICH THEOREM AND ERROR ESTIMATES FOR NEWTON'S METHOD. , 1970 .