Semilocal convergence of a family of iterative methods in Banach spaces

[EN] In this work, we prove a third and fourth convergence order result for a family of iterative methods for solving nonlinear systems in Banach spaces. We analyze the semilocal convergence by using recurrence relations, giving the existence and uniqueness theorem that establishes the R-order of the method and the priori error bounds. Finally, we apply the methods to two examples in order to illustrate the presented theory.This work has been supported by Ministerio de Ciencia e Innovaci´on MTM2011-28636-C02-02 and by Vicerrectorado de Investigaci´on. Universitat Polit`ecnica de Val`encia PAID-SP-2012-0498Hueso Pagoaga, JL.; Martínez Molada, E. (2014). Semilocal convergence of a family of iterative methods in Banach spaces. Numerical Algorithms. 67(2):365-384. https://doi.org/10.1007/s11075-013-9795-7S365384672Traub, J.F.: Iterative Methods for the Solution of Nonlinear Equations. Prentice Hall, New York (1964)Kantorovich, L.V.: On the newton method for functional equations. Doklady Akademii Nauk SSSR 59, 1237–1240 (1948)Candela, V., Marquina, A.: Recurrence relations for rational cubic methods, I: The Halley method. Computing 44, 169–184 (1990)Candela, V., Marquina, A.: Recurrence relations for rational cubic methods, II: The Chebyshev method. Computing 45, 355–367 (1990)Hernández, M.A.: Reduced recurrence relations for the Chebyshev method. J. Optim. Theory Appl. 98, 385–397 (1998)Gutiérrez, J.M., Hernández, M.A.: Recurrence relations for super-Halley method. J. Comput. Math. Appl. 7, 1–8 (1998)Ezquerro, J.A., Hernández, M.A.: Recurrence relations for Chebyshev-like methods. Appl. Math. Optim. 41, 227–236 (2000)Ezquerro, J.A., Hernández, M.A.: New iterations of R-order four with reduced computational cost. BIT Numer. Math. 49, 325–342 (2009)Argyros, I., K., Ezquerro, J.A., Gutiérrez, J.M., Hernández, M.A., Hilout, S.: On the semilocal convergence of efficient Chebyshev Secant-type methods. J. Comput. Appl. Math. 235–10, 3195–3206 (2011)Argyros, I.K., Hilout, S.: Weaker conditions for the convergence of Newtons method. J. Complex. 28(3), 364–387 (2012)Wang, X., Gu, C., Kou, J.: Semilocal convergence of a multipoint fourth-order super-Halley method in Banach spaces. Numer. Algoritm. 54, 497–516 (2011)Kou, J., Li, Y., Wang, X.: A variant of super Halley method with accelerated fourth-order convergence. Appl. Math. Comput. 186, 535–539 (2007)Zheng, L., Gu, C.: Recurrence relations for semilocal convergence of a fifth-order method in Banach spaces. Numer. Algoritm. 59, 623–638 (2012)Amat, S., Hernández, M.A., Romero, N.: A modified Chebyshevs iterative method with at least sixth order of convergence. Appl. Math. Comput. 206, 164–174 (2008)Wang, X., Kou, J., Gu, C.: Semilocal convergence of a sixth-order Jarratt method in Banach spaces. Numer. Algoritm. 57, 441–456 (2011)Hernández, M.A.: The newton method for operators with hlder continuous first derivative. J. Optim. Appl. 109, 631–648 (2001)Ye, X., Li, C.: Convergence of the family of the deformed Euler-Halley iterations under the Hlder condition of the second derivative. J. Comput. Appl. Math. 194, 294–308 (2006)Zhao, Y., Wu, Q.: Newton-Kantorovich theorem for a family of modified Halleys method under Hlder continuity conditions in Banach spaces. Appl. Math. Comput. 202, 243–251 (2008)Argyros, I.K.: Improved generalized differentiability conditions for Newton-like methods. J. Complex. 26, 316–333 (2010)Hueso, J.L., Martínez. E., Torregrosa, J.R.: Third and fourth order iterative methods free from second derivative for nonlinear systems. Appl. Math. Comput. 211, 190–197 (2009)Taylor, A.Y., Lay, D.: Introduction to Functional Analysis, 2nd edn.New York, Wiley (1980)Jarrat, P.: Some fourth order multipoint iterative methods for solving equations. Math. Comput. 20, 434–437 (1966)Cordero, A., Torregrosa, J.R.: Variants of Newtons method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686–698 (2007

A Higher Order Chebyshev-Halley-Type Family of Iterative Methods for Multiple Roots

[EN] The aim of this paper is to introduce new high order iterative methods for multiple roots of the nonlinear scalar equation; this is a demanding task in the area of computational mathematics and numerical analysis. Specifically, we present a new Chebyshev¿Halley-type iteration function having at least sixth-order convergence and eighth-order convergence for a particular value in the case of multiple roots. With regard to computational cost, each member of our scheme needs four functional evaluations each step. Therefore, the maximum efficiency index of our scheme is 1.6818 for ¿ = 2,which corresponds to an optimal method in the sense of Kung and Traub¿s conjecture. We obtain the theoretical convergence order by using Taylor developments. Finally, we consider some real-life situations for establishing some numerical experiments to corroborate the theoretical results.This research was partially supported by Ministerio de Economia y Competitividad under Grant MTM2014-52016-C2-1-2-P and by the project of Generalitat Valenciana Prometeo/2016/089Behl, R.; Martínez Molada, E.; Cevallos-Alarcon, FA.; Alarcon-Correa, D. (2019). A Higher Order Chebyshev-Halley-Type Family of Iterative Methods for Multiple Roots. Mathematics. 7(4):1-12. https://doi.org/10.3390/math7040339S11274Gutiérrez, J. M., & Hernández, M. A. (1997). A family of Chebyshev-Halley type methods in Banach spaces. Bulletin of the Australian Mathematical Society, 55(1), 113-130. doi:10.1017/s0004972700030586Kanwar, V., Singh, S., & Bakshi, S. (2008). Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations. Numerical Algorithms, 47(1), 95-107. doi:10.1007/s11075-007-9149-4Argyros, I. K., Ezquerro, J. A., Gutiérrez, J. M., Hernández, M. A., & Hilout, S. (2011). On the semilocal convergence of efficient Chebyshev–Secant-type methods. Journal of Computational and Applied Mathematics, 235(10), 3195-3206. doi:10.1016/j.cam.2011.01.005Xiaojian, Z. (2008). Modified Chebyshev–Halley methods free from second derivative. Applied Mathematics and Computation, 203(2), 824-827. doi:10.1016/j.amc.2008.05.092Amat, S., Hernández, M. A., & Romero, N. (2008). A modified Chebyshev’s iterative method with at least sixth order of convergence. Applied Mathematics and Computation, 206(1), 164-174. doi:10.1016/j.amc.2008.08.050Kou, J., & Li, Y. (2007). Modified Chebyshev–Halley methods with sixth-order convergence. Applied Mathematics and Computation, 188(1), 681-685. doi:10.1016/j.amc.2006.10.018Li, D., Liu, P., & Kou, J. (2014). An improvement of Chebyshev–Halley methods free from second derivative. Applied Mathematics and Computation, 235, 221-225. doi:10.1016/j.amc.2014.02.083Sharma, J. R. (2015). Improved Chebyshev–Halley methods with sixth and eighth order convergence. Applied Mathematics and Computation, 256, 119-124. doi:10.1016/j.amc.2015.01.002Neta, B. (2010). Extension of Murakami’s high-order non-linear solver to multiple roots. International Journal of Computer Mathematics, 87(5), 1023-1031. doi:10.1080/00207160802272263Zhou, X., Chen, X., & Song, Y. (2011). Constructing higher-order methods for obtaining the multiple roots of nonlinear equations. Journal of Computational and Applied Mathematics, 235(14), 4199-4206. doi:10.1016/j.cam.2011.03.014Hueso, J. L., Martínez, E., & Teruel, C. (2014). Determination of multiple roots of nonlinear equations and applications. Journal of Mathematical Chemistry, 53(3), 880-892. doi:10.1007/s10910-014-0460-8Behl, R., Cordero, A., Motsa, S. S., & Torregrosa, J. R. (2015). On developing fourth-order optimal families of methods for multiple roots and their dynamics. Applied Mathematics and Computation, 265, 520-532. doi:10.1016/j.amc.2015.05.004Behl, R., Cordero, A., Motsa, S. S., Torregrosa, J. R., & Kanwar, V. (2015). An optimal fourth-order family of methods for multiple roots and its dynamics. Numerical Algorithms, 71(4), 775-796. doi:10.1007/s11075-015-0023-5Geum, Y. H., Kim, Y. I., & Neta, B. (2015). A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics. Applied Mathematics and Computation, 270, 387-400. doi:10.1016/j.amc.2015.08.039Geum, Y. H., Kim, Y. I., & Neta, B. (2016). A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points. Applied Mathematics and Computation, 283, 120-140. doi:10.1016/j.amc.2016.02.029Behl, R., Alshomrani, A. S., & Motsa, S. S. (2018). An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence. Journal of Mathematical Chemistry, 56(7), 2069-2084. doi:10.1007/s10910-018-0857-xMcNamee, J. M. (1998). A comparison of methods for accelerating convergence of Newton’s method for multiple polynomial roots. ACM SIGNUM Newsletter, 33(2), 17-22. doi:10.1145/290590.290592Cordero, A., & Torregrosa, J. R. (2007). Variants of Newton’s Method using fifth-order quadrature formulas. Applied Mathematics and Computation, 190(1), 686-698. doi:10.1016/j.amc.2007.01.06

Orbits of period two in the family of a multipoint variant of Chebyshev-Halley family

[EN] The study of the dynamical behaviour of the operators defined by iterative methods help us to know more deeply the regions where these methods have a good performance. In this paper, we follow the dynamical study of a multipoint variant of the known Chebyshev-Halley's family, showing the existence of attractive periodic orbits of period 2 for some values of the parameter.This research was partially supported by Ministerio de Econom´ı a y Competitividad MTM2014-52016-C02-2-PCampos, B.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vindel Cañas, P. (2016). Orbits of period two in the family of a multipoint variant of Chebyshev-Halley family. Numerical Algorithms. 73(1):141-156. https://doi.org/10.1007/s11075-015-0089-0141156731Blanchard, P.: Complex analytic dynamics on the Riemann sphere. Bull. AMS 11(1), 85–141 (1984)Beardon, A.F.: Iteration of Rational Functions, Graduate Texts in Mathematics. Springer-Verlag, New York (1991)Behl, R., Kanwar, V.: Variants of Chebyshev’s method with optimal order of convergence. Tamsui Oxf. J. Inf. Math. Sci. 29(1), 39–53 (2013)Campos, B., Cordero, A., Magreñan, A., Torregrosa, J.R., Vindel, P.: Study of a bi-parametric family of iterative methods. Abstr. Appl. Anal. 2014. Art. ID 141643, 12 ppCampos, B., Cordero, A., Torregrosa, J.R., Vindel, P.: Bifurcations in the dynamics of a variant of Chebyshev method. In: Proceedings of the 15th International Conference on Computational and Mathematical Methods in Science and Engineering CMMSE 2015, ISBN 978-84-617-2230-3, pp. 291–299 (2015)Chicharro, F., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameter planes of iterative families and methods. The Scientific World Journal Volume 2013 Article ID 780153Varona, J.L.: Graphic and numerical comparison between iterative methods. Math. Intelligencer 24, 37–46 (2002)Amat, S., Busquier, S., Plaza, S.: Review of some iterative root-finding methods from a dynamical point of view. Sci. Ser. A: Math. Sci. 10, 3–35 (2004)Cordero, A., García-Maimó, J., Torregrosa, J.R., Vassileva, M.P., Vindel, P.: Chaos in King’s iterative family. Appl. Math. Lett. 26, 842–848 (2013)Cordero, A., Torregrosa, J.P., Vindel, P.: Dynamics of a family of Chebyshev-Halley type method. Appl. Math. Comput. 219, 8568–8583 (2013)Gutiérrez, J.M., Hernández, M.A., Romero, N.: Dynamics of a new family of iterative processes for quadratic polynomials. J. Comput. Appl. Math. 233, 2688–2695 (2010)Neta, B., Chun, C., Scott, M.: Basins of attraction for optimal eighth order methods to find simple roots of nonlinear equation. App. Math. Comput. 227, 567–592 (2014)Scott, M., Neta, B., Chun, C.: Basin attractors for various methods. Appl. Math. Comput. 218, 2584–2599 (2011)Blanchard, P.: The dynamics of Newton’s method. Proc. Symp. Appl. Math. 49, 139–154 (1994)Cordero, A., Torregrosa, J.R.: Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686–698 (2007

SOME MODIFICATIONS OF CHEBYSHEV-HALLEY’S METHODS FREE FROM SECOND DERIVATIVE WITH EIGHTH-ORDER OF CONVERGENCE

The variant of Chebyshev-Halley’s method is an iterative method used for solving a nonlinear equation with third order of convergence. In this paper, we present some new variants of three steps Chebyshev-Halley’s method free from second derivative with two parameters. The proposed methods have eighth-order of convergence for  and  and require four evaluations of functions per iteration with index efficiency equal to . Numerical simulation will be presented by using several functions to show the performance of the proposed methods

A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence

This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.In this paper we give methodological survey of “contemporary methods” for solving the nonlinear equation f(x) = 0. The reason for this review is that many authors in present days rediscovered such classical methods. Here we develop one methodological schema for constructing nonstationary methods with a preliminary chosen speed of convergence

Numerically stable improved Chebyshev-Halley type schemes for matrix sign function

[EN] A general family of iterative methods including a free parameter is derived and proved to be convergent for computing matrix sign function under some restrictions on the parameter. Several special cases including global convergence behavior are dealt with. It is analytically shown that they are asymptotically stable. A variety of numerical experiments for matrices with different sizes is considered to show the effectiveness of the proposed members of the family. (C) 2016 Elsevier B.V. All rights reserved.This research was supported by Ministerio de Economia y Competitividad MTM2014-52016-C2-2-P and by Generalitat Valenciana PROME-TEO/2016/089.Cordero Barbero, A.; Soleymani, F.; Torregrosa Sánchez, JR.; Ullah, MZ. (2017). Numerically stable improved Chebyshev-Halley type schemes for matrix sign function. Journal of Computational and Applied Mathematics. 318:189-198. https://doi.org/10.1016/j.cam.2016.10.025S18919831

New variants of the Schroder method for finding zeros of nonlinear equations having unknown multiplicity

There are two aims of this paper, firstly, we define new variants of the Schroder method for finding zeros of nonlinear equations having unknown multiplicity and secondly, we introduce a new formula for approximating multiplicity m. Using the new formula, the five particular well-established methods are identical to the classical Schroder method. In terms of computational cost the new iterative method requires three evaluations of functions per iteration. It is proved that the each of the methods has a convergence of order two. Numerical examples are given to demonstrate the performance of the methods with and without multiplicity m