Abstract: It is presented a class of parallel multisplitting block relaxation iteration algorithms for solving large scale sparse block systems of linear algebraic equations.Under some weaker conditions,the convergence criterions of these new algorithms are obtained and some estimations of upper bounds of the spectral radii of the corresponding block iteration matrices are also presented.