Best approximation, Tikhonov regularization and reproducing kernels (Q2574400): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q278004
Property / reviewed by
 
Property / reviewed by: Bernd Hofmann / rank
Normal rank
 

Revision as of 16:27, 12 February 2024

scientific article
Language Label Description Also known as
English
Best approximation, Tikhonov regularization and reproducing kernels
scientific article

    Statements

    Best approximation, Tikhonov regularization and reproducing kernels (English)
    0 references
    0 references
    21 November 2005
    0 references
    This paper deals with approximation theory in reproducing kernel Hilbert spaces (RKHS) \(H_K\) admitting a reproducing kernel \(K(p,q)\) on some set \(E\). In particular, it yields some contributions to the analysis of least-squares solutions for linear operator equations \(Lf=d\), where \(L:H_K \to {\mathcal H}\) is a bounded linear operator mapping from the RKHS \(H_K\) to some Hilbert space \({\mathcal H}\). Problems of interest are such that the Moore-Penrose inverse of \(L\) is unbounded, i.e., linear ill-posed problems. Then instead of the conventional least-squares solution penalized least-squares problems are considered. This approach is known as Tikhonov regularization in inverse problems theory. Some error and stability results are given for the Tikhonov regularization in RKHS. Specific results are formulated if the operator \(LL^*\) is unitary and moreover if \(L\) is compact.
    0 references
    reproducing kernel Hilbert space
    0 references
    Tikhonov regulariztaion
    0 references
    best approximation
    0 references
    error bounds
    0 references
    least-squares solutions
    0 references
    linear operator equations
    0 references
    Moore-Penrose inverse
    0 references
    linear ill-posed problems
    0 references
    inverse problems
    0 references
    stability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references