Skip to main content
Log in

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

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. G. Solodkii, “Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I,” Ukr. Mat. Zh., 50, No. 5, 699–711 (1998).

    Article  MathSciNet  Google Scholar 

  2. N. P. Korneichuk, Splines in the Theory of Approximation [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  3. V. M. Tikhomirov, Some Problems of the Theory of Approximation [in Russian], Moscow University, Moscow (1976).

    Google Scholar 

  4. S. Pereverzev, “Optimization of projection methods for solving ill-posed problems,” Computing, 55, No. 2, 113–124 (1995).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 6, pp. 838–844, June, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solodkii, S.G. Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II. Ukr Math J 50, 952–959 (1998). https://doi.org/10.1007/BF02515229

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02515229

Keywords

Navigation