Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II

Abstract

The optimal order of information complexity is found for certain classes of ill-posed problems.