IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v307y2017icp17-30.html
   My bibliography  Save this article

Polynomiography for the polynomial infinity norm via Kalantari’s formula and nonstandard iterations

Author

Listed:
  • Gdawiec, Krzysztof
  • Kotarski, Wiesław

Abstract

In this paper, an iteration process, referred to in short as MMP, will be considered. This iteration is related to finding the maximum modulus of a complex polynomial over a unit disc on the complex plane creating intriguing images. Kalantari calls these images polynomiographs independently from whether they are generated by the root finding or maximum modulus finding process applied to any polynomial. We show that the images can be easily modified using different MMP methods (pseudo-Newton, MMP-Householder, methods from the MMP-Basic, MMP-Parametric Basic or MMP-Euler–Schröder Families of Iterations) with various kinds of non-standard iterations. Such images are interesting from three points of views: scientific, educational and artistic. We present the results of experiments showing automatically generated non-trivial images obtained for different modifications of root finding MMP-methods. The colouring by iteration reveals the dynamic behaviour of the used root finding process and its speed of convergence. The results of the present paper extend Kalantari’s recent results in finding the maximum modulus of a complex polynomial based on Newton’s process with the Picard iteration to other MMP-processes with various non-standard iterations.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:307:y:2017:i:c:p:17-30
    DOI: 10.1016/j.amc.2017.02.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317301492
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.02.038?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. Thakur, Balwant Singh & Thakur, Dipti & Postolache, Mihai, 2016. "A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings," Applied Mathematics and Computation, Elsevier, vol. 275(C), pages 147-155.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    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. 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.
    4. 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.
    5. 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.

    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. Maryam Gharamah Alshehri & Faizan Ahmad Khan & Faeem Ali, 2022. "An Iterative Algorithm to Approximate Fixed Points of Non-Linear Operators with an Application," Mathematics, MDPI, vol. 10(7), pages 1-16, April.
    2. Yonghong Yao & Mihai Postolache & Jen-Chih Yao, 2019. "Iterative Algorithms for Pseudomonotone Variational Inequalities and Fixed Point Problems of Pseudocontractive Operators," Mathematics, MDPI, vol. 7(12), pages 1-13, December.
    3. Hasanen A. Hammad & Habib ur Rehman & Manuel De la Sen, 2022. "A New Four-Step Iterative Procedure for Approximating Fixed Points with Application to 2D Volterra Integral Equations," Mathematics, MDPI, vol. 10(22), pages 1-26, November.
    4. Chanchal Garodia & Afrah A. N. Abdou & Izhar Uddin, 2021. "A New Modified Fixed-Point Iteration Process," Mathematics, MDPI, vol. 9(23), pages 1-10, December.
    5. Javid Ali & Faeem Ali & Puneet Kumar, 2019. "Approximation of Fixed Points for Suzuki’s Generalized Non-Expansive Mappings," Mathematics, MDPI, vol. 7(6), pages 1-11, June.
    6. Yuanheng Wang & Mingyue Yuan & Bingnan Jiang, 2021. "Multi-Step Inertial Hybrid and Shrinking Tseng’s Algorithm with Meir–Keeler Contractions for Variational Inclusion Problems," Mathematics, MDPI, vol. 9(13), pages 1-13, July.
    7. Yonghong Yao & Mihai Postolache & Jen-Chih Yao, 2019. "An Iterative Algorithm for Solving Generalized Variational Inequalities and Fixed Points Problems," Mathematics, MDPI, vol. 7(1), pages 1-15, January.
    8. Andreea Bejenaru & Mihai Postolache, 2022. "New Approach to Split Variational Inclusion Issues through a Three-Step Iterative Process," Mathematics, MDPI, vol. 10(19), pages 1-16, October.
    9. Austine Efut Ofem & Jacob Ashiwere Abuchu & Reny George & Godwin Chidi Ugwunnadi & Ojen Kumar Narain, 2022. "Some New Results on Convergence, Weak w 2 -Stability and Data Dependence of Two Multivalued Almost Contractive Mappings in Hyperbolic Spaces," Mathematics, MDPI, vol. 10(20), pages 1-26, October.
    10. Mujahid Abbas & Muhammad Waseem Asghar & Manuel De la Sen, 2022. "Approximation of the Solution of Delay Fractional Differential Equation Using AA -Iterative Scheme," Mathematics, MDPI, vol. 10(2), pages 1-20, January.
    11. Usurelu, Gabriela Ioana & Turcanu, Teodor, 2021. "Best proximity points of (EP)-operators with qualitative analysis and simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 187(C), pages 215-230.
    12. Konrawut Khammahawong & Parin Chaipunya & Kamonrat Sombut, 2022. "Approximating Common Fixed Points of Nonexpansive Mappings on Hadamard Manifolds with Applications," Mathematics, MDPI, vol. 10(21), pages 1-20, November.
    13. Ali Abkar & Mohsen Shekarbaigi, 2017. "A Novel Iterative Algorithm Applied to Totally Asymptotically Nonexpansive Mappings in CAT(0) Spaces," Mathematics, MDPI, vol. 5(1), pages 1-13, February.
    14. Wissam Kassab & Teodor Ţurcanu, 2019. "Numerical Reckoning Fixed Points of ( ρE )-Type Mappings in Modular Vector Spaces," Mathematics, MDPI, vol. 7(5), pages 1-13, April.

    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:apmaco:v:307:y:2017:i:c:p:17-30. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.