Tight bounds on the complexity index of one-point iterations

We study the minimal complexity index of one-point iterations without memory for the solution of a system of N nonlinear equations F(x)=0. We present an iteration ^* with maximal order of convergence and with linear combinatory complexity. We show the complexity index of ^* is close to the lower bound on the minimal complexity index.