Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I
We construct a new system of discretization of the Fredholm integral equations of the first kind with linear compact operators A and free terms from the set Range (A(A*A)V), v > 1/2. The approach proposed enables one to obtain the optimal order of error on such classes of equations by using a considerably smaller amount of discrete information as compared with standard schemes.
English version (Springer): Ukrainian Mathematical Journal 50 (1998), no. 5, pp 795-808.
Citation Example: Solodkii S. G. Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I // Ukr. Mat. Zh. - 1998. - 50, № 5. - pp. 699–711.