IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v160y2019icp1-12.html
   My bibliography  Save this article

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

Author

Listed:
  • Bisheh-Niasar, Morteza
  • Gdawiec, Krzysztof

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.

Suggested Citation

  • Bisheh-Niasar, Morteza & Gdawiec, Krzysztof, 2019. "Bisheh-Niasar–Saadatmandi root finding method via the S-iteration with periodic parameters and its polynomiography," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 160(C), pages 1-12.
    • Handle: RePEc:eee:matcom:v:160:y:2019:i:c:p:1-12
    DOI: 10.1016/j.matcom.2018.11.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475418303070
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2018.11.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Krzysztof Gdawiec & Wiesław Kotarski & Agnieszka Lisowska, 2015. "Polynomiography Based on the Nonstandard Newton-Like Root Finding Methods," Abstract and Applied Analysis, Hindawi, vol. 2015, pages 1-19, February.
    2. Gdawiec, Krzysztof & Kotarski, Wiesław, 2017. "Polynomiography for the polynomial infinity norm via Kalantari’s formula and nonstandard iterations," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 17-30.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lateef Olakunle Jolaoso & Safeer Hussain Khan & Kazeem Olalekan Aremu, 2022. "Dynamics of RK Iteration and Basic Family of Iterations for Polynomiography," Mathematics, MDPI, vol. 10(18), pages 1-16, September.
    2. Lateef Olakunle Jolaoso & Safeer Hussain Khan, 2020. "Some Escape Time Results for General Complex Polynomials and Biomorphs Generation by a New Iteration Process," Mathematics, MDPI, vol. 8(12), pages 1-18, December.
    3. Muhammad Tanveer & Waqas Nazeer & Krzysztof Gdawiec, 2020. "New Escape Criteria for Complex Fractals Generation in Jungck-CR Orbit," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(4), pages 1285-1303, December.
    4. Panadda Thongpaen & Rattanakorn Wattanataweekul, 2021. "A Fast Fixed-Point Algorithm for Convex Minimization Problems and Its Application in Image Restoration Problems," Mathematics, MDPI, vol. 9(20), pages 1-13, October.
    5. Deepak Kumar & Sunil Kumar & Janak Raj Sharma & Lorentz Jantschi, 2021. "Convergence Analysis and Dynamical Nature of an Efficient Iterative Method in Banach Spaces," Mathematics, MDPI, vol. 9(19), pages 1-16, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:160:y:2019:i:c:p:1-12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.