Steffensen type methods for solving nonlinear equations

[EN] In the present paper, by approximating the derivatives in the well known fourth-order Ostrowski's method and in a sixth-order improved Ostrowski's method by central-difference quotients, we obtain new modifications of these methods free from derivatives. We prove the important fact that the methods obtained preserve their convergence orders 4 and 6, respectively, without calculating any derivatives. Finally, numerical tests confirm the theoretical results and allow us to compare these variants with the corresponding methods that make use of derivatives and with the classical Newton's method. (C) 2010 Elsevier B.V. All rights reserved.This research was supported by Ministerio de Ciencia y Tecnología MTM2010-18539Cordero Barbero, A.; Hueso Pagoaga, JL.; Martínez Molada, E.; Torregrosa Sánchez, JR. (2012). Steffensen type methods for solving nonlinear equations. Journal of Computational and Applied Mathematics. 236(12):3058-3064. https://doi.org/10.1016/j.cam.2010.08.043S305830642361

Optimized Steffensen-Type Methods with Eighth-Order Convergence and High Efficiency Index

Steffensen-type methods are practical in solving nonlinear equations. Since, such schemes do not need derivative evaluation per iteration. Hence, this work contributes two new multistep classes of Steffensen-type methods for finding the solution of the nonlinear equation ()=0. New techniques can be taken into account as the generalizations of the one-step method of Steffensen. Theoretical proofs of the main theorems are furnished to reveal the eighth-order convergence. Per computing step, the derived methods require only four function evaluations. Experimental results are also given to add more supports on the underlying theory of this paper as well as lead us to draw a conclusion on the efficiency of the developed classes

Solving nonlinear problems by Ostrowski Chun type parametric families

In this paper, by using a generalization of Ostrowski' and Chun's methods two bi-parametric families of predictor-corrector iterative schemes, with order of convergence four for solving system of nonlinear equations, are presented. The predictor of the first family is Newton's method, and the predictor of the second one is Steffensen's scheme. One of them is extended to the multidimensional case. Some numerical tests are performed to compare proposed methods with existing ones and to confirm the theoretical results. We check the obtained results by solving the molecular interaction problem.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and FONDOCYT, Republica Dominicana.Cordero Barbero, A.; Maimo, J.; Torregrosa Sánchez, JR.; Vassileva, M. (2015). Solving nonlinear problems by Ostrowski Chun type parametric families. Journal of Mathematical Chemistry. 53(1):430-449. https://doi.org/10.1007/s10910-014-0432-zS430449531M.S. Petkovic̀, B. Neta, L.D. Petkovic̀, J. Dz̆unic̀, Multipoint Methods for Solving Nonlinear Equations (Academic, New York, 2013)M. Mahalakshmi, G. Hariharan, K. Kannan, The wavelet methods to linear and nonlinear reaction–diffusion model arising in mathematical chemistry. J. Math. Chem. 51(9), 2361–2385 (2013)P.G. Logrado, J.D.M. Vianna, Partitioning technique procedure revisited: Formalism and first application to atomic problems. J. Math. Chem. 22, 107–116 (1997)C.G. Jesudason, I. Numerical nonlinear analysis: differential methods and optimization applied to chemical reaction rate determination. J. Math. Chem. 49, 1384–1415 (2011)K. Maleknejad, M. Alizadeh, An efficient numerical scheme for solving hammerstein integral equation arisen in chemical phenomenon. Procedia Comput. Sci. 3, 361–364 (2011)R.C. Rach, J.S. Duan, A.M. Wazwaz, Solving coupled Lane–Emden boundary value problems in catalytic diffusion reactions by the Adomian decomposition method. J. Math. Chem. 52, 255–267 (2014)J.F. Steffensen, Remarks on iteration. Skand. Aktuar Tidskr. 16, 64–72 (1933)J.M. Ortega, W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables (Academic, New York, 1970)H.T. Kung, J.F. Traub, Optimal order of one-point and multipoint iteration. J. ACM 21, 643–651 (1974)J.R. Sharma, R.K. Guha, R. Sharma, An efficient fourth order weighted-Newton method for systems of nonlinear equations. Numer. Algorithms 62, 307–323 (2013)J.R. Sharma, H. Arora, On efficient weighted-Newton methods for solving systems of nonlinear equations. Appl. Math. Comput. 222, 497–506 (2013)M. Abad, A. Cordero, J.R. Torregrosa, Fourth- and fifth-order methods for solving nonlinear systems of equations: an application to the Global positioning system. Abstr. Appl. Anal.(2013) Article ID:586708. doi: 10.1155/2013/586708F. Soleymani, T. Lotfi, P. Bakhtiari, A multi-step class of iterative methods for nonlinear systems. Optim. Lett. 8, 1001–1015 (2014)M.T. Darvishi, N. Darvishi, SOR-Steffensen-Newton method to solve systems of nonlinear equations. Appl. Math. 2(2), 21–27 (2012). doi: 10.5923/j.am.20120202.05F. Awawdeh, On new iterative method for solving systems of nonlinear equations. Numer. Algorithms 5(3), 395–409 (2010)D.K.R. Babajee, A. Cordero, F. Soleymani, J.R. Torregrosa, On a novel fourth-order algorithm for solving systems of nonlinear equations. J. Appl. Math. (2012) Article ID:165452. doi: 10.1155/2012/165452A. Cordero, J.R. Torregrosa, M.P. Vassileva, Pseudocomposition: a technique to design predictor–corrector methods for systems of nonlinear equations. Appl. Math. Comput. 218(23), 1496–1504 (2012)A. Cordero, J.R. Torregrosa, M.P. Vassileva, Increasing the order of convergence of iterative schemes for solving nonlinear systems. J. Comput. Appl. Math. 252, 86–94 (2013)A.M. Ostrowski, Solution of Equations and System of Equations (Academic, New York, 1966)C. Chun, Construction of Newton-like iterative methods for solving nonlinear equations. Numer. Math. 104, 297–315 (2006)R. King, A family of fourth order methods for nonlinear equations. SIAM J. Numer. Anal. 10, 876–879 (1973)A. Cordero, J.R. Torregrosa, Low-complexity root-finding iteration functions with no derivatives of any order of convergence. J. Comput. Appl. Math. (2014). doi: 10.1016/j.cam.2014.01.024A. Cordero, J.L. Hueso, E. Martínez, J.R. Torregrosa, A modified Newton Jarratts composition. Numer. Algorithms 55, 87–99 (2010)P. Jarratt, Some fourth order multipoint methods for solving equations. Math. Comput. 20, 434–437 (1966)A. Cordero, J.R. Torregrosa, Variants of Newtons method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686–698 (2007)Z. Liu, Q. Zheng, P. Zhao, A variant of Steffensens method of fourth-order convergence and its applications. Appl. Math. Comput. 216, 1978–1983 (2010)A. Cordero, J.R. Torregrosa, A class of Steffensen type methods with optimal order of convergence. Appl. Math. Comput. 217, 7653–7659 (2011)L.B. Rall, New York, Computational Solution of Nonlinear Operator Equations (Robert E. Krieger Publishing Company Inc, New York, 1969

A class of Steffensen type methods with optimal order of convergente

In this paper, a family of Steffensen type methods of fourth-order convergence for solving nonlinear smooth equations is suggested. In the proposed methods, a linear combination of divided differences is used to get a better approximation to the derivative of the given function. Each derivative-free member of the family requires only three evaluations of the given function per iteration. Therefore, this class of methods has efficiency index equal to 1.587. Kung and Traub conjectured that the order of convergence of any multipoint method without memory cannot exceed the bound 2d-1, where d is the number of functional evaluations per step. The new class of methods agrees with this conjecture for the case d=3. Numerical examples are made to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other ones. © 2011 Elsevier Inc. All rights reserved.This research was supported by Ministerio de Ciencia y Tecnologia MTM2010-18539.Cordero Barbero, A.; Torregrosa Sánchez, JR. (2011). A class of Steffensen type methods with optimal order of convergente. Applied Mathematics and Computation. 217(19):7653-7659. https://doi.org/10.1016/j.amc.2011.02.067S765376592171

A multistep Steffensen-type method for solving nonlinear systems of equations

[EN] This paper is devoted to the semilocal analysis of a high-order Steffensen-type method with frozen divided differences. The methods are free of bilinear operators and derivatives, which constitutes the main limitation of the classical high-order iterative schemes. Although the methods are more demanding, a semilocal convergence analysis is presented using weaker conditions than the classical Steffensen method.This work was supported supported in part by by Programa de Apoyo a la investigación de la fundación Séneca-Agencia de Ciencia y Tecnología de la Región de Murcia 19374/PI/14, by the project of Generalitat Valenciana Prometeo/2016/089 and the projects MTM2015-64382-P (MINECO/FEDER), MTM2014-52016-C2-1-P and MTM2014-52016-C2-2-P of the Spanish Ministry of Science and InnovationAmat, S.; Argyros, IK.; Busquier, S.; Hernández-Verón, MA.; Magreñán, AA.; Martínez Molada, E. (2020). A multistep Steffensen-type method for solving nonlinear systems of equations. Mathematical Methods in the Applied Sciences. 43(13):7518-7536. https://doi.org/10.1002/mma.5599S75187536431

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

Solving Nondifferentiable Nonlinear Equations by New Steffensen-Type Iterative Methods with Memory

It is attempted to present two derivative-free Steffensen-type methods with memory for solving nonlinear equations. By making use of a suitable self-accelerator parameter in the existing optimal fourth- and eighth-order without memory methods, the order of convergence has been increased without any extra function evaluation. Therefore, its efficiency index is also increased, which is the main contribution of this paper. The self-accelerator parameters are estimated using Newton’s interpolation. To show applicability of the proposed methods, some numerical illustrations are presented

Determination of multiple roots of nonlinear equations and applications

The final publication is available at Springer via https://dx.doi.org/10.1007/s10910-014-0460-8[EN] In this work we focus on the problem of approximating multiple roots of nonlinear equations. Multiple roots appear in some applications such as the compression of band-limited signals and the multipactor effect in electronic devices. We present a new family of iterative methods for multiple roots whose multiplicity is known. The methods are optimal in Kung-Traub's sense (Kung and Traub in J Assoc Comput Mach 21:643-651, [1]), because only three functional values per iteration are computed. By adding just one more function evaluation we make this family derivative free while preserving the convergence order. To check the theoretical results, we codify the new algorithms and apply them to different numerical examples.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia PAID-SP-2012-0474.Hueso Pagoaga, JL.; Martínez Molada, E.; Teruel Ferragud, C. (2015). Determination of multiple roots of nonlinear equations and applications. Journal of Mathematical Chemistry. 53(3):880-892. https://doi.org/10.1007/s10910-014-0460-8S880892533H.T. Kung, J.F. Traub, Optimal order of one-point and multi-point iteration. J. Assoc. Comput. Mach. 21, 643–651 (1974)W. Bi, H. Ren, Q. Wu, Three-step iterative methods with eighth-order convergence for solving nonlinear equations. J. Comput. Appl. Math. 255, 105–112 (2009)W. Bi, Q. Wu, H. Ren, A new family of eighth-order iterative methods for solving nonlinear equations. Appl. Math. Comput. 214, 236–245 (2009)A. Cordero, J.L. Hueso, E. Martínez, J.R. Torregrosa, New modifications of Potra-Pták’s method with optimal fourth and eighth order of convergence. J. Comput. Appl. Math. 234, 2969–2976 (2010)E. Schröder, Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann. 2, 317–365 (1870)C. Chun, B. Neta, A third-order modification of Newtons method for multiple roots. Appl. Math. Comput. 211, 474–479 (2009)Y.I. Kim, S.D. Lee, A third-order variant of NewtonSecant method finding a multiple zero. J. Chungcheong Math. Soc. 23(4), 845–852 (2010)B. Neta, Extension of Murakamis high-order nonlinear solver to multiple roots. Int. J. Comput. Math. 8, 1023–1031 (2010)H. Ren, Q. Wu, W. Bi, A class of two-step Steffensen type methods with fourth-order convergence. Appl. Math. Comput. 209, 206–210 (2009)Q. Zheng, J. Wang, P. Zhao, L. Zhang, A Steffensen-like method and its higher-order variants. Appl. Math. Comput. 214, 10–16 (2009)S. Amat, S. Busquier, On a Steffensen’s type method and its behavior for semismooth equations. Appl. Math. Comput. 177, 819–823 (2006)X. Feng, Y. He, High order iterative methods without derivatives for solving nonlinear equations. Appl. Math. Comput. 186, 1617–1623 (2007)A. Cordero, J.R. Torregrosa, A class of Steffensen type methods with optimal order of convergence. Appl. Math. Comput. doi: 10.1016/j.amc.2011.02.067F. Marvasti, A. Jain, Zero crossings, bandwidth compression, and restoration of nonlinearly distorted band-limited signals. J. Opt. Soc. Am. A 3, 651–654 (1986)S. Anza, C. Vicente, B. Gimeno, V.E. Boria, J. Armendáriz, Long-term multipactor discharge in multicarrier systems. Physics of Plasmas 14(8), 082–112 (2007)J.L. Hueso, E. Martínez, C. Teruel, New families of iterative methods with fourth and sixth order of convergence and their dynamics, in Proceedings of the 13th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2013, 24–27 June 2013A. Cordero, J.R. Torregrosa, Low-complexity root-finding iteration functions with no derivatives of any order of convergence. J. Comput. Appl. Math. doi: 10.10016/j.cam.2014.01.024 (2014)J.R. Sharma, R. Sharma, Modified Jarratt method for computing multiple roots. Appl. Math. Comput. 217, 878–881 (2010