Widening basins of attraction of optimal iterative methods

[EN] In this work, we analyze the dynamical behavior on quadratic polynomials of a class of derivative-free optimal parametric iterative methods, designed by Khattri and Steihaug. By using their parameter as an accelerator, we develop different methods with memory of orders three, six and twelve, without adding new functional evaluations. Then a dynamical approach is made, comparing each of the proposed methods with the original ones without memory, with the following empiric conclusion: Basins of attraction of iterative schemes with memory are wider and the behavior is more stable. This has been numerically checked by estimating the solution of a practical problem, as the friction factor of a pipe and also of other nonlinear academic problems.This research was supported by Islamic Azad University, Hamedan Branch, Ministerio de Economia y Competitividad MTM2014-52016-C02-2-P and Generalitat Valenciana PROMETEO/2016/089.Bakhtiari, P.; Cordero Barbero, A.; Lotfi, T.; Mahdiani, K.; Torregrosa Sánchez, JR. (2017). Widening basins of attraction of optimal iterative methods. Nonlinear Dynamics. 87(2):913-938. https://doi.org/10.1007/s11071-016-3089-2S913938872Amat, S., Busquier, S., Bermúdez, C., Plaza, S.: On two families of high order Newton type methods. Appl. Math. Lett. 25, 2209–2217 (2012)Amat, S., Busquier, S., Bermúdez, C., Magreñán, Á.A.: On the election of the damped parameter of a two-step relaxed Newton-type method. Nonlinear Dyn. 84(1), 9–18 (2016)Chun, C., Neta, B.: An analysis of a family of Maheshwari-based optimal eighth order methods. Appl. Math. Comput. 253, 294–307 (2015)Babajee, D.K.R., Cordero, A., Soleymani, F., Torregrosa, J.R.: On improved three-step schemes with high efficiency index and their dynamics. Numer. Algorithms 65(1), 153–169 (2014)Argyros, I.K., Magreñán, Á.A.: On the convergence of an optimal fourth-order family of methods and its dynamics. Appl. Math. Comput. 252, 336–346 (2015)Petković, M., Neta, B., Petković, L., Džunić, J.: Multipoint Methods for Solving Nonlinear Equations. Academic Press, London (2013)Ostrowski, A.M.: Solution of Equations and System of Equations. Prentice-Hall, Englewood Cliffs, NJ (1964)Kung, H.T., Traub, J.F.: Optimal order of one-point and multipoint iteration. J. ACM 21, 643–651 (1974)Khattri, S.K., Steihaug, T.: Algorithm for forming derivative-free optimal methods. Numer. Algorithms 65(4), 809–824 (2014)Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, New York (1964)Cordero, A., Soleymani, F., Torregrosa, J.R., Shateyi, S.: Basins of Attraction for Various Steffensen-Type Methods. J. Appl. Math. 2014, 1–17 (2014)Devaney, R.L.: The Mandelbrot Set, the Farey Tree and the Fibonacci sequence. Am. Math. Mon. 106(4), 289–302 (1999)McMullen, C.: Families of rational maps and iterative root-finding algorithms. Ann. Math. 125(3), 467–493 (1987)Chicharro, F., Cordero, A., Gutiérrez, J.M., Torregrosa, J.R.: Complex dynamics of derivative-free methods for nonlinear equations. Appl. Math. Comput. 219, 70237035 (2013)Magreñán, Á.A.: Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 233, 29–38 (2014)Neta, B., Chun, C., Scott, M.: Basins of attraction for optimal eighth order methods to find simple roots of nonlinear equations. Appl. Math. Comput. 227, 567–592 (2014)Lotfi, T., Magreñán, Á.A., Mahdiani, K., Rainer, J.J.: A variant of Steffensen–King’s type family with accelerated sixth-order convergence and high efficiency index: dynamic study and approach. Appl. Math. Comput. 252, 347–353 (2015)Chicharro, F.I., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. 2013, 1–11 (2013)Cordero, A., Lotfi, T., Torregrosa, J.R., Assari, P., Mahdiani, K.: Some new bi-accelerator two-point methods for solving nonlinear equations. Comput. Appl. Math. 35(1), 251–267 (2016)Cordero, A., Lotfi, T., Bakhtiari, P., Torregrosa, J.R.: An efficient two-parametric family with memory for nonlinear equations. Numer. Algorithms 68(2), 323–335 (2015)Lotfi, T., Mahdiani, K., Bakhtiari, P., Soleymani, F.: Constructing two-step iterative methods with and without memory. Comput. Math. Math. Phys. 55(2), 183–193 (2015)Cordero, A., Maimó, J.G., Torregrosa, J.R., Vassileva, M.P.: Solving nonlinear problems by Ostrowski–Chun type parametric families. J. Math. Chem. 53, 430–449 (2015)Abad, M., Cordero, A., Torregrosa, J.R.: A family of seventh-order schemes for solving nonlinear systems. Bull. Math. Soc. Sci. Math. Roum. Tome 57(105), 133–145 (2014)Weerakoon, S., Fernando, T.G.I.: A variant of Newton’s method with accelerated third-order convergence. Appl. Math. Lett. 13, 87–93 (2000)White, F.: Fluid Mechanics. McGraw-Hill, Boston (2003)Zheng, Q., Li, J., Huang, F.: An optimal Steffensen-type family for solving nonlinear equations. Appl. Math. Comput. 217, 9592–9597 (2011)Soleymani, F., Babajee, D.K.R., Shateyi, S., Motsa, S.S.: Construction of optimal derivative-free techniques without memory. J. Appl. Math. (2012). doi: 10.1155/2012/49702

Memory in a new variant of King's family for solving nonlinear systems

[EN] In the recent literature, very few high-order Jacobian-free methods with memory for solving nonlinear systems appear. In this paper, we introduce a new variant of King's family with order four to solve nonlinear systems along with its convergence analysis. The proposed family requires two divided difference operators and to compute only one inverse of a matrix per iteration. Furthermore, we have extended the proposed scheme up to the sixth-order of convergence with two additional functional evaluations. In addition, these schemes are further extended to methods with memory. We illustrate their applicability by performing numerical experiments on a wide variety of practical problems, even big-sized. It is observed that these methods produce approximations of greater accuracy and are more efficient in practice, compared with the existing methods.This research was supported by PGC2018-095896-B-C22 (MCIU/AEI/FEDER, UE).Kansal, M.; Cordero Barbero, A.; Bhalla, S.; Torregrosa Sánchez, JR. (2020). Memory in a new variant of King's family for solving nonlinear systems. Mathematics. 8(8):1-15. https://doi.org/10.3390/math8081251S11588Cordero, 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., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2011). Efficient high-order methods based on golden ratio for nonlinear systems. Applied Mathematics and Computation, 217(9), 4548-4556. doi:10.1016/j.amc.2010.11.006Babajee, D. K. R., Cordero, A., Soleymani, F., & Torregrosa, J. R. (2012). On a Novel Fourth-Order Algorithm for Solving Systems of Nonlinear Equations. Journal of Applied Mathematics, 2012, 1-12. doi:10.1155/2012/165452Zheng, Q., Zhao, P., & Huang, F. (2011). A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs. Applied Mathematics and Computation, 217(21), 8196-8203. doi:10.1016/j.amc.2011.01.095Sharma, J., & Arora, H. (2013). An efficient derivative free iterative method for solving systems of nonlinear equations. Applicable Analysis and Discrete Mathematics, 7(2), 390-403. doi:10.2298/aadm130725016sSharma, J. R., Arora, H., & Petković, M. S. (2014). An efficient derivative free family of fourth order methods for solving systems of nonlinear equations. Applied Mathematics and Computation, 235, 383-393. doi:10.1016/j.amc.2014.02.103Wang, X., Zhang, T., Qian, W., & Teng, M. (2015). Seventh-order derivative-free iterative method for solving nonlinear systems. Numerical Algorithms, 70(3), 545-558. doi:10.1007/s11075-015-9960-2Chicharro, F. I., Cordero, A., Garrido, N., & Torregrosa, J. R. (2020). On the improvement of the order of convergence of iterative methods for solving nonlinear systems by means of memory. Applied Mathematics Letters, 104, 106277. doi:10.1016/j.aml.2020.106277Petković, M. S., & Sharma, J. R. (2015). On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations. Numerical Algorithms, 71(2), 457-474. doi:10.1007/s11075-015-0003-9Narang, M., Bhatia, S., Alshomrani, A. S., & Kanwar, V. (2019). General efficient class of Steffensen type methods with memory for solving systems of nonlinear equations. Journal of Computational and Applied Mathematics, 352, 23-39. doi:10.1016/j.cam.2018.10.048King, R. F. (1973). A Family of Fourth Order Methods for Nonlinear Equations. SIAM Journal on Numerical Analysis, 10(5), 876-879. doi:10.1137/0710072Hermite, M. C., & Borchardt, M. (1878). Sur la formule d’interpolation de Lagrange. Journal für die reine und angewandte Mathematik (Crelles Journal), 1878(84), 70-79. doi:10.1515/crelle-1878-18788405Petkovic, M., Dzunic, J., & Petkovic, L. (2011). A family of two-point methods with memory for solving nonlinear equations. Applicable Analysis and Discrete Mathematics, 5(2), 298-317. doi:10.2298/aadm110905021pCordero, 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.062Awawdeh, F. (2009). On new iterative method for solving systems of nonlinear equations. Numerical Algorithms, 54(3), 395-409. doi:10.1007/s11075-009-9342-8Noor, M. A., Waseem, M., & Noor, K. I. (2015). New iterative technique for solving a system of nonlinear equations. Applied Mathematics and Computation, 271, 446-466. doi:10.1016/j.amc.2015.08.125Pramanik, S. (2002). Kinematic Synthesis of a Six-Member Mechanism for Automotive Steering. Journal of Mechanical Design, 124(4), 642-645. doi:10.1115/1.150337

A family of derivative-free methods with high order of convergence and its application to nonsmooth equations

A family of derivative-free methods of seventh-order convergence for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.6266. Also, numerical examples are used to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other derivative-free methods, including some optimal fourth-order ones, in the sense of Kung-Traubs conjecture. Copyright 2012 Alicia Cordero et al.The authors would like to thank the referees for their valuable comments and for their suggestions to improve the readability of the paper. This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia PAID-06-2010-2285.Cordero Barbero, A.; Hueso Pagoaga, JL.; Martínez Molada, E.; Torregrosa Sánchez, JR. (2012). A family of derivative-free methods with high order of convergence and its application to nonsmooth equations. Abstract and Applied Analysis. 2012:1-15. doi:10.1155/2012/836901S1152012Kung, H. T., & Traub, J. F. (1974). Optimal Order of One-Point and Multipoint Iteration. Journal of the ACM, 21(4), 643-651. doi:10.1145/321850.321860Liu, Z., Zheng, Q., & Zhao, P. (2010). A variant of Steffensen’s method of fourth-order convergence and its applications. Applied Mathematics and Computation, 216(7), 1978-1983. doi:10.1016/j.amc.2010.03.028Dehghan, M., & Hajarian, M. (2010). Some derivative free quadratic and cubic convergence iterative formulas for solving nonlinear equations. Computational & Applied Mathematics, 29(1). doi:10.1590/s1807-03022010000100002Cordero, A., & Torregrosa, J. R. (2011). A class of Steffensen type methods with optimal order of convergence. Applied Mathematics and Computation, 217(19), 7653-7659. doi:10.1016/j.amc.2011.02.067Amat, S., & Busquier, S. (2006). On a Steffensen’s type method and its behavior for semismooth equations. Applied Mathematics and Computation, 177(2), 819-823. doi:10.1016/j.amc.2005.11.032Cordero, 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.062Amat, S., & Busquier, S. (2003). On a higher order Secant method. Applied Mathematics and Computation, 141(2-3), 321-329. doi:10.1016/s0096-3003(02)00257-

On a Derivative-Free Variant of King’s Family with Memory

The aim of this paper is to construct a method with memory according to King’s family of methods without memory for nonlinear equations. It is proved that the proposed method possesses higher R-order of convergence using the same number of functional evaluations as King’s family. Numerical experiments are given to illustrate the performance of the constructed scheme

An efficient two-parametric family with memory for nonlinear equations

A new two-parametric family of derivative-free iterative methods for solving nonlinear equations is presented. First, a new biparametric family without memory of optimal order four is proposed. The improvement of the convergence rate of this family is obtained by using two self-accelerating parameters. These varying parameters are calculated in each iterative step employing only information from the current and the previous iteration. The corresponding R-order is 7 and the efficiency index 7(1/3) = 1.913. Numerical examples and comparison with some existing derivative-free optimal eighth-order schemes are included to confirm the theoretical results. In addition, the dynamical behavior of the designed method is analyzed and shows the stability of the scheme.The second author wishes to thank the Islamic Azad University, Hamedan Branch, where the paper was written as a part of the research plan, for financial support.Cordero Barbero, A.; Lotfi, T.; Bakhtiari, P.; Torregrosa Sánchez, JR. (2015). An efficient two-parametric family with memory for nonlinear equations. Numerical Algorithms. 68(2):323-335. doi:10.1007/s11075-014-9846-8S323335682Kung, H.T., Traub, J.F.: Optimal order of one-point and multi-point iteration. J. Assoc. Comput. Math. 21, 643–651 (1974)Cordero, A., Hueso, J.L., Martínez, E., Torregrosa, J.R.: A new technique to obtain derivative-free optimal iterative methods for solving nonlinear equation. J. Comput. Appl. Math. 252, 95–102 (2013)Cordero, A., Torregrosa, J.R., Vassileva, M.P.: Pseudocomposition: a technique to design predictor-corrector methods for systems of nonlinear equations. Appl. Math. Comput. 218, 11496–11508 (2012)Džunić, J.: On efficient two-parameter methods for solving nonlinear equations. Numer. Algorithms. 63(3), 549–569 (2013)Džunić, J., Petković, M.S.: On generalized multipoint root-solvers with memory. J. Comput. Appl. Math. 236, 2909–2920 (2012)Petković, M.S., Neta, B., Petković, L.D., Džunić, J. (ed.).: Multipoint methods for solving nonlinear equations. Elsevier (2013)Sharma, J.R., Sharma, R.: A new family of modified Ostrowski’s methods with accelerated eighth order convergence. Numer. Algorithms 54, 445–458 (2010)Soleymani, F., Shateyi, S.: Two optimal eighth-order derivative-free classes of iterative methods. Abstr. Appl. Anal. 2012(318165), 14 (2012). doi: 10.1155/2012/318165Soleymani, F., Sharma, R., Li, X., Tohidi, E.: An optimized derivative-free form of the Potra-Pták methods. Math. Comput. Model. 56, 97–104 (2012)Thukral, R.: Eighth-order iterative methods without derivatives for solving nonlinear equations. ISRN Appl. Math. 2011(693787), 12 (2011). doi: 10.5402/2011/693787Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, New York (1964)Wang, X., Džunić, J., Zhang, T.: On an efficient family of derivative free three-point methods for solving nonlinear equations. Appl. Math. Comput. 219, 1749–1760 (2012)Zheng, Q., Li, J., Huang, F.: An optimal Steffensen-type family for solving nonlinear equations. Appl. Math. Comput. 217, 9592–9597 (2011)Ortega, J.M., Rheinboldt, W.G. (ed.).: Iterative Solutions of Nonlinear Equations in Several Variables, Ed. Academic Press, New York (1970)Jay, I.O.: A note on Q-order of convergence. BIT Numer. Math. 41, 422–429 (2001)Blanchard, P.: Complex Analytic Dynamics on the Riemann Sphere. Bull. AMS 11(1), 85–141 (1984)Chicharro, F., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameters planes of iterative families and methods. arXiv: 1307.6705 [math.NA

A new three-step class of iterative methods for solving nonlinear systems

[EN] In this work, a new class of iterative methods for solving nonlinear equations is presented and also its extension for nonlinear systems of equations. This family is developed by using a scalar and matrix weight function procedure, respectively, getting sixth-order of convergence in both cases. Several numerical examples are given to illustrate the efficiency and performance of the proposed methods.This research has been partially supported by both Generalitat Valenciana and Ministerio de Ciencia, Investigacion y Universidades, under grants PROMETEO/2016/089 and PGC2018-095896-B-C22 (MCIU/AEI/FEDER, UE), respectively.Capdevila-Brown, RR.; Cordero Barbero, A.; Torregrosa Sánchez, JR. (2019). A new three-step class of iterative methods for solving nonlinear systems. Mathematics. 7(12):1-14. https://doi.org/10.3390/math712122111471

Two weighted-order classes of iterative root-finding methods

In this paper we design, by using the weight function technique, two families of iterative schemes with order of convergence eight. These weight functions depend on one, two and three variables and they are used in the second and third step of the iterative expression. Dynamics on polynomial and non-polynomial functions is analysed and they are applied on the problem of preliminary orbit determination by using a modified Gauss method. Finally, some standard test functions are to check the reliability of the proposed schemes and allow us to compare them with other known methods.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and FONDOCYT 2011-1-B1-33 Republica Dominicana.Artidiello Moreno, SDJ.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vassileva, M. (2015). Two weighted-order classes of iterative root-finding methods. International Journal of Computer Mathematics. 92(9):1790-1805. https://doi.org/10.1080/00207160.2014.887201S1790180592