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.  

Some recent and classical integral inequalities are extended to the general timescale calculus, including the inequalities of Steffensen, Iyengar, Čebyšev, and Hermite-Hadamard.

In this paper we present a new algorithm for mobile power updates in wireless CDMA systems. The algorithm in fact represents accelerated Jacobi iterations for mobile power updates of the algorithm popularly known as the DPC (distributed power control) algorithm. The new algorithm, with more rapid convergence, is obtained using Steffensen fixed-point iterations initialized by two Jacobi iteratio...

For iteration sequences otherwise converging linearly, the proposed one-point extrapolation method attains a convergence rate and efficiency of 1.618. This is accomplished by retaining an estimate of the linear coefficient from the previous step and using the estimate to extrapolate. For linear convergence problems, the classical Aitken-Steffensen 6 -process has an efficiency of just -J2, while...