Newton-like methods and polynomiographic visualization of modified Thakur processes

References

• M Abbas, T Nazir, A new faster iteration process applied to constrained minimization and feasibility problems. Math.  Vesn. 6(6) (2014), pp. 223–234.
   Google Scholar
• R.P. Agarwal, D O'Regan, and D.R. Sahu, Iterative construction of fixed points of nearly asymptotically nonexpansive mappings, J. Nonlinear Convex Anal. 8 (2007), pp. 61–67.
   Web of Science ®Google Scholar
• V Berinde, Iterative Approximation of Fixed Points, Springer, Berlin, 2007.
   Google Scholar
• R Chugh, V Kumar, and S Kumar, Strong convergence of a new three step iterative scheme in Banach space, Am. J. Comput. Math. 2(4) (2012), pp. 345–357. doi: 10.4236/ajcm.2012.24048
   Google Scholar
• K Gdawiec and W Kotarski, Polynomiography for the polynomial infinity norm via Kalantari's formula and non-standard iterations, Appl. Math. Comput. 307 (2017), pp. 17-30.
   Web of Science ®Google Scholar
• K Gdawiec, W Kotarski, and A Lisowska, Polynomiography with non-standard iterations. In: Skala V, editor. WSCG 2014 Poster Papers Proceedings: Proceedings of the Twenty-Second International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision; 2014; Plzen, Vaclav Skala Union Agency, 2014, pp. 21–26.
   Google Scholar
• K Gdawiec, W Kotarski, and A Lisowska, Polynomiography based on the non-standard Newton-like root-finding methods, Abstr. Appl. Anal. ( 2015), pp. 797594.
   Google Scholar
• J.J. Green, Calulating the maximum modulus of a polynomial using Stečkin's lemma, SIAM J. Numer. Anal. 36 (1999), pp. 1022–1029. doi: 10.1137/S0036142997331335
   Web of Science ®Google Scholar
• F Gürsoy and V Karakaya, A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. http://arxiv.org/abs/1403.2546.
   Google Scholar
• A Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970.
   Google Scholar
• S Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc. 44 (1974), pp. 147–150. doi: 10.1090/S0002-9939-1974-0336469-5
   Web of Science ®Google Scholar
• B Kalantari, Polynomial Root-Finding and Polynomiography, World Scientific, Singapore, 2009.
   Google Scholar
• B Kalantari, A Necessary and Suffcient Condition for Local Maxima of Polynomial Modulus Over Unit Disc, arXiv:1605.00621; 2016.
   Google Scholar
• I Karahan and M Ozdemir, A general iterative method for approximation of fixed points and their applications, Adv. Fixed Point Theory 3(3) (2013), pp. 510–526.
   Google Scholar
• V Karakaya, K Dogan, F Gürsoy, and M Ertürk, Fixed point of a new three-step iteration algorithm under contractive-like operators over normed spaces, Abstr. Appl. Anal. 2013 (2013), pp. 560258.
   Google Scholar
• S.H. Khan, A Picard-Mann hybrid iterative process, Fixed Point Theory A 2013 (2013), pp. 69. doi: 10.1186/1687-1812-2013-69
   Google Scholar
• S.G. Krantz, Handbook of Complex Variables, Birkhauser, Boston, 1999.
   Google Scholar
• W.R. Mann, Mean value methods in iteration, Proc. Amer. Math. Soc. 4 (1953), pp. 506–510. doi: 10.1090/S0002-9939-1953-0054846-3
   Web of Science ®Google Scholar
• M.A. Noor, New approximation schemes for general variational inequalities, J. Math. Anal. Appl. 251(1) (2000), pp. 217–229. doi: 10.1006/jmaa.2000.7042
   Web of Science ®Google Scholar
• A.M. Ostrowski, The round-off stability of iterations, Z. Angew. Math. Mech. 47(2) (1967), pp. 77–81. doi: 10.1002/zamm.19670470202
   Web of Science ®Google Scholar
• W Phuengrattana and S Suantai, On the rate of convergence of Mann, Ishikawa, noor and SP-iterations for continuous functions on an arbitrary interval, J. Comput Appl. Math. 235 (2011), pp. 3006–3014. doi: 10.1016/j.cam.2010.12.022
   Web of Science ®Google Scholar
• T.R. Scavo and J Thoo, On the geometry of Halley's method, Amer. Math. Monthly 102 (1995), pp. 417–426. doi: 10.1080/00029890.1995.12004594
   Web of Science ®Google Scholar
• O Scherzer, Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems, J. Math. Anal. Appl. 194 (1995), pp. 911–933. doi: 10.1006/jmaa.1995.1335
   Web of Science ®Google Scholar
• W Sintunavarat and A Pitea, On a new iteration scheme for numerical reckoning fixed points of Berinde mappings with convergence analysis, J. Nonlinear Sci. Appl. 9 (2016), pp. 2553–2562. doi: 10.22436/jnsa.009.05.53
   Google Scholar
• S.M. Soltuz and T Grosan, Data dependence for Ishikawa iteration when dealing with contractive like operators, Fixed Point Theory Appl. 2008 (2008), pp. 242916. doi: 10.1155/2008/242916
   Google Scholar
• S Suantai, Weak and strong convergence criteria of noor iteration for asymptotically non-expansive mappings, J. Math. Anal. Appl. 11(2) (2005), pp. 506–517. doi: 10.1016/j.jmaa.2005.03.002
   Web of Science ®Google Scholar
• D Thakur, B Thakur, and M Postolache, New iteration scheme for numerical reckoning fixed points of nonexpansive mappings, J. Inequal. Appl. 2014 (2014), pp. 328. doi: 10.1186/1029-242X-2014-328
   Web of Science ®Google Scholar
• B Thakur, D Thakur, and M Postolache, A new iterative scheme for numerical reckoning fixed points of Suzuki's generalized nonexpansive mappings, Appl. Math. Comput. 275 (2016), pp. 147–155.
   Web of Science ®Google Scholar
• B.S. Thakur, D Thakur, and M Postolache, A new iterative scheme for approximating fixed points of nonexpansive mappings, Filomat. 30(10) (2016), pp. 2711–2720. doi: 10.2298/FIL1610711T
   Web of Science ®Google Scholar
• X Weng, Fixed point iteration for local strictly pseudocontractive mapping, Proc. Amer. Math. Soc.113 (1991), pp. 727–731. doi: 10.1090/S0002-9939-1991-1086345-8
   Web of Science ®Google Scholar
• T.J. Ypma, Historical development of Newton-Raphson method, SIAM Rev. Soc. Ind. Appl. Math.37 (1995), pp. 531–551.
   Web of Science ®Google Scholar