scholarly journals Decomposition Technique and a Family of Efficient Schemes for Nonlinear Equations

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Farooq Ahmed Shah ◽  
Maslina Darus ◽  
Imran Faisal ◽  
Muhammad Arsalan Shafiq
Keyword(s):  
Applied Sciences ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Decomposition Technique ◽  
Unified Framework ◽  
New Methods ◽  
New Family ◽  
And Performance

Various problems of pure and applied sciences can be studied in the unified framework of nonlinear equations. In this paper, a new family of iterative methods for solving nonlinear equations is developed by using a new decomposition technique. The convergence of the new methods is proven. For the implementation and performance of the new methods, some examples are solved and the results are compared with some existing methods.

scholarly journals Some New Iterative Methods for Nonlinear Equations

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Muhammad Aslam Noor ◽  
Khalida Inayat Noor ◽  
Eisa Al-Said ◽  
Muhammad Waseem
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
System Of Equations ◽  
Decomposition Technique ◽  
Methods Comparison ◽  
Numerical Examples ◽  
New Methods ◽  
And Performance

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.

scholarly journals Modified Homotopy Perturbation Technique for the Approximate Solution of Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Farooq Ahmed Shah
Keyword(s):  
Approximate Solution ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Homotopy Perturbation Method ◽  
Perturbation Technique ◽  
Numerical Examples ◽  
Homotopy Perturbation ◽  
New Methods ◽  
And Performance ◽  
Homotopy Perturbation Technique

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.

Some New Iterative Techniques for the Problems Involving Nonlinear Equations

2019 ◽  
Vol 17 (07) ◽  
pp. 1950037 ◽  
Author(s):  
Faisal Ali ◽  
Waqas Aslam ◽  
Arif Rafiq
Keyword(s):  
Mathematical Models ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Graphical Analysis ◽  
Decomposition Technique ◽  
Convergence Criteria ◽  
Iterative Techniques ◽  
New Methods

We develop some new iterative methods, using decomposition technique, for solving the problems which involve nonlinear equations. Importantly, these methods include the generalization of some well-known existing methods. We prove the convergence criteria of our newly proposed methods. Various test examples are considered to validate the efficiency of our new methods. We also give the numerical as well as graphical analysis for two mathematical models to endorse the performance of these methods.

scholarly journals A New Optimal Eighth-Order Ostrowski-Type Family of Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Taher Lotfi ◽  
Tahereh Eftekhari
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Efficiency Index ◽  
Eighth Order ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
New Family ◽  
Ostrowski’S Method

Based on Ostrowski's method, a new family of eighth-order iterative methods for solving nonlinear equations by using weight function methods is presented. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore, this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on n evaluations could achieve optimal convergence order 2n−1. Thus, we provide a new class which agrees with the conjecture of Kung-Traub for n=4. Numerical comparisons are made to show the performance of the presented methods.

scholarly journals An Efficient Family of Optimal Eighth-Order Iterative Methods for Solving Nonlinear Equations and Its Dynamics

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Anuradha Singh ◽  
J. P. Jaiswal
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Basins Of Attraction ◽  
Order Method ◽  
Eighth Order ◽  
New Family ◽  
Seventh Order ◽  
Prime Objective ◽  
And Performance

The prime objective of this paper is to design a new family of optimal eighth-order iterative methods by accelerating the order of convergence of the existing seventh-order method without using more evaluations for finding simple root of nonlinear equations. Numerical comparisons have been carried out to demonstrate the efficiency and performance of the proposed method. Finally, we have compared new method with some existing eighth-order methods by basins of attraction and observed that the proposed scheme is more efficient.

NEW ITERATIVE METHODS FOR SOLVING INTEGRAL EQUATIONS

2011 ◽  
Vol 25 (32) ◽  
pp. 4655-4660
Author(s):  
MUHAMMAD ASLAM NOOR ◽  
KHALIDA INAYAT NOOR ◽  
EISA AL-SAID
Keyword(s):  
Integral Equations ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
New Method ◽  
Decomposition Technique ◽  
Numerical Examples ◽  
And Performance

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.

Extended conjugate gradient squared and conjugate residual squared methods for solving the generalized coupled Sylvester tensor equations

2020 ◽  
pp. 014233122093238
Author(s):  
Eisa Khosravi Dehdezi ◽  
Saeed Karimi
Keyword(s):  
Iterative Methods ◽  
Conjugate Gradient ◽  
Numerical Examples ◽  
New Methods ◽  
Conjugate Gradient Squared ◽  
And Performance ◽  
Tensor Computations ◽  
Conjugate Residual

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.

scholarly journals A Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
Numerical Examples ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
Specific Step

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.

SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS

2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Type Method ◽  
New Methods ◽  
Hermite Interpolating Polynomial ◽  
With Memory ◽  
Theoretical Results ◽  
Very High ◽  
High Computational Efficiency

In this paper, we present some three-point Newton-type iterative methods without memory for solving nonlinear equations by using undetermined coefficients method. The order of convergence of the new methods without memory is eight requiring the evaluations of three functions and one first-order derivative in per full iteration. Hence, the new methods are optimal according to Kung and Traubs conjecture. Based on the presented methods without memory, we present two families of Newton-type iterative methods with memory. Further accelerations of convergence speed are obtained by using a self-accelerating parameter. This self-accelerating parameter is calculated by the Hermite interpolating polynomial and is applied to improve the order of convergence of the Newton-type method. The corresponding R-order of convergence is increased from 8 to 9, [Formula: see text] and 10. The increase of convergence order is attained without any additional calculations so that the two families of the methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm theoretical results.

Sign in / Sign up

Export Citation Format

Share Document