Bisheh-Niasar–Saadatmandi root finding method via the S-iteration with periodic parameters and its polynomiography

Morteza Bisheh-Niasar and Krzysztof Gdawiec

Mathematics and Computers in Simulation (MATCOM), 2019, vol. 160, issue C, 1-12

Abstract: In recent years many researchers have focused their attention on the use of different iteration process – known from fixed point theory – in the generation of different kinds of patterns. In this paper, we propose modifications of the Bisheh-Niasar and Saadatmandi root finding method. In the first modification we modify the formula of the method and in the second modification we use the S-iteration with periodic parameters. Moreover, we numerically investigate some properties of the proposed methods and modification using three measures, i.e., the generation time, mean number of iterations and convergence area index. The obtained polynomiographs show that the proposed methods have a potential artistic applications, and the numerical results show that there is no obvious dependency of the considered measures on the sequences of the parameters used in the S-iteration.

Keywords: S-iteration; Polynomiography; Root finding (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475418303070
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:160:y:2019:i:c:p:1-12

DOI: 10.1016/j.matcom.2018.11.012

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().