in this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.when the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. additionally for linear feasibil...

We study the algorithmic applications of a natural discretization for hard-sphere model and Widom–Rowlinson in region $$d $$ -dimensional Euclidean space \mathbb {V} \subset {R} ^{d}$$ . These continuous models are frequently used statistical physics to describe mixtures one or multiple particle types subjected hard-core interactions. For each type, particles distributed according Poisson point...