In this paper we present a new one-parameter family of iterative methods to solve nonlinear equations which includes some well-known third-order methods as particular ones. The convergence analysis shows that the order of convergence of each method of the family is three. Numerical examples are given to illustrate the efficiency and performance of the presented methods. 2006 Elsevier Inc. All r...

1 Department of Mathematics, Govt. College Kamoke, Gujranwala, Pakistan 2 Department of Mathematics and Statistics, University of Lahore, Lahore, Pakistan 3 Division of Science and Technology, University of Education, Lahore, Pakistan E-mail: [email protected], [email protected], [email protected] , [email protected]. ABSTRACT: In this paper, we present a new modified two-ste...

Kung-Traub conjecture states that an iterative method without memory for finding the simple zero of a scalar equation could achieve convergence order 2d−1, and d is the total number of function evaluations. In an article “Babajee, D.K.R. On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations, Algorithms 2016, 9, 1, doi:10.3390/a9010001”, the author has shown that Kun...

In this article, we prove strong convergence of sequence generated by the following iteration sequence for a class of Lipschitzian pseudocontractive mapping T: x n+1 = β n u + (1 − β n)[α n Tx n + (1 − α n)x n ] whenever {a n } and {b n } satisfy the appropriate conditions.

Under the hypothesis that the derivative satisfies some kind of weak Lipschitz condition, sharp estimates of the radii of convergence balls of Newton-like methods for operator equations are given in Banach space. New results can be used to analyze the convergence of other developed Newton iterative methods.

The aim of this paper is to prove weak and strong convergence as well as weak stability results of CR-iterative procedures using contractive-like operators. The results obtained generalize several existing results. An example is also given, using computer programming in C++, to show that CR-iterative procedure converges faster than SP and Noor iterative procedures.

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape...

Recently, some convergent results of the generalized AOR iterative (GAOR) method for solving linear systems with strictly diagonally dominant matrices are presented in [Darvishi, M.T., Hessari, P.: On convergence of the generalized AOR method for linear systems with diagonally dominant cofficient matrices. Appl. Math. Comput. 176, 128-133 (2006)] and [Tian, G.X., Huang, T.Z., Cui, S.Y.: Converg...

‎In this paper‎, ‎firstly‎, ‎we review approximation of fuzzy functions‎ ‎by fuzzy bicubic splines interpolation and present a new approach‎ ‎based on the two-dimensional fuzzy splines interpolation and‎ ‎iterative method to approximate the solution of two-dimensional‎ ‎linear fuzzy Fredholm integral equation (2DLFFIE)‎. ‎Also‎, ‎we prove‎ ‎convergence analysis and numerical stability analysis ...

we introduce a new one-step iteration process to approximate common fixed points of twononexpansive mappings in banach spaces and prove weak convergence of the iterative sequence using (i)opial’s condition and (ii) kadec-klee property. strong convergence theorems are also established in banachspaces and uniformly convex banach spaces under the so-called condition ( a ), which is weaker thancom...