Several New Families of Jarratt’s Method for Solving Systems of Nonlinear Equations

In this study, we suggest and analyze a new and wide general class of Jarratt’s method for solving systems of nonlinear equations. These methods have fourth-order convergence and do not require the evaluation of any second or higher-order Fréchet derivatives. In terms of computational cost, all these methods require evaluations of one function and two first-order Fréchet derivatives. The performance of proposed methods is compared with their closest competitors in a series of numerical experiments. It is worth mentioning that all the methods considered here are found to be effective and comparable to the robust methods available in the literature

Stability anomalies of some jacobian-free iterative methods of high order of convergence

[EN] In this manuscript, we design two classes of parametric iterative schemes to solve nonlinear problems that do not need to evaluate Jacobian matrices and need to solve three linear systems per iteration with the same divided difference operator as the coefficient matrix. The stability performance of the classes is analyzed on a quadratic polynomial system, and it is shown that for many values of the parameter, only convergence to the roots of the problem exists. Finally, we check the performance of these methods on some test problems to confirm the theoretical results.This research was partially supported by Ministerio de Economia y Competitividad under grants PGC2018-095896-B-C22, Generalitat Valenciana PROMETEO/2016/089 and FONDOCYT 027-2018 and 029-2018, Dominican Republic.Cordero Barbero, A.; García-Maimo, J.; Torregrosa Sánchez, JR.; Vassileva, MP. (2019). Stability anomalies of some jacobian-free iterative methods of high order of convergence. Axioms. 8(2):1-15. https://doi.org/10.3390/axioms8020051S11582Frontini, 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-4Homeier, H. H. . (2004). A modified Newton method with cubic convergence: the multivariate case. Journal of Computational and Applied Mathematics, 169(1), 161-169. doi:10.1016/j.cam.2003.12.041Aslam Noor, M., & Waseem, M. (2009). Some iterative methods for solving a system of nonlinear equations. Computers & Mathematics with Applications, 57(1), 101-106. doi:10.1016/j.camwa.2008.10.067Xiao, X., & Yin, H. (2015). A new class of methods with higher order of convergence for solving systems of nonlinear equations. Applied Mathematics and Computation, 264, 300-309. doi:10.1016/j.amc.2015.04.094Cordero, 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.062Darvishi, M. T., & Barati, A. (2007). A third-order Newton-type method to solve systems of nonlinear equations. Applied Mathematics and Computation, 187(2), 630-635. doi:10.1016/j.amc.2006.08.080Sharma, J. R., Guha, R. K., & Sharma, R. (2012). An efficient fourth order weighted-Newton method for systems of nonlinear equations. Numerical Algorithms, 62(2), 307-323. doi:10.1007/s11075-012-9585-7Narang, M., Bhatia, S., & Kanwar, V. (2016). New two-parameter Chebyshev–Halley-like family of fourth and sixth-order methods for systems of nonlinear equations. Applied Mathematics and Computation, 275, 394-403. doi:10.1016/j.amc.2015.11.063Behl, R., Sarría, Í., González, R., & Magreñán, Á. A. (2019). Highly efficient family of iterative methods for solving nonlinear models. Journal of Computational and Applied Mathematics, 346, 110-132. doi:10.1016/j.cam.2018.06.042Amorós, C., Argyros, I., González, R., Magreñán, Á., Orcos, L., & Sarría, Í. (2019). Study of a High Order Family: Local Convergence and Dynamics. Mathematics, 7(3), 225. doi:10.3390/math7030225Argyros, I., & González, D. (2015). Local Convergence for an Improved Jarratt-type Method in Banach Space. International Journal of Interactive Multimedia and Artificial Intelligence, 3(4), 20. doi:10.9781/ijimai.2015.344Sharma, J. R., & Gupta, P. (2014). An efficient fifth order method for solving systems of nonlinear equations. Computers & Mathematics with Applications, 67(3), 591-601. doi:10.1016/j.camwa.2013.12.004Cordero, A., Gutiérrez, J. M., Magreñán, Á. A., & Torregrosa, J. R. (2016). Stability analysis of a parametric family of iterative methods for solving nonlinear models. Applied Mathematics and Computation, 285, 26-40. doi:10.1016/j.amc.2016.03.021Cordero, A., Soleymani, F., & Torregrosa, J. R. (2014). Dynamical analysis of iterative methods for nonlinear systems or how to deal with the dimension? Applied Mathematics and Computation, 244, 398-412. doi:10.1016/j.amc.2014.07.010Cordero, 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-zArgyros, I., & George, S. (2015). Ball Convergence for Steffensen-type Fourth-order Methods. International Journal of Interactive Multimedia and Artificial Intelligence, 3(4), 37. doi:10.9781/ijimai.2015.347Chicharro, F. I., Cordero, A., & Torregrosa, J. R. (2013). Drawing Dynamical and Parameters Planes of Iterative Families and Methods. The Scientific World Journal, 2013, 1-11. doi:10.1155/2013/78015

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

Preliminary orbit determination of artificial satellites: a vectorial sixth-order approach

A modified classical method for preliminary orbit determination is presented. In our proposal, the spread of the observations is considerably wider than in the original method, as well as the order of convergence of the iterative scheme involved. The numerical approach is made by using matricial weight functions, which will lead us to a class of iterative methods with a sixth local order of convergence. This is a process widely used in the design of iterative methods for solving nonlinear scalar equations, but rarely employed in vectorial cases. The numerical tests confirm the theoretical results, and the analysis of the dynamics of the problem shows the stability of the proposed schemes.The authors thank the anonymous referees for their valuable comments and suggestions. This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02.Andreu Estellés, C.; Cambil Teba, N.; Cordero Barbero, A.; Torregrosa Sánchez, JR. (2013). Preliminary orbit determination of artificial satellites: a vectorial sixth-order approach. Abstract and Applied Analysis. 2013. https://doi.org/10.1155/2013/960582S2013Fidkowski, K. J., Oliver, T. A., Lu, J., & Darmofal, D. L. (2005). p-Multigrid solution of high-order discontinuous Galerkin discretizations of the compressible Navier–Stokes equations. Journal of Computational Physics, 207(1), 92-113. doi:10.1016/j.jcp.2005.01.005Bruns, D. D., & Bailey, J. E. (1977). Nonlinear feedback control for operating a nonisothermal CSTR near an unstable steady state. Chemical Engineering Science, 32(3), 257-264. doi:10.1016/0009-2509(77)80203-0He, Y., & Ding, C. H. Q. (2001). The Journal of Supercomputing, 18(3), 259-277. doi:10.1023/a:1008153532043Revol, N., & Rouillier, F. (2005). Motivations for an Arbitrary Precision Interval Arithmetic and the MPFI Library. Reliable Computing, 11(4), 275-290. doi:10.1007/s11155-005-6891-yBabajee, D. K. R., Dauhoo, M. Z., Darvishi, M. T., & Barati, A. (2008). A note on the local convergence of iterative methods based on Adomian decomposition method and 3-node quadrature rule. Applied Mathematics and Computation, 200(1), 452-458. doi:10.1016/j.amc.2007.11.009Darvishi, M. T., & Barati, A. (2007). A third-order Newton-type method to solve systems of nonlinear equations. Applied Mathematics and Computation, 187(2), 630-635. doi:10.1016/j.amc.2006.08.080Darvishi, M. T., & Barati, A. (2007). Super cubic iterative methods to solve systems of nonlinear equations. Applied Mathematics and Computation, 188(2), 1678-1685. doi:10.1016/j.amc.2006.11.022Cordero, A., Martínez, E., & Torregrosa, J. R. (2009). Iterative methods of order four and five for systems of nonlinear equations. Journal of Computational and Applied Mathematics, 231(2), 541-551. doi:10.1016/j.cam.2009.04.015Babajee, 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.035Soleymani, F., Lotfi, T., & Bakhtiari, P. (2013). A multi-step class of iterative methods for nonlinear systems. Optimization Letters, 8(3), 1001-1015. doi:10.1007/s11590-013-0617-6Awawdeh, F. (2009). On new iterative method for solving systems of nonlinear equations. Numerical Algorithms, 54(3), 395-409. doi:10.1007/s11075-009-9342-8Babajee, 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/165452Cordero, A., Torregrosa, J. R., & Vassileva, M. P. (2012). Pseudocomposition: A technique to design predictor–corrector methods for systems of nonlinear equations. Applied Mathematics and Computation, 218(23), 11496-11504. doi:10.1016/j.amc.2012.04.081Cordero, A., Torregrosa, J. R., & Vassileva, M. P. (2013). Increasing the order of convergence of iterative schemes for solving nonlinear systems. Journal of Computational and Applied Mathematics, 252, 86-94. doi:10.1016/j.cam.2012.11.024Soleymani, F., & Stanimirović, P. S. (2013). A Higher Order Iterative Method for Computing the Drazin Inverse. The Scientific World Journal, 2013, 1-11. doi:10.1155/2013/708647Soleymani, F., Stanimirović, P. S., & Ullah, M. Z. (2013). An accelerated iterative method for computing weighted Moore–Penrose inverse. Applied Mathematics and Computation, 222, 365-371. doi:10.1016/j.amc.2013.07.039Sharma, J. R., Guha, R. K., & Sharma, R. (2012). An efficient fourth order weighted-Newton method for systems of nonlinear equations. Numerical Algorithms, 62(2), 307-323. doi:10.1007/s11075-012-9585-7Sharma, J. R., & Arora, H. (2013). On efficient weighted-Newton methods for solving systems of nonlinear equations. Applied Mathematics and Computation, 222, 497-506. doi:10.1016/j.amc.2013.07.066Abad, M. F., Cordero, A., & Torregrosa, J. R. (2013). Fourth- and Fifth-Order Methods for Solving Nonlinear Systems of Equations: An Application to the Global Positioning System. Abstract and Applied Analysis, 2013, 1-10. doi:10.1155/2013/586708Cordero, 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-zJarratt, P. (1966). Some fourth order multipoint iterative methods for solving equations. Mathematics of Computation, 20(95), 434-434. doi:10.1090/s0025-5718-66-99924-8Cordero, 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.062Chicharro, F. I., Cordero, A., & Torregrosa, J. R. (2013). Drawing Dynamical and Parameters Planes of Iterative Families and Methods. The Scientific World Journal, 2013, 1-11. doi:10.1155/2013/78015

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

Variational methods for solving nonlinear boundary problems of statics of hyper-elastic membranes

A number of important results of studying large deformations of hyper-elastic shells are obtained using discrete methods of mathematical physics. In the present paper, using the variational method for solving nonlinear boundary problems of statics of hyper-elastic membranes under the regular hydrostatic load, we investigate peculiarities of deformation of a circular membrane whose mechanical characteristics are described by the Bidermann-type elastic potential. We develop an algorithm for solving a singular perturbation of nonlinear problem for the case of membrane loaded by heavy liquid. This algorithm enables us to obtain approximate solutions both in the presence of boundary layer and without it. The class of admissible functions, on which the variational method is realized, is chosen with account of the structure of formal asymptotic expansion of solutions of the corresponding linearized equations that have singularities in a small parameter at higher derivatives and in the independent variable. We give examples of calculations that illustrate possibilities of the method suggested for solving the problem under consideration

Arc-Length Continuation and Multigrid Techniques for Nonlinear Elliptic Eigenvalue Problems

We investigate multi-grid methods for solving linear systems arising from arc-length continuation techniques applied to nonlinear elliptic eigenvalue problems. We find that the usual multi-grid methods diverge in the neighborhood of singular points of the solution branches. As a result, the continuation method is unable to continue past a limit point in the Bratu problem. This divergence is analyzed and a modified multi-grid algorithm has been devised based on this analysis. In principle, this new multi-grid algorithm converges for elliptic systems, arbitrarily close to singularity and has been used successfully in conjunction with arc-length continuation procedures on the model problem. In the worst situation, both the storage and the computational work are only about a factor of two more than the unmodified multi-grid methods