Generalized high-order classes for solving nonlinear systems and their applications

[EN] A generalized high-order class for approximating the solution of nonlinear systems of equations is introduced. First, from a fourth-order iterative family for solving nonlinear equations, we propose an extension to nonlinear systems of equations holding the same order of convergence but replacing the Jacobian by a divided difference in the weight functions for systems. The proposed GH family of methods is designed from this fourth-order family using both the composition and the weight functions technique. The resulting family has order of convergence 9. The performance of a particular iterative method of both families is analyzed for solving different test systems and also for the Fisher's problem, showing the good performance of the new methods.This research was partially supported by both Ministerio de Ciencia, Innovacion y Universidades and Generalitat Valenciana, under grants PGC2018-095896-B-C22 (MCIU/AEI/FEDER/UE) and PROMETEO/2016/089, respectively.Chicharro, FI.; Cordero Barbero, A.; Garrido-Saez, N.; Torregrosa Sánchez, JR. (2019). Generalized high-order classes for solving nonlinear systems and their applications. Mathematics. 7(12):1-14. https://doi.org/10.3390/math7121194S114712Petković, M. S., Neta, B., Petković, L. D., & Džunić, J. (2014). Multipoint methods for solving nonlinear equations: A survey. Applied Mathematics and Computation, 226, 635-660. doi:10.1016/j.amc.2013.10.072Kung, 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., Gómez, E., & Torregrosa, J. R. (2017). Efficient High-Order Iterative Methods for Solving Nonlinear Systems and Their Application on Heat Conduction Problems. Complexity, 2017, 1-11. doi:10.1155/2017/6457532Sharma, J. R., & Arora, H. (2016). Improved Newton-like methods for solving systems of nonlinear equations. SeMA Journal, 74(2), 147-163. doi:10.1007/s40324-016-0085-xAmiri, A., Cordero, A., Taghi Darvishi, M., & Torregrosa, J. R. (2018). Stability analysis of a parametric family of seventh-order iterative methods for solving nonlinear systems. Applied Mathematics and Computation, 323, 43-57. doi:10.1016/j.amc.2017.11.040Cordero, 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-zChicharro, F. I., Cordero, A., Garrido, N., & Torregrosa, J. R. (2019). Wide stability in a new family of optimal fourth‐order iterative methods. Computational and Mathematical Methods, 1(2), e1023. doi:10.1002/cmm4.1023FISHER, R. A. (1937). THE WAVE OF ADVANCE OF ADVANTAGEOUS GENES. Annals of Eugenics, 7(4), 355-369. doi:10.1111/j.1469-1809.1937.tb02153.xSharma, 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-7Soleymani, 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-6Cordero, 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

Symbolic-numeric interface: A review

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach

A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence

This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.In this paper we give methodological survey of “contemporary methods” for solving the nonlinear equation f(x) = 0. The reason for this review is that many authors in present days rediscovered such classical methods. Here we develop one methodological schema for constructing nonstationary methods with a preliminary chosen speed of convergence

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

A Technique to Composite a Modified Newton's Method for Solving Nonlinear Equations

A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to compose a given iterative method with a modified Newton's method that introduces just one evaluation of the function. To carry out this procedure some classical methods with different orders of convergence are used to obtain root-finders with higher efficiency index

Numerical iterative methods for nonlinear problems.

The primary focus of research in this thesis is to address the construction of iterative methods for nonlinear problems coming from different disciplines. The present manuscript sheds light on the development of iterative schemes for scalar nonlinear equations, for computing the generalized inverse of a matrix, for general classes of systems of nonlinear equations and specific systems of nonlinear equations associated with ordinary and partial differential equations. Our treatment of the considered iterative schemes consists of two parts: in the first called the ’construction part’ we define the solution method; in the second part we establish the proof of local convergence and we derive convergence-order, by using symbolic algebra tools. The quantitative measure in terms of floating-point operations and the quality of the computed solution, when real nonlinear problems are considered, provide the efficiency comparison among the proposed and the existing iterative schemes. In the case of systems of nonlinear equations, the multi-step extensions are formed in such a way that very economical iterative methods are provided, from a computational viewpoint. Especially in the multi-step versions of an iterative method for systems of nonlinear equations, the Jacobians inverses are avoided which make the iterative process computationally very fast. When considering special systems of nonlinear equations associated with ordinary and partial differential equations, we can use higher-order Frechet derivatives thanks to the special type of nonlinearity: from a computational viewpoint such an approach has to be avoided in the case of general systems of nonlinear equations due to the high computational cost. Aside from nonlinear equations, an efficient matrix iteration method is developed and implemented for the calculation of weighted Moore-Penrose inverse. Finally, a variety of nonlinear problems have been numerically tested in order to show the correctness and the computational efficiency of our developed iterative algorithms

Extending the applicability of a fourth-order method under Lipschitz continuous derivative in Banach spaces

We extend the applicability of a fourth-order convergent nonlinear system solver by providing its local convergence analysis under Lipschitz continuous Fréchet derivative in Banach spaces. Our analysis only uses the first-order Fréchet derivative to ensure the convergence and provides the uniqueness of the solution, the radius of convergence ball and the computable error bounds. This study is applicable in solving such problems for which earlier studies are not effective. Furthermore, the convergence region for the scheme to approximate the zeros of various polynomials is studied using basins of attraction tool. Various computational tests are conducted to validate that our analysis is beneficial when prior studies fail to solve problems.The first author has been supported by the University Grants Commission, India.Publisher's Versio