Comparisons between Newton’s and Steffensen-like methods are given for solving systems of equations as well Banach space valued equations. Our idea the restricted convergence domain is used to compare sufficient criteria these under same conditions in previous papers. It turns out that following advantages shown: enlarged domain; tighter error estimates a more precise information on location so...

Solving equations of the form H(x)=0 is one most faced problem in mathematics and other science fields such as chemistry or physics. This kind cannot be solved without use iterative methods. The Steffensen-type methods, defined using divided differences are derivative free, usually considered to solve these problems when H a non-differentiable operator due its accuracy efficiency. However, gene...

In this article we study Steffensen method to solve nonlinear matrix equation $X+A^T X^{(-1)}A=Q$, when $A$ is a normal matrix. We establish some conditions that generate a sequence of positive denite matrices which converges to solution of this equation.

In this note, we propose a modification of Steffensen's method with some free parameters. These parameters are then be used for further acceleration via the concept of with memorization. In this way, we derive a fast Steffensen-type method with memory for solving nonlinear equations. Numerical results are also given to support the underlying theory of the article.