On the behaviour of approximate Newton methods

DOI10.1007/BF02252511MaRDI QIDQ1067364zbMATH OpenOpenAlexFDO

Authors Igor Moret

Publication date 1986

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02252511

zbMATH Keywords

a posteriori error estimatesapproximate Newton methodBanach spacesNewton's methodspeed of convergence

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Review text

When Newton's method is used for solving nonlinear equations in Banach spaces, at each step of the iterative procedure the solution of a linear equation is requested. When these equations are solved approximately we have a so-called approximate Newton method. The paper is devoted to the study of the convergence properties of such iterations, under Kantorovich type assumptions. Some criteria are given in order to control their convergence and speed of convergence. Moreover, some a posteriori error estimates are proposed. The general results are applied, as example, to Newton-iterative methods.

Recommendations

• Approximate quasi-Newton methods
• On a general iterative scheme for newton-type methods
• Newton's method in generalized banach spaces
• On the ``Terra incognita for the Newton-Kantrovich method with applications
• A note on Newton type iterative methods

Cites work

• A note on Newton type iterative methods
• Global approximate Newton methods
• scientific article; zbMATH DE number 3366440 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Inexact Newton Methods
• Local Convergence of Inexact Newton Methods
• On Newton-Iterative Methods for the Solution of Systems of Nonlinear Equations

Cited in

(22)

• An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
• Approximate Newton methods and homotopy for stationary operator equations
• Newton's method for gradient equations based upon the fixed point map: Convergence and complexity study
• Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
• A new convergence theorem for the inexact Newton methods based on assumptions involving the second Fréchet derivative
• On the choice of initial guesses for the Newton-Raphson algorithm
• Two-sided approximation for some Newton's type methods
• A point-of-attraction result for Newton's method with point-based approximations
• scientific article; zbMATH DE number 3887006 (Why is no real title available?)
• On the nonpathological behavior of Newton’s method
• A kantorovich-type theorem for inexact newton methods
• scientific article; zbMATH DE number 647373 (Why is no real title available?)
• scientific article; zbMATH DE number 1048011 (Why is no real title available?)
• scientific article; zbMATH DE number 1066207 (Why is no real title available?)
• A natural language user interface for fuzzy scope queries
• scientific article; zbMATH DE number 2070307 (Why is no real title available?)
• scientific article; zbMATH DE number 1538167 (Why is no real title available?)
• On application the iterative Newton-Kantorovich process in approximately-iterative method
• scientific article; zbMATH DE number 223519 (Why is no real title available?)
• Newton iteration for partial differential equations and the approximation of the identity
• A note on Newton type iterative methods
• Approximate quasi-Newton methods

This page was built for publication: On the behaviour of approximate Newton methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1067364)