Search

In this article, we consider two parametric classes of derivative free iterative methods of high order of convergence in Banach spaces. We study local and semilocal convergence results in Banach spaces for both families of iterative processes. We carry out a numerical application to solve a nonlinear and nondifferentiable Fredholm integral equation in the Banach space of continuous functions with the maximum norm. [ABSTRACT FROM AUTHOR]

From decomposition method for operators, we consider a Newton‐Steffensen iterative scheme for approximating a solution of nonlinear Fredholm integral equations with non‐differentiable Nemystkii operator. By means of a convergence study of the iterative scheme applied to this type of nonlinear Fredholm integral equations, we obtain domains of existence and uniqueness of solution for these equations. In addition, we illustrate this study with a numerical experiment. [ABSTRACT FROM AUTHOR]

In this article, an inverse free Steffensen-type method is introduced. The method is applied to approximate the systems of equations associated to implicit schemes approximating a stiff differential equation. The method has quadratic convergence without evaluating neither any derivative nor inverse operator. Finally, hypotheses ensuring the semilocal convergence and the R-order of convergence are presented. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of two high-order families of frozen Newton-type methods. The methods are free of bilinear operators, which constitute the main limitation of the classical high-order iterative schemes. Both families are natural generalizations of an efficient third-order method. Although the methods are more demanding, a semilocal convergence analysis is presented using weaker conditions. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the semilocal convergence of k-steps Newton's method with frozen first derivative in Banach spaces. The method reaches order of convergence k + 1. By imposing only the assumption that the Fréchet derivative satisfies the Lipschitz continuity, we define appropriate recurrence relations for obtaining the domains of convergence and uniqueness. We also define the accessibility regions for this iterative process in order to guarantee the semilocal convergence and perform a complete study of their efficiency. Our final aim is to apply these theoretical results to solve a special kind of conservative systems. [ABSTRACT FROM AUTHOR]

Newton's method and Kurchatov's method are iterative processes known for their fast speed of convergence. We construct from both methods an iterative method to approximate solutions of nonlinear equations given by a nondifferentiable operator, and we study its semilocal convergence in Banach spaces. Finally, we consider several applications of this new iterative process. [ABSTRACT FROM PUBLISHER]

The main goal of this paper is to approximate the principal pth root of a matrix by using a family of high-order iterative methods. We analyse the semi-local convergence and the speed of convergence of these methods. Concerning stability, it is well known that even the simplified Newton method is unstable. Despite it, we present stable versions of our family of algorithms. We test numerically the methods: we check the numerical robustness and stability by considering matrices that are close to be singular and badly conditioned. We find algorithms of the family with better numerical behavior than the Newton and the Halley methods. These two algorithms are basically the iterative methods proposed in the literature to solve this problem. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this paper, a semilocal convergence result in Banach spaces of an efficient fifth-order method is analyzed. Recurrence relations are used in order to prove this convergence, and some a priori error bounds are found. This scheme is finally used to estimate the solution of an integral equation and so, the theoretical results are numerically checked. We use this example to show the better efficiency of the current method compared with other existing ones, including Newton's scheme. [ABSTRACT FROM AUTHOR]

SUMMARY The main goal of this paper is to approximate inverse operators by high-order Newton-type methods with the important feature of not using inverse operators. We analyse the semilocal convergence, the speed of convergence, and the efficiency of these methods. We determine that Chebyshev's method is the most efficient method and test it on two problems: one associated to the heat equation and the other one to a boundary value problem. We consider examples with matrices that are close to be singular and/or are badly conditioned. We check the robustness and the stability of the methods by considering situations with many steps and noised data. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

We analyze the semilocal convergence of Steffensen's method, using a novel technique, which is based on recurrence relations, for solving systems of nonlinear equations. This technique allows analyzing the convergence of Steffensen's method to solutions of equations, where the function involved can be both differentiable and nondifferentiable. Moreover, this technique also allows enlarging the domain of starting points for Steffensen's method from certain predictions with the simplified Steffensen method. [ABSTRACT FROM AUTHOR]