Skip to main content
SpringerLink
Log in

Optimization of projection schemes of digitization of ill-posed problems

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We construct new projection schemes of digitization of ill-posed problems, which are optimal in the sense of the amount of discrete information used. We establish that the application of self-adjoint projection schemes to digitization of equations with self-adjoint operators is not optimal.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. F. Traub and H. Wózniakowski,A General Theory of Optimal Algorithms, Academic Press, New York (1980).

    MATH  Google Scholar 

  2. S. V. Pereverzev,Optimization of Methods for the Approximate Solution of Operator Equations [in Russian], Institute of Mathematics, Ukrainian Academy of Sciences, Kiev (1996).

    MATH  Google Scholar 

  3. R. Plato and G. Vainikko, “On the regularization of the Ritz-Galerkin method for solving ill-posed problems,”Uchen. Zap. Tart. Univ., Issue 863, 3–17 (1989).

    MathSciNet  Google Scholar 

  4. R. Plato and G. Vainikko, “On the regularization of projection methods for solving ill-posed problems,”Numer. Math.,57, 63–70 (1990).

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. S. G. Solodkii, “On the digitization of ill-posed problems,”Zh. Vychisl. Mat. Mat. Fiz. 36, No. 8, 15–22 (1996).

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. V. K. Ivanov, V. V. Vasin, and V. P. Tanana,Theory of Linear Ill-Posed Problems and Its Applications [in Russian], Nauka, Moscow (1978).

    MATH  Google Scholar 

  9. A. N. Tikhonov and V. Ya. Arsenin,Methods for the Solution of Ill-Posed Problems [in Russian], Nauka, Moscow (1979).

    MATH  Google Scholar 

  10. G. M. Vainikko and A. Yu. Veretennikov,Iterative Procedures in Ill-Posed Problems [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  11. A. V. Goncharskii, A. S. Leonov, and A. G. Yagola, “Finite-difference approximation of linear ill-posed problems,”Zh. Vychisl. Mat. Mat. Fiz. 14, No. 1, 15–24 (1974).

    Google Scholar 

  12. W. Dahmen, A. Kunoth, and R. Schneider, “Operator equations, multiscale concepts and complexity,”Lect. Appl. Math.,32, 225–261 (1996).

    MathSciNet  Google Scholar 

  13. K. I. Babenko, “On the approximation of periodic functions of many variables by trigonometric polynomials,”Dokl. Akad. Nauk SSSR,132, No. 2, 247–250 (1960).

    Google Scholar 

  14. A. B. Bakushinskii, “A general procedure for the construction of regularizing algorithms for a linear ill-posed equation in a Hilbert space,”Zh. Vychisl. Mat. Mat. Fiz.,7, No. 3, 672–677 (1967).

    MathSciNet  Google Scholar 

Download references

Authors
  1. S. G. Solodkii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Institute of Mathematics, Ukrainian Academy of Sciences, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 10, pp. 1398–1410, October, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solodkii, S.G. Optimization of projection schemes of digitization of ill-posed problems. Ukr Math J 51, 1578–1591 (1999). https://doi.org/10.1007/BF02981690

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation