Nth Composite Iterative Scheme via Weak Contractions with Application

Int. J. Math. Math. Sci. Pub Date : 2023-07-19 DOI:10.1155/2023/7175260

T. Qawasmeh, A. Bataihah, Khalaf Bataihah, Ahmad Mohammad Qazza, R. Hatamleh

{"title":"Nth Composite Iterative Scheme via Weak Contractions with Application","authors":"T. Qawasmeh, A. Bataihah, Khalaf Bataihah, Ahmad Mohammad Qazza, R. Hatamleh","doi":"10.1155/2023/7175260","DOIUrl":null,"url":null,"abstract":"The main goal of this study is to formulate an effective iterative scheme, namely, an \n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\">\n <msup>\n <mrow>\n <mi>n</mi>\n </mrow>\n <mrow>\n <mi mathvariant=\"normal\">t</mi>\n <mi mathvariant=\"normal\">h</mi>\n </mrow>\n </msup>\n <mo>−</mo>\n </math>\n composite iterative scheme for approximating the fixed point of a self-map \n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\">\n <mi>T</mi>\n <mo>:</mo>\n <mi mathvariant=\"script\">U</mi>\n <mo>⟶</mo>\n <mi mathvariant=\"script\">U</mi>\n </math>\n with weak contraction property. We show that the \n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M3\">\n <msup>\n <mrow>\n <mi>n</mi>\n </mrow>\n <mrow>\n <mi mathvariant=\"normal\">t</mi>\n <mi mathvariant=\"normal\">h</mi>\n </mrow>\n </msup>\n <mo>−</mo>\n </math>\n composite iterative scheme is faster than the scheme obtained by Sintunavarat–Pitea’s iterative scheme. We present some examples using the MATLAB simulator to illustrate our results. Finally, we approximate the solution of some integral equations using our scheme and the Sintunavarat–Pitea scheme.","PeriodicalId":301406,"journal":{"name":"Int. J. Math. Math. Sci.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Math. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2023/7175260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

The main goal of this study is to formulate an effective iterative scheme, namely, an

n^{t h} -

composite iterative scheme for approximating the fixed point of a self-map

T : U ⟶ U

with weak contraction property. We show that the

n^{t h} -

composite iterative scheme is faster than the scheme obtained by Sintunavarat–Pitea’s iterative scheme. We present some examples using the MATLAB simulator to illustrate our results. Finally, we approximate the solution of some integral equations using our scheme and the Sintunavarat–Pitea scheme.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于弱收缩的第n次复合迭代格式及其应用

本研究的主要目标是制定一个有效的迭代方案，即:近似自映射t不动点的n ~ h复合迭代格式:U形为弱收缩性质的U形。我们证明了n - t - h -复合迭代格式比Sintunavarat-Pitea迭代格式得到的格式更快。我们给出了一些使用MATLAB模拟器的例子来说明我们的结果。最后，我们用我们的格式和Sintunavarat-Pitea格式近似了一些积分方程的解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Int. J. Math. Math. Sci.

自引率

0.00%

发文量