| Abstract: | In this paper, we present a new approach to the problem of finding a common zero for a system of m‐accretive mappings in a uniformly convex Banach space with a uniformly Gâteaux differentiable norm. We propose an implicit iteration method and two explicit ones, based on compositions of resolvents with the steepest‐descent method. We show that our results contain some iterative methods in literature as special cases. An extension of the Xu's regularization method for the proximal point algorithm from Hilbert spaces onto Banach ones under simple conditions of convergence and a new variant for the method of alternating resolvents are obtained. Numerical experiments are given to affirm efficiency of the methods. |
