On the optimization of projection-iterative methods for the approximate solution of ill-posed problems

Abstract

We consider a new version of the projection-iterative method for the solution of operator equations of the first kind. We show that it is more economical in the sense of amount of used discrete information.