An iteration process for a general class of contractive-like operators: Convergence, stability and polynomiography

In this paper, we propose a three step iteration process and analyze the performance of the process for a contractive-like operators. It is observed that this iterative procedure is faster than several iterative methods in the existing literature. To support the claim, a numerical example is present...

Full description

Saved in:
Bibliographic Details
Published inAIMS mathematics Vol. 6; no. 7; pp. 6699 - 6714
Main Authors Yu, Ti-Ming, Shahid, Abdul Aziz, Shabbir, Khurram, Shah, Nehad Ali, Li, Yong-Min
Format Journal Article
LanguageEnglish
Published AIMS Press 01.01.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this paper, we propose a three step iteration process and analyze the performance of the process for a contractive-like operators. It is observed that this iterative procedure is faster than several iterative methods in the existing literature. To support the claim, a numerical example is presented using Maple 13. Some images are generated by using this iteration method for complex cubic polynomials. We believe that our presented work enrich the polynomiography software.
ISSN:2473-6988
2473-6988
DOI:10.3934/math.2021393