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...
Saved in:
Published in | AIMS mathematics Vol. 6; no. 7; pp. 6699 - 6714 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
AIMS Press
01.01.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 |