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

Basit Öğe Kaydı
dc.contributor.authorAlagoz, Osman
dc.contributor.authorGunduz, Birol
dc.contributor.authorAkbulut, Sezgin
dc.date.accessioned2025-05-20T18:54:07Z
dc.date.issued2018
dc.departmentBilecik Şeyh Edebali Üniversitesi
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.endpage305
dc.identifier.issn0352-9665
dc.identifier.issn2406-047X
dc.identifier.issue2
dc.identifier.scopusqualityN/A
dc.identifier.startpage295
dc.identifier.urihttps://doi.org/10.22190/FUMI1802295A
dc.identifier.urihttps://hdl.handle.net/11552/7228
dc.identifier.volume33
dc.identifier.wosWOS:000444042300012
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWoS
dc.indekslendigikaynakWoS - Emerging Sources Citation Index
dc.language.isoen
dc.publisherUniv Nis
dc.relation.ispartofFacta Universitatis-Series Mathematics and Informatics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WOS_20250518
dc.subjectIteration process
dc.subjectfixed point
dc.subjectweak contractive mapping
dc.subjectnormed linear space
dc.titleNUMERICAL RECKONING FIXED POINTS FOR BERINDE MAPPINGS VIA A FASTER ITERATION PROCESS
dc.typeArticle

Dosyalar

Orijinal paket

Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
3763-26215-1-PB.pdf
Boyut:
161.1 KB
Biçim:
Adobe Portable Document Format
İndir

Koleksiyon

WoS İndeksli Yayınlar