Local Convergence for an Improved Jarratt-type Method in Banach Space

We present a local convergence analysis for an improved Jarratt-type methods of order at least five to approximate a solution of a nonlinear equation in a Banach space setting. The convergence ball and error estimates are given using hypotheses up to the first Fréchet derivative in contrast to earlier studies using hypotheses up to the third Fréchet derivative. Numerical examples are also provided in this study, where the older hypotheses are not satisfied to solve equations but the new hypotheses are satisfied

Local Convergence of Jarratt-Type Methods with Less Computation of Inversion Under Weak Conditions

We present a local convergence analysis for Jarratt-type methods in order to approximate a solution of a nonlinear equation in a Banach space setting. Earlier studies cannot be used to solve equations using such methods. The convergence ball and error estimates are given for these methods. Numerical examples are also provided in this study

On developing an optimal Jarratt-like class for solving nonlinear equations

It is attempted to derive an optimal class of methods without memory from Ozban’s method [A. Y. Ozban, Some New Variants of Newton’s Method, Appl. Math. Lett. 17 (2004) 677-682]. To this end, we try to introduce a weight function in the second step of the method and to find some suitable conditions, so that the modified method is optimal in the sense of Kung and Traub’s conjecture. Also, convergence analysis along with numerical implementations are included to verify both theoretical and practical aspects of the proposed optimal class of methods without memory. © 2020 Forum-Editrice Universitaria Udinese SRL. All rights reserved

Stable high-order iterative methods for solving nonlinear models

[EN] There are several problems of pure and applied science which can be studied in the unified framework of the scalar and vectorial nonlinear equations. In this paper, we propose a sixth-order family of Jarratt type methods for solving nonlinear equations. Further, we extend this family to the multidimensional case preserving the order of convergence. Their theoretical and computational properties are fully investigated along with two main theorems describing the order of convergence. We use complex dynamics techniques in order to select, among the elements of this class of iterative methods, those more stable. This process is made by analyzing the conjugacy class, calculating the fixed and critical points and getting conclusions from parameter and dynamical planes. For the implementation of the proposed schemes for system of nonlinear equations, we consider some applied science problems namely, Van der Pol problem, kinematic syntheses, etc. Further, we compare them with existing sixth-order methods to check the validity of the theoretical results. From the numerical experiments, we find that our proposed schemes perform better than the existing ones. Further, we also consider a variety of nonlinear equations to check the performance of the proposed methods for scalar equations.This research was partially supported by Ministerio de Economia y Competitividad MTM2014-52016-C2-2-P and by Generalitat Valenciana PROMETEO/2016/089.Behl, R.; Cordero Barbero, A.; Motsa, SS.; Torregrosa Sánchez, JR. (2017). Stable high-order iterative methods for solving nonlinear models. Applied Mathematics and Computation. 303:70-88. https://doi.org/10.1016/j.amc.2017.01.029S708830

Finding the solution of nonlinear equations by a class of optimal methods

AbstractThis paper is devoted to the study of an iterative class for numerically approximating the solution of nonlinear equations. In fact, a general class of iterations using two evaluations of the first order derivative and one evaluation of the function per computing step is presented. It is also proven that the class reaches the fourth-order convergence. Therefore, the novel methods from the class are Jarratt-type iterations, which agree with the optimality hypothesis of Kung–Traub. The derived class is further extended for multiple roots. That is to say, a general optimal quartic class of iterations for multiple roots is contributed, when the multiplicity of the roots is available. Numerical experiments are employed to support the theory developed in this work

Study of iterative methods though the Cayley quadratic test

[EN] Many iterative methods for solving nonlinear equations have been developed recently. The main advantage claimed by their authors is the improvement of the order of convergence. In this work, we compare their dynamical behavior on quadratic polynomials with the one of Newton's scheme. This comparison is defined in what we call Cayley Quadratic Test (CQT) which can be used as a first test to check the efficiency of such methods. Moreover we make a brief insight in cubic polynomials. (C) 2014 Elsevier B.V. All rights reserved.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02.Babajee, D.; Cordero Barbero, A.; Torregrosa Sánchez, JR. (2016). Study of iterative methods though the Cayley quadratic test. Journal of Computational and Applied Mathematics. 291:358-369. https://doi.org/10.1016/j.cam.2014.09.020S35836929

Semilocal convergence of a k-step iterative process and its application for solving a special kind of conservative problems

[EN] In this paper, we analyze the semilocal convergence of k-steps Newton's method with frozen first derivative in Banach spaces. The method reaches order of convergence k + 1. By imposing only the assumption that the Fr,chet derivative satisfies the Lipschitz continuity, we define appropriate recurrence relations for obtaining the domains of convergence and uniqueness. We also define the accessibility regions for this iterative process in order to guarantee the semilocal convergence and perform a complete study of their efficiency. Our final aim is to apply these theoretical results to solve a special kind of conservative systems.Hernández-Verón, MA.; Martínez Molada, E.; Teruel-Ferragud, C. (2017). Semilocal convergence of a k-step iterative process and its application for solving a special kind of conservative problems. Numerical Algorithms. 76(2):309-331. https://doi.org/10.1007/s11075-016-0255-zS309331762Amat, S., Busquier, S., Bermúdez, C., Plaza, S.: On two families of high order Newton type methods. Appl. Math. Comput. 25, 2209–2217 (2012)Argyros, I.K., Hilout, S., Tabatabai, M.A.: Mathematical Modelling with Applications in Biosciences and Engineering. Nova Publishers, New York (2011)Argyros, I.K., George, S.: A unified local convergence for Jarratt-type methods in Banach space under weak conditions. Thai. J. Math. 13, 165–176 (2015)Argyros, I.K., Hilout, S.: On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. J. Comput. Appl. Math. 245, 1–9 (2013)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, 3195–2206 (2011)Cordero, A., Hueso, J.L., Martínez, E., Torregrosa, J.R.: Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation. Math. Comput. Mod. 57, 1950–1956 (2013)Ezquerro, J.A., Grau-Sánchez, M., Hernández, M. A., Noguera, M.: Semilocal convergence of secant-like methods for differentiable and nondifferentiable operators equations. J. Math. Anal. Appl. 398(1), 100–112 (2013)Honorato, G., Plaza, S., Romero, N.: Dynamics of a higher-order family of iterative methods. J. Complexity 27(2), 221–229 (2011)Jerome, J.W., Varga, R.S.: Generalizations of Spline Functions and Applications to Nonlinear Boundary Value and Eigenvalue Problems, Theory and Applications of Spline Functions. Academic Press, New York (1969)Kantorovich, L.V., Akilov, G.P.: Functional analysis Pergamon Press. Oxford (1982)Keller, H.B.: Numerical Methods for Two-Point Boundary-Value Problems. Dover Publications, New York (1992)Na, T.Y.: Computational Methods in Engineering Boundary Value Problems. Academic Press, New York (1979)Ortega, J.M.: The Newton-Kantorovich theorem. Amer. Math. Monthly 75, 658–660 (1968)Ostrowski, A.M.: Solutions of Equations in Euclidean and Banach Spaces. Academic Press, New York (1973)Plaza, S., Romero, N.: Attracting cycles for the relaxed Newton’s method. J. Comput. Appl. Math. 235(10), 3238–3244 (2011)Porter, D., Stirling, D.: Integral Equations: A Practical Treatment, From Spectral Theory to Applications. Cambridge University Press, Cambridge (1990)Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice-Hall. Englewood Cliffs, New Jersey (1964)Argyros, I.K., George, S.: Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds using restricted convergence domains. Journal of Nonlinear Functional Analysis 2016 (2016). Article ID 27Xiao, J.Z., Sun, J., Huang, X.: Approximating common fixed points of asymptotically quasi-nonexpansive mappings by a k+1-step iterative scheme with error terms. J. Comput. Appl. Math 233, 2062–2070 (2010)Qin, X., Dehaish, B.A.B., Cho, S.Y.: Viscosity splitting methods for variational inclusion and fixed point problems in Hilbert spaces. J. Nonlinear Sci. Appl. 9, 2789–2797 (2016

Computing simple roots by a sixth-order iterative method,

Abstract: This paper studies a novel without memory sixth-order method for computing simple roots of nonlinear scalar equations. Using the well-known technique of un-determined coefficients, we derive an iterative scheme which includes two evaluations of the function and two evaluations of the first derivative per full cycle. Numerical comparisons are made to reveal the efficiency of the developed method

Design, Analysis, and Applications of Iterative Methods for Solving Nonlinear Systems

In this chapter, we present an overview of some multipoint iterative methods for solving nonlinear systems obtained by using different techniques such as composition of known methods, weight function procedure, and pseudo-composition, etc. The dynamical study of these iterative schemes provides us valuable information about their stability and reliability. A numerical test on a specific problem coming from chemistry is performed to compare the described methods with classical ones and to confirm the theoretical results

On a novel fourth-order algorithm for solving systems of nonlinear equations

This paper focuses on solving systems of nonlinear equations numerically. We propose an efficient iterative scheme including two steps and fourth order of convergence. The proposed method does not require the evaluation of second or higher order Frechet derivatives per iteration to proceed and reach fourth order of convergence. Finally, numerical results illustrate the efficiency of the method.The authors would like to thank the referees for the valuable comments and for the suggestions to improve the readability of the paper. This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02.Babajee, DKR.; Cordero Barbero, A.; Soleymani, F.; Torregrosa Sánchez, JR. (2012). On a novel fourth-order algorithm for solving systems of nonlinear equations. Journal of Applied Mathematics. 2012. https://doi.org/10.1155/2012/1654522012Babajee, D. K. R., Dauhoo, M. Z., Darvishi, M. T., Karami, A., & Barati, A. (2010). Analysis of two Chebyshev-like third order methods free from second derivatives for solving systems of nonlinear equations. Journal of Computational and Applied Mathematics, 233(8), 2002-2012. doi:10.1016/j.cam.2009.09.035Darvishi, M. T., & Barati, A. (2007). A fourth-order method from quadrature formulae to solve systems of nonlinear equations. Applied Mathematics and Computation, 188(1), 257-261. doi:10.1016/j.amc.2006.09.115Soleymani, F., Khattri, S. K., & Karimi Vanani, S. (2012). Two new classes of optimal Jarratt-type fourth-order methods. Applied Mathematics Letters, 25(5), 847-853. doi:10.1016/j.aml.2011.10.030Cordero, A., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2010). Accelerated methods of order 2p for systems of nonlinear equations. Journal of Computational and Applied Mathematics, 233(10), 2696-2702. doi:10.1016/j.cam.2009.11.018Dayton, B. H., Li, T.-Y., & Zeng, Z. (2011). Multiple zeros of nonlinear systems. Mathematics of Computation, 80(276), 2143-2143. doi:10.1090/s0025-5718-2011-02462-2Haijun, W. (2008). New third-order method for solving systems of nonlinear equations. Numerical Algorithms, 50(3), 271-282. doi:10.1007/s11075-008-9227-2Noor, M. A., Waseem, M., Noor, K. I., & Al-Said, E. (2012). Variational iteration technique for solving a system of nonlinear equations. Optimization Letters, 7(5), 991-1007. doi:10.1007/s11590-012-0479-3Frontini, M., & Sormani, E. (2004). Third-order methods from quadrature formulae for solving systems of nonlinear equations. Applied Mathematics and Computation, 149(3), 771-782. doi:10.1016/s0096-3003(03)00178-4Cordero, A., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2009). A modified Newton-Jarratt’s composition. Numerical Algorithms, 55(1), 87-99. doi:10.1007/s11075-009-9359-zCordero, 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