scholarly journals Novel Three Order Methods for Solving a System of Nonlinear Equations

Author(s):  
M.Q. Khirallah ◽  
M.A. Hafiz

In this paper, we suggest and study Simpson's formula, and Newton's two, three and four Cosed formulas iterative methods for solving the system of nonlinear equations by using Predictor-Corrector of Newton method. We present four new algorithms for solving the system of nonlinear equations (SNLE). We prove that these new algorithms have convergence. Several numerical examples are given to illustrate the efficiency and performance of the new iterative methods. These new algorithms may be viewed as an extensions and generalizations of the existing methods for solving the system of nonlinear equations.

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Muhammad Aslam Noor ◽  
Khalida Inayat Noor ◽  
Eisa Al-Said ◽  
Muhammad Waseem

We suggest and analyze some new iterative methods for solving the nonlinear equationsf(x)=0using the decomposition technique coupled with the system of equations. We prove that new methods have convergence of fourth order. Several numerical examples are given to illustrate the efficiency and performance of the new methods. Comparison with other similar methods is given.


2018 ◽  
Vol 1 (2) ◽  
pp. 32-39
Author(s):  
Jivandhar Jnawali

Newton method is one of the most widely used numerical methods for solving nonlinear equations. McDougall and Wotherspoon [Appl. Math. Lett., 29 (2014), 20-25] modified this method in predictor-corrector form and get an order of convergence 1+√2. More on the PDF


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Farooq Ahmed Shah

We use a new modified homotopy perturbation method to suggest and analyze some new iterative methods for solving nonlinear equations. This new modification of the homotopy method is quite flexible. Various numerical examples are given to illustrate the efficiency and performance of the new methods. These new iterative methods may be viewed as an addition and generalization of the existing methods for solving nonlinear equations.


Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1221 ◽  
Author(s):  
Raudys R. Capdevila ◽  
Alicia Cordero ◽  
Juan R. Torregrosa

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.


2011 ◽  
Vol 25 (32) ◽  
pp. 4655-4660
Author(s):  
MUHAMMAD ASLAM NOOR ◽  
KHALIDA INAYAT NOOR ◽  
EISA AL-SAID

In this paper, we use the decomposition technique of Noor and Noor [M. A. Noor and K. I. Noor, Three-step iterative methods for nonlinear equations, preprint (2006)] to suggest and analyze a new iterative methods for solving the integral equations. Our method of developing this new method is very simple as compared with other methods. Several numerical examples are given to illustrate the efficiency and performance of the new method. Results reveal that the proposed method is very effective and simple. Our method can be considered as an improvement of the existing methods.


Author(s):  
Eisa Khosravi Dehdezi ◽  
Saeed Karimi

In this paper, two attractive iterative methods – conjugate gradient squared (CGS) and conjugate residual squared (CRS) – are extended to solve the generalized coupled Sylvester tensor equations [Formula: see text]. The proposed methods use tensor computations with no maricizations involved. Also, some properties of the new methods are presented. Finally, several numerical examples are given to compare the efficiency and performance of the proposed methods with some existing algorithms.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.


2007 ◽  
Vol 190 (2) ◽  
pp. 1815-1823 ◽  
Author(s):  
Miquel Grau-Sánchez ◽  
Josep M. Peris ◽  
José M. Gutiérrez

Sign in / Sign up

Export Citation Format

Share Document