An Example of Data Dependence Result for The Class of Almost Contraction Mappings
Yunus Atalan, Vatan Karakaya
Abstract
Yunus Atalan, Vatan Karakaya
Abstract
In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. Finally, we obtain a data dependence result for almost contraction mappings by using $S^*$ iteration method and in order to show validity of this result we give an example.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. Finally, we obtain a data dependence result for almost contraction mappings by using $S^*$ iteration method and in order to show validity of this result we give an example.
Key concepts: Mathematics, Contraction (grammar), Fixed point, Fixed-point iteration, Power iteration, Rate of convergence, Applied mathematics, Iterative method