The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors.

In this paper, we study the method of cyclic projections for inconsistent convex feasibility problems in a Hilbert space under the presence of computational errors. We show that our algorithm generates a good approximate solution, if computational errors are bounded from above by a small positive constant. Our main goal is, for a known computational error, to find out what approximate solution can be obtained and how many iterates one needs for this. [ABSTRACT FROM AUTHOR]