The implementation of iterative methods using inverses to solve equations is a computationally expensive or impossible task in general. This is the case, since the analytical form of the inverse is difficult to find in practice. That is why, we replace the inverse by a sum of linear operators which is well defined. The convergence of the resulting hybrid methods is studied based on majorizing sequences under generalized continuity assumptions on the operators involved and in the setting of a Banach space. It is demonstrated by numerical experimentations that the convergence order as well as the number of iterations required to obtain a predetermined error tolerance when comparing the original to the hybrid method is essentially the same.