Abstract
In the present paper, the issue of the optimal solving severely ill-posed problems is studied. The authors proposed projection scheme of discretization which is efficient with respect to the amount of used Galerkin information. By this scheme, the order-optimal estimates of quantities described information and algorithmic complexity are achieved.
Notes
No potential conflict of interest was reported by the authors.