On the complexity of choosing majorizing sequences for iterative procedures

dc.contributor.authorArgyros, I.K.
dc.contributor.authorGeorge, S.
dc.date.accessioned2026-02-05T09:30:13Z
dc.date.issued2019
dc.description.abstractThe 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.
dc.identifier.citationRevista de la Real Academia de Ciencias Exactas, Fisicas y Naturales - Serie A: Matematicas, 2019, 113, 2, pp. 1463-1473
dc.identifier.issn15787303
dc.identifier.urihttps://doi.org/10.1007/s13398-018-0561-5
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/24613
dc.publisherSpringer-Verlag Italia s.r.l.
dc.subjectNonlinear equations
dc.subjectConvergence analysis
dc.subjectConvergence criterion
dc.subjectIterative procedure
dc.subjectLipschitz constant
dc.subjectLocal Convergence
dc.subjectMajorizing sequences
dc.subjectMultisteps
dc.subjectNon-differentiable
dc.subjectSemilocal convergence
dc.subjectStirling
dc.subjectBanach spaces
dc.titleOn the complexity of choosing majorizing sequences for iterative procedures

Files

Collections