Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/12371
Title: | On the complexity of choosing majorizing sequences for iterative procedures |
Authors: | Argyros, I.K. George, S. |
Issue Date: | 2019 |
Citation: | Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales - Serie A: Matematicas, 2019, Vol.113, 2, pp.1463-1473 |
Abstract: | The aim of this paper is to introduce general majorizing sequences for iterative procedures which may contain a non-differentiable operator in order to solve nonlinear equations involving Banach valued operators. A general semi-local convergence analysis is presented based on majorizing sequences. The convergence criteria, if specialized can be used to study the convergence of numerous procedures such as Picard s, Newton s, Newton-type, Stirling s, Secant, Secant-type, Steffensen s, Aitken s, Kurchatov s and other procedures. The convergence criteria are flexible enough, so if specialized are weaker than the criteria given by the aforementioned procedures. Moreover, the convergence analysis is at least as tight. Furthermore, these advantages are obtained using Lipschitz constants that are least as tight as the ones already used in the literature. Consequently, no additional hypotheses are needed, since the new constants are special cases of the old constants. These ideas can be used to study, the local convergence, multi-step multi-point procedures along the same lines. Some applications are also provided in this study. 2018, Springer-Verlag Italia S.r.l., part of Springer Nature. |
URI: | http://idr.nitk.ac.in/jspui/handle/123456789/12371 |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
31.On the complexity of choosing.pdf | 709.73 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.