One of the current methods for nonlinear pipe network equations is the Wood- Charles iterative method. However, the general proof for its convergence has not been developed. In this paper, an improvement has been made in the original W-C method. we have chosen several iterative matrixes and suggested two step rules, in both of which no accurate univariant search is necessary. Based on these ameliorations, we have proved the convergence of our algorithm and furthermore, have pointed out that under different conditions the improved algorithm possesses a superlinear or linear rate of convergence. Besides, this method can be generalized to solve a class of nonlinear programming problems.