Polynomiography via Ishikawa and Mann Iterations

  • Wiesław Kotarski
  • Krzysztof Gdawiec
  • Agnieszka Lisowska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7431)

Abstract

The aim of this paper is to present some modifications of the complex polynomial roots finding visualization process. In this paper Ishikawa and Mann iterations are used instead of the standard Picard iteration. The name polynomiography was introduced by Kalantari for that visualization process and the obtained images are called polynomiographs. Polynomiographs are interesting both from educational and artistic points of view. By the use of different iterations we obtain quite new polynomiographs that look aestheatically pleasing comparing to the ones from standard Picard iteration. As examples we present some polynomiographs for complex polynomial equation z3 − 1 = 0, permutation and doubly stochastic matrices. We believe that the results of this paper can inspire those who may be interested in created automatically aesthetic patterns. They also can be used to increase functionality of the existing polynomiography software.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berinde, V.: Iterative Approximation of Fixed Points, 2nd edn. Springer, Heidelberg (2007)MATHGoogle Scholar
  2. 2.
    Ishikawa, S.: Fixed Points by a New Iteration Method. Proceedings of the American Mathematical Society 44(1), 147–150 (1974)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Kalantari, B.: Polynomiography: From the Fundamental Theorem of Algebra to Art. Leonardo 38(3), 233–238 (2005)CrossRefGoogle Scholar
  4. 4.
    Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009)Google Scholar
  5. 5.
    Kalantari, B.: Alternating Sign Matrices and Polynomiography. The Electronic Journal of Combinatorics 18(2), 1–22 (2011)MathSciNetGoogle Scholar
  6. 6.
    Mandelbrot, B.: The Fractal Geometry of Nature. W.H. Freeman and Company, New York (1983)Google Scholar
  7. 7.
    Mann, W.R.: Mean value methods in iteration. Proceedings of the American Mathematical Society 4, 506–510 (1953)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Minc, H.: Nonnegative Matrices. John Wiley & Sons, New York (1988)MATHGoogle Scholar
  9. 9.
    Prasad, B., Katiyar, K.: Fractals via Ishikawa Iteration. In: Balasubramaniam, P. (ed.) ICLICC 2011. CCIS, vol. 140, pp. 197–203. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Singh, S.L., Jain, S., Mishra, S.N.: A New Approach to Superfractals. Chaos, Solitons and Fractals 42(5), 3110–3120 (2009)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Susanto, H., Karjanto, N.: Newton’s Method’s Basins of Attraction Revisited. Applied Mathematics and Computation 215(3), 1084–1090 (2009)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wiesław Kotarski
    • 1
  • Krzysztof Gdawiec
    • 1
  • Agnieszka Lisowska
    • 1
  1. 1.Institute of Computer ScienceUniversity of SilesiaPoland

Personalised recommendations