Erzincan Binali Yıldırım ÜniversitesiErzincan Binali Yıldırım ÜniversitesiAçık Erişim Arşivi · RDL Open

NUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESS

ArticleAçık Erişim

Özet

In this paper we prove that the M-iteration process converges strongly faster than S-iteration and Picard-S iteration processes. Moreover, the M- iteration process is faster than the S n iteration process with a sufficient condition for weak contractive mapping defined on a normed linear space. We also give two numerical reckoning examples to support our main theorem. For approximating fixed points, all codes were written in MAPLE (C) 2018 All rights reserved.

Anahtar Kelimeler

Iteration processfixed pointweak contractive mappingnormed linear spaceNONEXPANSIVE-MAPPINGSCONVERGENCESPACESMathematics
RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/ebyu/16971Resmi atıflarda kullanılan kalıcı adres
DOI
https://doi.org/10.22190/fumi1802295aYayıncı resmi DOI adresi
Tam Kayıt
AlanDeğerDil
dc.contributor.authorAlagoz, Osman
dc.contributor.authorGunduz, Birol
dc.contributor.authorAkbulut, Sezgin
dc.date.accessioned2026-10-18T20:41:10.877656353Z
dc.date.available2026-10-18T20:41:10.877656353Z
dc.date.issued2018
dc.description.abstractIn this paper we prove that the M-iteration process converges strongly faster than S-iteration and Picard-S iteration processes. Moreover, the M- iteration process is faster than the S n iteration process with a sufficient condition for weak contractive mapping defined on a normed linear space. We also give two numerical reckoning examples to support our main theorem. For approximating fixed points, all codes were written in MAPLE (C) 2018 All rights reserved.
dc.identifier.doi10.22190/fumi1802295a
dc.identifier.eissn2406-047X
dc.identifier.endpage305
dc.identifier.issn0352-9665
dc.identifier.issue2
dc.identifier.startpage295
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/ebyu/16971
dc.identifier.volume33
dc.identifier.wosWOS:000444042300012
dc.language.isoen
dc.publisherUNIV NIS
dc.relation.ispartofFACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICS
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectIteration process
dc.subjectfixed point
dc.subjectweak contractive mapping
dc.subjectnormed linear space
dc.subjectNONEXPANSIVE-MAPPINGS
dc.subjectCONVERGENCE
dc.subjectSPACES
dc.subjectMathematics
dc.titleNUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESS
dc.typeArticle
dspace.entity.typePublication
rdl.citation.wos5
rdl.oa.statusgold
rdl.source.indexWOS
rdl.wos.indexEmerging Sources Citation Index (ESCI)