The iterated regularization with perturbed operators and noisy data (Q1344600)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 722359
Language Label Description Also known as
default for all languages
No label defined
    English
    The iterated regularization with perturbed operators and noisy data
    scientific article; zbMATH DE number 722359

      Statements

      The iterated regularization with perturbed operators and noisy data (English)
      0 references
      15 October 1995
      0 references
      The method of iterated Tikhonov regularization with perturbed operators and noisy data for solving operator equations of the type \(Tx= y\) in Hilbert spaces is investigated. A crucial problem in Tikhonov's regularization is the choice of the regularization parameter in dependence on the noise. If \(T\) is exactly known Tikhonov's regularization done by \textit{J. T. King} and \textit{D. Chillingworth} [Numer. Funct. Anal. Optimization 1, 499-513 (1979; Zbl 0446.65026)] and Arcangeli's method proposed by \textit{H. W. Engl} and \textit{A. Neubauer} [Notes Rep. Math. Sci. Eng. 4, 97-125 (1987; Zbl 0627.65060)] lead to an optimal convergence rate. This paper is to provide an a posteriori parameter choice and a higher asymptotic convergence rate for the iterated Tikhonov regularization by using a generalized Arcangeli method. Convergence rates are estimated.
      0 references
      Moore-Penrose inverse
      0 references
      ill-posed problem
      0 references
      method of iterated Tikhonov regularization
      0 references
      perturbed operators
      0 references
      noisy data
      0 references
      Hilbert spaces
      0 references
      choice of the regularization parameter
      0 references
      Arcangeli's method
      0 references
      optimal convergence
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references