On generalization based on Bi et al. Iterative methods with eighth-order convergence for solving nonlinear equations

The primary goal of this work is to provide a general optimal three-step class of iterative methods based on the schemes designed by Bi et al. (2009). Accordingly, it requires four functional evaluations per iteration with eighth-order convergence. Consequently, it satisfies Kung and Traub's conjecture relevant to construction optimal methods without memory. Moreover, some concrete methods of this class are shown and implemented numerically, showing their applicability and efficiency.The authors thank the anonymous referees for their valuable comments and for the suggestions to improve the readability of the paper. This research was supported by Islamic Azad University, Hamedan Branch, and Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02.Lotfi, T.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Abadi, MA.; Zadeh, MM. (2014). On generalization based on Bi et al. Iterative methods with eighth-order convergence for solving nonlinear equations. The Scientific World Journal. 2014. https://doi.org/10.1155/2014/272949S2014Behl, R., Kanwar, V., & Sharma, K. K. (2012). Another Simple Way of Deriving Several Iterative Functions to Solve Nonlinear Equations. Journal of Applied Mathematics, 2012, 1-22. doi:10.1155/2012/294086Fernández-Torres, G., & Vásquez-Aquino, J. (2013). Three New Optimal Fourth-Order Iterative Methods to Solve Nonlinear Equations. Advances in Numerical Analysis, 2013, 1-8. doi:10.1155/2013/957496Kang, S. M., Rafiq, A., & Kwun, Y. C. (2013). A New Second-Order Iteration Method for Solving Nonlinear Equations. Abstract and Applied Analysis, 2013, 1-4. doi:10.1155/2013/487062Soleimani, F., Soleymani, F., & Shateyi, S. (2013). Some Iterative Methods Free from Derivatives and Their Basins of Attraction for Nonlinear Equations. Discrete Dynamics in Nature and Society, 2013, 1-10. doi:10.1155/2013/301718Bi, W., Ren, H., & Wu, Q. (2009). Three-step iterative methods with eighth-order convergence for solving nonlinear equations. Journal of Computational and Applied Mathematics, 225(1), 105-112. doi:10.1016/j.cam.2008.07.004Bi, W., Wu, Q., & Ren, H. (2009). A new family of eighth-order iterative methods for solving nonlinear equations. Applied Mathematics and Computation, 214(1), 236-245. doi:10.1016/j.amc.2009.03.077Kung, 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.321860Cordero, A., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2010). New modifications of Potra–Pták’s method with optimal fourth and eighth orders of convergence. Journal of Computational and Applied Mathematics, 234(10), 2969-2976. doi:10.1016/j.cam.2010.04.009Cordero, 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.067Cordero, A., Torregrosa, J. R., & Vassileva, M. P. (2011). Three-step iterative methods with optimal eighth-order convergence. Journal of Computational and Applied Mathematics, 235(10), 3189-3194. doi:10.1016/j.cam.2011.01.004Džunić, J., & Petković, M. S. (2012). A Family of Three-Point Methods of Ostrowski’s Type for Solving Nonlinear Equations. Journal of Applied Mathematics, 2012, 1-9. doi:10.1155/2012/425867Džunić, J., Petković, M. S., & Petković, L. D. (2011). A family of optimal three-point methods for solving nonlinear equations using two parametric functions. Applied Mathematics and Computation, 217(19), 7612-7619. doi:10.1016/j.amc.2011.02.055Heydari, M., Hosseini, S. M., & Loghmani, G. B. (2011). On two new families of iterative methods for solving nonlinear equations with optimal order. Applicable Analysis and Discrete Mathematics, 5(1), 93-109. doi:10.2298/aadm110228012hGeum, Y. H., & Kim, Y. I. (2010). A multi-parameter family of three-step eighth-order iterative methods locating a simple root. Applied Mathematics and Computation, 215(9), 3375-3382. doi:10.1016/j.amc.2009.10.030Geum, Y. H., & Kim, Y. I. (2011). A uniparametric family of three-step eighth-order multipoint iterative methods for simple roots. Applied Mathematics Letters, 24(6), 929-935. doi:10.1016/j.aml.2011.01.002Geum, Y. H., & Kim, Y. I. (2011). A biparametric family of eighth-order methods with their third-step weighting function decomposed into a one-variable linear fraction and a two-variable generic function. Computers & Mathematics with Applications, 61(3), 708-714. doi:10.1016/j.camwa.2010.12.020Kou, J., Wang, X., & Li, Y. (2010). Some eighth-order root-finding three-step methods. Communications in Nonlinear Science and Numerical Simulation, 15(3), 536-544. doi:10.1016/j.cnsns.2009.04.013Liu, L., & Wang, X. (2010). Eighth-order methods with high efficiency index for solving nonlinear equations. Applied Mathematics and Computation, 215(9), 3449-3454. doi:10.1016/j.amc.2009.10.040Wang, X., & Liu, L. (2010). New eighth-order iterative methods for solving nonlinear equations. Journal of Computational and Applied Mathematics, 234(5), 1611-1620. doi:10.1016/j.cam.2010.03.002Wang, X., & Liu, L. (2010). Modified Ostrowski’s method with eighth-order convergence and high efficiency index. Applied Mathematics Letters, 23(5), 549-554. doi:10.1016/j.aml.2010.01.009Sharma, J. R., & Sharma, R. (2009). A new family of modified Ostrowski’s methods with accelerated eighth order convergence. Numerical Algorithms, 54(4), 445-458. doi:10.1007/s11075-009-9345-5Soleymani, F. (2011). Novel Computational Iterative Methods with Optimal Order for Nonlinear Equations. Advances in Numerical Analysis, 2011, 1-10. doi:10.1155/2011/270903Soleymani, F., Sharifi, M., & Somayeh Mousavi, B. (2011). An Improvement of Ostrowski’s and King’s Techniques with Optimal Convergence Order Eight. Journal of Optimization Theory and Applications, 153(1), 225-236. doi:10.1007/s10957-011-9929-9Soleymani, F., Karimi Vanani, S., & Afghani, A. (2011). A General Three-Step Class of Optimal Iterations for Nonlinear Equations. Mathematical Problems in Engineering, 2011, 1-10. doi:10.1155/2011/469512Soleymani, F., Vanani, S. K., Khan, M., & Sharifi, M. (2012). Some modifications of King’s family with optimal eighth order of convergence. Mathematical and Computer Modelling, 55(3-4), 1373-1380. doi:10.1016/j.mcm.2011.10.016Soleymani, F., Karimi Vanani, S., & Jamali Paghaleh, M. (2012). A Class of Three-Step Derivative-Free Root Solvers with Optimal Convergence Order. Journal of Applied Mathematics, 2012, 1-15. doi:10.1155/2012/568740Thukral, R. (2010). A new eighth-order iterative method for solving nonlinear equations. Applied Mathematics and Computation, 217(1), 222-229. doi:10.1016/j.amc.2010.05.048Thukral, R. (2011). Eighth-Order Iterative Methods without Derivatives for Solving Nonlinear Equations. ISRN Applied Mathematics, 2011, 1-12. doi:10.5402/2011/693787Thukral, R. (2012). New Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations. International Journal of Mathematics and Mathematical Sciences, 2012, 1-12. doi:10.1155/2012/493456Thukral, R., & Petković, M. S. (2010). A family of three-point methods of optimal order for solving nonlinear equations. Journal of Computational and Applied Mathematics, 233(9), 2278-2284. doi:10.1016/j.cam.2009.10.012Wang, J. (2013). He’s Max-Min Approach for Coupled Cubic Nonlinear Equations Arising in Packaging System. Mathematical Problems in Engineering, 2013, 1-4. doi:10.1155/2013/382509Babajee, 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/165452Montazeri, H., Soleymani, F., Shateyi, S., & Motsa, S. S. (2012). On a New Method for Computing the Numerical Solution of Systems of Nonlinear Equations. Journal of Applied Mathematics, 2012, 1-15. doi:10.1155/2012/751975Soleymani, F. (2012). A Rapid Numerical Algorithm to Compute Matrix Inversion. International Journal of Mathematics and Mathematical Sciences, 2012, 1-11. doi:10.1155/2012/134653Soleymani, F. (2013). A new method for solving ill-conditioned linear systems. Opuscula Mathematica, 33(2), 337. doi:10.7494/opmath.2013.33.2.337Thukral, R. (2012). Further Development of Jarratt Method for Solving Nonlinear Equations. Advances in Numerical Analysis, 2012, 1-9. doi:10.1155/2012/493707Cordero, 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

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

Local convergence of a family of iterative methods for Hammerstein equations

[EN] In this paper we give a local convergence result for a uniparametric family of iterative methods for nonlinear equations in Banach spaces. We assume boundedness conditions involving only the first Fr,chet derivative, instead of using boundedness conditions for high order derivatives as it is usual in studies of semilocal convergence, which is a drawback for solving some practical problems. The existence and uniqueness theorem that establishes the convergence balls of these methods is obtained. We apply this theory to different examples, including a nonlinear Hammerstein equation that have many applications in chemistry and appears in problems of electro-magnetic fluid dynamics or in the kinetic theory of gases. With these examples we illustrate the advantages of these results. The global convergence of the method is addressed by analysing the behaviour of the methods on complex polynomials of second degree.This research was supported by Ministerio de Ciencia y Tecnologia MTM2014-52016-C2-02.This research was supported by Ministerio de Ciencia y Tecnología MTM2014-52016-C2-02.Martínez Molada, E.; Singh, S.; Hueso Pagoaga, JL.; Gupta, D. (2016). Local convergence of a family of iterative methods for Hammerstein equations. Journal of Mathematical Chemistry. 54(7):1370-1386. https://doi.org/10.1007/s10910-016-0602-2S13701386547I.K. Argyros, S. Hilout, M.A. Tabatabai, Mathematical Modelling with Applications in Biosciences and Engineering (Nova Publishers, New York, 2011)J.F. Traub, Iterative Methods for the Solution of Equations (Prentice-Hall, Englewood Cliffs, New Jersey, 1964)A.M. Ostrowski, Solutions of Equations in Euclidean and Banach Spaces (Academic Press, New York, 1973)I.K. Argyros, J.A. Ezquerro, J.M. Gutiárrez, M.A. Hernández, S. Hilout, On the semilocal convergence of efficient ChebyshevSecant-type methods. J. Comput. Appl. Math. 235, 3195–3206 (2011)José L. Hueso, E. Martínez, Semilocal convergence of a family of iterative methods in Banach spaces. Numer. Algorithms 67, 365–384 (2014)X. Wang, C. Gu, J. Kou, Semilocal convergence of a multipoint fourth-order super-Halley method in Banach spaces. Numer. Algorithms 54, 497–516 (2011)J. Kou, Y. Li, X. Wang, A variant of super Halley method with accelerated fourth-order convergence. Appl. Math. Comput. 186, 535–539 (2007)L. Zheng, C. Gu, Recurrence relations for semilocal convergence of a fifth-order method in Banach spaces. Numer. Algorithms 59, 623–638 (2012)S. Amat, M.A. Hernández, N. Romero, A modified Chebyshevs iterative method with at least sixth order of convergence. Appl. Math. Comput. 206, 164–174 (2008)X. Wang, J. Kou, C. Gu, Semilocal convergence of a sixth-order Jarratt method in Banach spaces. Numer. Algorithms 57, 441–456 (2011)A. Cordero, J.A. Ezquerro, M.A. Hernández-Verón, J.R. Torregrosa, On the local convergence of a fifth-order iterative method in Banach spaces. Appl. Math. Comput. 251, 396–403 (2015)I.K. Argyros, S. Hilout, On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. J. Comput. Appl. Math. 245, 1–9 (2013)S. Weerakoon, T.G.I. Fernando, A variant of Newton’s method with accelerated third-order convergence. Appl. Math. Lett. 13(8), 87–93 (2000)X. Feng, Y. He, High order oterative methods without derivatives for solving nonlinear equations. Appl. Math. Comput. 186, 1617–1623 (2007)X. Wang, J. Kou, Y. Li, Modified Jarratt method with sixth-order convergence. Appl. Math. Lett. 22, 1798–1802 (2009)A.D. Polyanin, A.V. Manzhirov, Handbook of Integral Equations (CRC Press, Boca Raton, 1998)S. Plaza, N. Romero, Attracting cycles for the relaxed Newton’s method. J. Comput. Appl. Math. 235(10), 3238–3244 (2011)A. Cordero, J.R. Torregrosa, P. Vindel, Study of the dynamics of third-order iterative methods on quadratic polynomials. Int. J. Comput. Math. 89(13–14), 1826–1836 (2012)Gerardo Honorato, Sergio Plaza, Natalia Romero, Dynamics of a higher-order family of iterative methods. J. Complex. 27(2), 221–229 (2011)J.M. Gutirrez, M.A. Hernández, N. Romero, Dynamics of a new family of iterative processes for quadratic polynomials. J. Comput. Appl. Math. 233(10), 2688–2695 (2010)I.K. Argyros, A.A. Magreñan, A study on the local convergence and dynamics of Chebyshev-Halley-type methods free from second derivative. Numer. Algorithms. doi: 10.1007/s11075-015-9981-xI.K. Argyros, S. George, Local convergence of modified Halley-like methods with less computation of inversion (Novi Sad J. Math, Draft version, 2015

A Parameterized multi-step Newton method for solving systems of nonlinear equations

We construct a novel multi-step iterative method for solving systems of nonlinear equations by introducing a parameter. to generalize the multi-step Newton method while keeping its order of convergence and computational cost. By an appropriate selection of theta, the new method can both have faster convergence and have larger radius of convergence. The new iterative method only requires one Jacobian inversion per iteration, and therefore, can be efficiently implemented using Krylov subspace methods. The new method can be used to solve nonlinear systems of partial differential equations, such as complex generalized Zakharov systems of partial differential equations, by transforming them into systems of nonlinear equations by discretizing approaches in both spatial and temporal independent variables such as, for instance, the Chebyshev pseudo-spectral discretizing method. Quite extensive tests show that the new method can have significantly faster convergence and significantly larger radius of convergence than the multi-step Newton method.Peer ReviewedPostprint (author's final draft

Spectral Methods for Numerical Relativity. The Initial Data Problem

Numerical relativity has traditionally been pursued via finite differencing. Here we explore pseudospectral collocation (PSC) as an alternative to finite differencing, focusing particularly on the solution of the Hamiltonian constraint (an elliptic partial differential equation) for a black hole spacetime with angular momentum and for a black hole spacetime superposed with gravitational radiation. In PSC, an approximate solution, generally expressed as a sum over a set of orthogonal basis functions (e.g., Chebyshev polynomials), is substituted into the exact system of equations and the residual minimized. For systems with analytic solutions the approximate solutions converge upon the exact solution exponentially as the number of basis functions is increased. Consequently, PSC has a high computational efficiency: for solutions of even modest accuracy we find that PSC is substantially more efficient, as measured by either execution time or memory required, than finite differencing; furthermore, these savings increase rapidly with increasing accuracy. The solution provided by PSC is an analytic function given everywhere; consequently, no interpolation operators need to be defined to determine the function values at intermediate points and no special arrangements need to be made to evaluate the solution or its derivatives on the boundaries. Since the practice of numerical relativity by finite differencing has been, and continues to be, hampered by both high computational resource demands and the difficulty of formulating acceptable finite difference alternatives to the analytic boundary conditions, PSC should be further pursued as an alternative way of formulating the computational problem of finding numerical solutions to the field equations of general relativity.Comment: 15 pages, 5 figures, revtex, submitted to PR

A multidomain spectral method for solving elliptic equations

We present a new solver for coupled nonlinear elliptic partial differential equations (PDEs). The solver is based on pseudo-spectral collocation with domain decomposition and can handle one- to three-dimensional problems. It has three distinct features. First, the combined problem of solving the PDE, satisfying the boundary conditions, and matching between different subdomains is cast into one set of equations readily accessible to standard linear and nonlinear solvers. Second, touching as well as overlapping subdomains are supported; both rectangular blocks with Chebyshev basis functions as well as spherical shells with an expansion in spherical harmonics are implemented. Third, the code is very flexible: The domain decomposition as well as the distribution of collocation points in each domain can be chosen at run time, and the solver is easily adaptable to new PDEs. The code has been used to solve the equations of the initial value problem of general relativity and should be useful in many other problems. We compare the new method to finite difference codes and find it superior in both runtime and accuracy, at least for the smooth problems considered here.Comment: 31 pages, 8 figure