\(n^{\mathrm{th}}\) composite iterative scheme via weak contractions with application (Q6169340)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: n^th composite iterative scheme via weak contractions with application |
scientific article; zbMATH DE number 7726456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(n^{\mathrm{th}}\) composite iterative scheme via weak contractions with application |
scientific article; zbMATH DE number 7726456 |
Statements
\(n^{\mathrm{th}}\) composite iterative scheme via weak contractions with application (English)
0 references
14 August 2023
0 references
Summary: The main goal of this study is to formulate an effective iterative scheme, namely, an \(n^{\mathrm{th}}\)-composite iterative scheme for approximating the fixed point of a self-map \(T:\mathcal{U}\rightarrow\mathcal{U}\) with weak contraction property. We show that the \(n^{\mathrm{th}}\)-composite iterative scheme is faster than the scheme obtained by Sintunavarat-Pitea's iterative scheme [\textit{W. Sintunavarat} and \textit{A. Pitea}, J. Nonlinear Sci. Appl. 9, No. 5, 2553--2562 (2016; Zbl 1347.47046)]. 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.
0 references
composite iterative scheme
0 references
fixed point
0 references
integral equation
0 references
Sintunavarat-Pitea iterative scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8045285940170288
0 references
0.7736145853996277
0 references
0.7619349360466003
0 references