Multiscale analysis for ill-posed problems with semi-discrete Tikhonov regularization (Q2898435)

From MaRDI portal





scientific article; zbMATH DE number 6054457
Language Label Description Also known as
default for all languages
No label defined
    English
    Multiscale analysis for ill-posed problems with semi-discrete Tikhonov regularization
    scientific article; zbMATH DE number 6054457

      Statements

      Multiscale analysis for ill-posed problems with semi-discrete Tikhonov regularization (English)
      0 references
      0 references
      0 references
      0 references
      11 July 2012
      0 references
      linear ill-posed problems
      0 references
      Tikhonov regularization
      0 references
      Sobolev functions
      0 references
      multiscale analysis
      0 references
      moderate ill-posedness
      0 references
      discrete noisy data
      0 references
      ill-posed linear operator equations
      0 references
      Hilbert space
      0 references
      Morozov's discrepancy principle
      0 references
      error estimates
      0 references
      linear inverse problem
      0 references
      integral operator
      0 references
      algorithm
      0 references
      numerical examples
      0 references
      \textit{H. Wendland}'s results [Numer. Math. 116, No. 3, 493--517 (2010; Zbl 1208.65067)] on multiscale analysis in Sobolev spaces on bounded domains can be applied to the interpretation of indirect measurements when the available data are discrete and noisy. In this context, compactly supported radial basis functions of varying radii are exploited. The present paper deals with the application of the theory from Wendland's paper to the stable approximate solution of ill-posed linear operator equations \(Af=g\) in a Hilbert space setting by a semi-discrete version of Tikhonov's regularization method. In particular, an a posteriori choice of the regularization parameter based on Morozov's discrepancy principle with corresponding error estimates for noisy data is included in the discussion. The authors have in mind linear inverse problems, where the (mostly compact) forward operator \(A\) has the structure of an integral operator NEWLINE\[NEWLINE[Af](x)=\int \limits _\Omega k(x,t) f(t) dt NEWLINE\]NEWLINE over a bounded domain \(\Omega \subset \mathbb{R}^k,\;k=1,2,\dots\). The developed theory and algorithm suppose that the problem is moderately ill-posed, which means here that there are constants \(0<\underline c \leq \overline c<\infty\) such that NEWLINE\[NEWLINE\underline c\,\|f\|_{H^\theta(\Omega)} \leq \|Af\|_{H^{\theta+a}(\Omega)} \leq \overline c\,\|f\|_{H^\theta(\Omega)} NEWLINE\]NEWLINE is valid for all \(f \in H^\theta(\Omega)\) and some \(\theta \in \mathbb{R}\). The constant \(a>0\) represents the degree of ill-posedness of the problem and is finite. Some numerical examples with the simple integration operator as \(A\) on \(\Omega=[0,2] \subset \mathbb{R}\) and two different exact solutions \(f\) illustrate the approach and associated ingredients like reproducing kernel Hilbert spaces, discretization schemes and error behavior.
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references