Split Common Fixed Point Problems

In this chapter we study split common fixed point problems in a Hilbert space under the presence of computational errors. We show that our algorithm generate 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 iterations one needs for this.