A unified approach for the convergence of certain numerical algorithms, using recurrent functions
boundary value problemerror boundsGreen functionintegral equation methodmajorizing sequenceNewton-Kantorovich hypothesisNewton-like methodsnonlinear equations in Banach spacesnonlinear PDEnumerical examplesroots of polynomialssemilocal convergence
Integral representations of solutions to PDEs (35C15) Nonlinear boundary value problems for linear elliptic equations (35J65) Iterative procedures involving nonlinear operators (47J25) Numerical computation of roots of polynomial equations (65H04) Numerical solutions to equations with nonlinear operators (65J15) Boundary element methods for boundary value problems involving PDEs (65N38)
The Kantorovich-analysis deals with an approximating solution of an abstract equation of the type \(F(x)+ G(x)= 0\), where \(F\) is a Fréchet-differentiable operator on an open subset of a Banach space \(X\) and \(G\) is a continuous operator. The first Newton-like iterative scheme for calculating an approximating sequence \(\{x_n\}\subseteq X\) was presented by \textit{L. V. Kantorovich} and \textit{G. P. Akilov} in their famous Russian monograph [Functional analysis in normed spaces. Moskva: Staatlicher Verlag für Physikalisch-mathematische Literatur. 684 pp. (1959; Zbl 0127.06102)]. The authors refer to an edition of 1982. There are a lot of papers on this topic. In the last time Argyros and Hilout published some generalized results. The sequence is constructed as \[ x_{n+1}= x_n- A_n^{-1}[F(x_n)- G(x_n)], \] where \(A_n\) can be considered as an approximation of \(F'(x_N)\). Some authors used a recurrent relation's approach under Lipschitz-Hölder-type conditions to provide a semilocal convergence. In the present paper the same approach is used to provide a finer convergence analysis. The advantages are a larger convergence domain, finer error bounds on the distance \(\| x_n- x^*\|\) and a precise information on the location of the solution \(x^*\). The method is applicable to locate the roots of polynomials of high order, too. The fundamental idea is the well-known construction of majorizing real sequences in order to formulate sufficient conditions under which the convergence theorem is valid. Numerical examples are considered, in which the convergence is realized by the theorem of this paper, whereas other results are not applicable. A boundary value problem is considered and reformulated as an integral equation by means of a corresponding Green function. In this example the sufficient conditions of the main theorem are fulfilled.
- A Kantorovich-type analysis of Broyden's method using recurrent functions
- An improved convergence analysis for the Newton-Kantorovich method using recurrence relations
- Concerning the convergence of Newton's method and quadratic majorants
- Convergence domains under Zabrejko-Zinčenko conditions using recurrent functions
- New improved convergence analysis for Newton-like methods with applications
- A convergence theorem for Newton-like methods in Banach spaces
- A note on Newton type iterative methods
- A Unified Convergence Theory for a Class of Iterative Processes
- Affine Invariant Convergence Theorems for Newton’s Method and Extensions to Related Methods
- Concerning the ``terra incognita between convergence regions of two Newton methods
- Convergence and Applications of Newton-type Iterations
- Convergence domains of certain iterative methods for solving nonlinear equations
- Convergence of Newton-like methods for singular operator equations using outer inverses
- scientific article; zbMATH DE number 3929792 (Why is no real title available?)
- scientific article; zbMATH DE number 2104353 (Why is no real title available?)
- Majorizing Sequences and Error Bounds for Iterative Methods
- On a class of Newton-like methods for solving nonlinear equations
- On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)
- On the Newton-Kantorovich hypothesis for solving equations
- The majorant method in the theory of newton-kantorovich approximations and the pták error estimates
- Unified error analysis for Newton-type methods
This page was built for publication: A unified approach for the convergence of certain numerical algorithms, using recurrent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q605045)
