An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
The paper concerns a class of adaptive, approximate Newton methods based on Nash-Moser iteration. For operator equations \(F(u)=0\) the superlinear (or quadratic) convergence of the approximate Newton iterates \(\{u_ k\}\), computed by means of approximate right inverses \(T_ h(u_ k)\) of \(F'(u_ k)\), requires the estimation of \(F'(u_ k)T_ h(u_ k)-I\) in terms of the residual. In the case of nonlinear differential operators and for \(T_ h\) defined by numerical procedures - such as the finite element method - these estimates fail in the sense that a loss of derivative phenomenon arises, as in the Nash-Moser results. Unlike of \textit{J. Moser}'s basic paper [Ann. Sc. Norm., Sup. Pisa, Sci. Fis., Mat., III. Ser. 20, 265-315 (1966; Zbl 0144.182)] the author separates the required smoothing operators \(S_{t_ k}\) from the inverse approximations \(T_{h_ k}\). In other words, the regularization is applied as postconditioner to the numerical inversion. A superlinearly convergent, approximate Newton process is obtained by adapting the numerical inversion to the magnitude of the current residual in an intermediate norm defined by the defect. In the analysis all norms are of Hölder space type. The design of the algorithm involves multi-parameter selection and hence opens up questions about the complexity of the schemes. For this, results of \textit{A. G. Vitushkin} [Theory of the transmission and processing of information (1961; Zbl 0122.120)] are used.
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Newton iteration for partial differential equations and the approximation of the identity
- The Continuous Newton's Method, Inverse Functions, and Nash-Moser
- scientific article; zbMATH DE number 4056897
- Inexact Newton regularization combined with gradient methods in Banach spaces
- On the behaviour of approximate Newton methods
- On a general iterative scheme for newton-type methods
- Newton's method for gradient equations based upon the fixed point map: Convergence and complexity study
- Sufficient conditions for the convergence of Newton-like methods under weak smoothness assumptions
- scientific article; zbMATH DE number 3912141
- Approximate Newton methods and homotopy for stationary operator equations
- Approximation of nonlinear evolution systems
- Global approximate Newton methods
- scientific article; zbMATH DE number 3829781 (Why is no real title available?)
- scientific article; zbMATH DE number 3538224 (Why is no real title available?)
- scientific article; zbMATH DE number 3232484 (Why is no real title available?)
- Metric entropy and approximation
- On Finite Element Matrices
- On the Quasi-Optimality in $L_\infty$ of the $\overset{\circ}{H}^1$-Projection into Finite Element Spaces*
- Optimal L ∞ Error Estimates for Galerkin Approximations to Solutions of Two-Point Boundary Value Problems
- The boundary problems of physical geodesy
- Newton's method for gradient equations based upon the fixed point map: Convergence and complexity study
- Numerical approximation of PDE system fixed-point maps via Newton's method
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Algorithms defined by Nash iteration: Some implementations via multilevel collocation and smoothing
- Newton iteration with multiquadrics for the solution of nonlinear PDEs
- A Nash-Hörmander iteration and boundary elements for the Molodensky problem
- On a general iterative scheme for newton-type methods
- Newton iteration for partial differential equations and the approximation of the identity
This page was built for publication: An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067360)
