Polynomiography via the Hybrids of Gradient Descent and Newton Methods with Mann and Ishikawa Iterations

  • Wiesław Kotarski
  • Agnieszka Lisowska
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 746)


In this paper two hybrids of two algorithms, the Newton method and the Gradient Descent method, are presented in order to create polynomiographs. The first idea combines two methods as a convex combination, the second one as the two-step process. A polynomiograph is an image obtained as the result of roots finding method of a polynomial on a complex plain. In this paper the polynomiographs are also modified by using Mann and Ishikawa iterations instead of the standard Picard iteration. Coloring images by iterations reveals dynamic behavior of the used root-finding process and its speed of convergence. The paper joins, combines and modifies earlier results obtained by Kalantari, Zhang et al. and the authors. We believe that the results of the paper can inspire those who are interested in aesthetic patterns created automatically. They can also be used to increase functionality of the existing polynomiography software.


Polynomiography Newton method Gradient Descent method 


  1. 1.
    Bahgat Mohamed, S.M., Hafiz, M.A.: Three-step iterative method with eighteenth order convergence for solving nonlinear equations. Int. J. Pure Appl. Math. 93(1), 85–94 (2014)zbMATHGoogle Scholar
  2. 2.
    Berinde, V.: Iterative Approximation of Fixed Points, 2nd edn. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  3. 3.
    Brandwood, D.H.: A complex gradient operator and its application in adaptive array theory. Proc. IEE Commun. Radar Sig. Process. 130(1), 11–16 (1983)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cheer, J., Daley, S.: A method of adaptation between steepest–descent and Newton’s algorithm for multi–channel active control of tonal noise and vibration. In: Proceedings of the 21st International Congress on Sound and Vibration (ICSV21), Beijing, China, 13–17 July 2014Google Scholar
  5. 5.
    Gdawiec K., Kotarski, W., Lisowska, A.: Polynomiography based on the nonstandard Newton-like root finding methods. Abstr. Appl. Anal. Article ID 797594 (2015)Google Scholar
  6. 6.
    Gdawiec, K.: Fractal patterns from the dynamics of combined polynomial root finding methods. Nonlinear Dyn. 90, 1–23 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Johnson, D.: Optimization Theory, Optimization Theory Page from the Connexions Project.
  8. 8.
    Kalantari, B.: Polynomiography: from the fundamental theorem of algebra to art. Leonardo 38(3), 233–238 (2005)CrossRefGoogle Scholar
  9. 9.
    Kalantari, B.: Polynomial Root-Finding and Polynomiography. World Scientific, Singapore (2009)zbMATHGoogle Scholar
  10. 10.
    Li, H., Adali, T.: Optimization in the complex domain for nonlinear adaptive filtering. In: Proceeding of the 40th Asilomar Conference on Signals, Systems, and Computers, pp. 263-267 (2006)Google Scholar
  11. 11.
    Wu, H., Li, F., Li, Z., Zhang, Y.: Zhang fractals yielded via solving nonlinear equations by discrete-time complex-valued ZD. In: Proceedings of the IEEE International Conference on Automation and Logistics Zhengzhou, China (2012)Google Scholar
  12. 12.
    Zhang, Y., Li, Z., Li, W., Chen, P.: From Newton fractals to Zhang fractals yielded via solving nonlinear equations in complex domain. Control Intell. Syst. 41(4), 131–137 (2013)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of SilesiaKatowicePoland

Personalised recommendations