scholarly journals Two-Step Solver for Nonlinear Equations

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 128 ◽  
Author(s):  
Ioannis Argyros ◽  
Stepan Shakhno ◽  
Halyna Yarmola
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Semilocal Convergence ◽  
Numerical Example ◽  
Weaker Conditions ◽  
Theoretical Results ◽  
Nondifferentiable Operator

In this paper we present a two-step solver for nonlinear equations with a nondifferentiable operator. This method is based on two methods of order of convergence 1 + 2 . We study the local and a semilocal convergence using weaker conditions in order to extend the applicability of the solver. Finally, we present the numerical example that confirms the theoretical results.

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.

scholarly journals Optimal High-Order Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Artidiello ◽  
A. Cordero ◽  
Juan R. Torregrosa ◽  
M. P. Vassileva
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Order ◽  
Function Technique ◽  
Numerical Tests ◽  
New Methods ◽  
Theoretical Results ◽  
Made In

A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.

Design and Analysis of a New Class of Derivative-Free Optimal Order Methods for Nonlinear Equations

2018 ◽  
Vol 15 (03) ◽  
pp. 1850010 ◽  
Author(s):  
Janak Raj Sharma ◽  
Ioannis K. Argyros ◽  
Deepak Kumar
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Optimal Order ◽  
Optimal Order Of Convergence ◽  
Numerical Examples ◽  
New Class ◽  
New Methods ◽  
Derivative Free ◽  
Local Convergence Analysis ◽  
Theoretical Results

We develop a general class of derivative free iterative methods with optimal order of convergence in the sense of Kung–Traub hypothesis for solving nonlinear equations. The methods possess very simple design, which makes them easy to remember and hence easy to implement. The Methodology is based on quadratically convergent Traub–Steffensen scheme and further developed by using Padé approximation. Local convergence analysis is provided to show that the iterations are locally well defined and convergent. Numerical examples are provided to confirm the theoretical results and to show the good performance of new methods.

scholarly journals An Ulm-Type Inverse-Free Iterative Scheme for Fredholm Integral Equations of Second Kind

Symmetry ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1957
Author(s):  
José M. Gutiérrez ◽  
Miguel Á. Hernández-Verón
Keyword(s):  
Integral Equations ◽  
Order Of Convergence ◽  
Iterative Scheme ◽  
Semilocal Convergence ◽  
Fredholm Integral Equations ◽  
Linear Integral ◽  
Ulm’S Method ◽  
Theoretical Results ◽  
Quadratic Order ◽  
Linear Integral Equations

In this paper, we present an iterative method based on the well-known Ulm’s method to numerically solve Fredholm integral equations of the second kind. We support our strategy in the symmetry between two well-known problems in Numerical Analysis: the solution of linear integral equations and the approximation of inverse operators. In this way, we obtain a two-folded algorithm that allows us to approximate, with quadratic order of convergence, the solution of the integral equation as well as the inverses at the solution of the derivative of the operator related to the problem. We have studied the semilocal convergence of the method and we have obtained the expression of the method in a particular case, given by some adequate initial choices. The theoretical results are illustrated with two applications to integral equations, given by symmetric non-separable kernels.

scholarly journals Convergence of a Two-Step Iterative Method for Nondifferentiable Operators in Banach Spaces

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Abhimanyu Kumar ◽  
Dharmendra K. Gupta ◽  
Eulalia Martínez ◽  
Sukhjit Singh
Keyword(s):  
Iterative Method ◽  
Banach Spaces ◽  
Local Convergence ◽  
Recurrence Relations ◽  
Semilocal Convergence ◽  
Convergence Domain ◽  
Differentiability Condition ◽  
Type Integral ◽  
Weaker Conditions ◽  
Theoretical Results

The semilocal and local convergence analyses of a two-step iterative method for nonlinear nondifferentiable operators are described in Banach spaces. The recurrence relations are derived under weaker conditions on the operator. For semilocal convergence, the domain of the parameters is obtained to ensure guaranteed convergence under suitable initial approximations. The applicability of local convergence is extended as the differentiability condition on the involved operator is avoided. The region of accessibility and a way to enlarge the convergence domain are provided. Theorems are given for the existence-uniqueness balls enclosing the unique solution. Finally, some numerical examples including nonlinear Hammerstein type integral equations are worked out to validate the theoretical results.

A convergence of a Steffensen-like method for solving nonlinear equations in a Banach space

2017 ◽  
Vol 26 (2) ◽  
pp. 125-136
Author(s):  
IOANNIS K. ARGYROS ◽  
SANTHOSH GEORGE
Keyword(s):  
Banach Space ◽  
Nonlinear Equation ◽  
Convergence Analysis ◽  
Unique Solution ◽  
Nonlinear Equations ◽  
Semilocal Convergence ◽  
Convergence Conditions ◽  
Numerical Example ◽  
Space Setting

We present a local as well as a semilocal convergence analysis of a Steffensen-like method in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. This method generalizes and improves the sufficient convergence conditions of earlier methods. In particular, a numerical example is presented to show the advantages of our approach.

scholarly journals On Some Iterative Methods with Memory and High Efficiency Index for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Tahereh Eftekhari
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Efficiency ◽  
Efficiency Index ◽  
Order Convergence ◽  
Eighth Order ◽  
Additional Function ◽  
Numerical Comparisons ◽  
With Memory

Based on iterative methods without memory of eighth-order convergence proposed by Thukral (2012), some iterative methods with memory and high efficiency index are presented. We show that the order of convergence is increased without any additional function evaluations. Numerical comparisons are made to show the performance of the presented methods.

scholarly journals On a Derivative-Free Variant of King’s Family with Memory

2015 ◽  
Vol 2015 ◽  
pp. 1-5
Author(s):  
M. Sharifi ◽  
S. Karimi Vanani ◽  
F. Khaksar Haghani ◽  
M. Arab ◽  
S. Shateyi
Keyword(s):  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Derivative Free ◽  
With Memory

The aim of this paper is to construct a method with memory according to King’s family of methods without memory for nonlinear equations. It is proved that the proposed method possesses higherR-order of convergence using the same number of functional evaluations as King’s family. Numerical experiments are given to illustrate the performance of the constructed scheme.

scholarly journals Metode Iterasi Tiga Langkah untuk Menyelesaikan Persamaan NonLinear dengan Menggunakan Matlab

2019 ◽  
Vol 4 (2) ◽  
pp. 34
Author(s):  
Deasy Wahyuni ◽  
Elisawati Elisawati
Keyword(s):  
Numerical Simulations ◽  
Nonlinear Equations ◽  
Newton Method ◽  
Iteration Method ◽  
Newton's Method ◽  
Order Of Convergence ◽  
Higher Order ◽  
Convergence Order ◽  
Matlab Program ◽  
Analytical Results

Newton method is one of the most frequently used methods to find solutions to the roots of nonlinear equations. Along with the development of science, Newton's method has undergone various modifications. One of them is the hasanov method and the newton method variant (vmn), with a higher order of convergence. In this journal focuses on the three-step iteration method in which the order of convergence is higher than the three methods. To find the convergence order of the three-step iteration method requires a program that can support the analytical results of both methods. One of them using the help of the matlab program. Which will then be compared with numerical simulations also using the matlab program.  Keywords : newton method, newton method variant, Hasanov Method and order of convergence

Sign in / Sign up

Export Citation Format

Share Document