Please use this identifier to cite or link to this item:
Bissantz, Nicolai
Hohage, T.
Munk, Axel
Ruymgaart, F.
Year of Publication: 
Series/Report no.: 
Technical Report // Sonderforschungsbereich 475, Komplexitätsreduktion in Multivariaten Datenstrukturen, Universität Dortmund 2007,04
During the past the convergence analysis for linear statistical inverse problems has mainly focused on spectral cut-off and Tikhonov type estimators. Spectral cut-off estimators achieve minimax rates for a broad range of smoothness classes and operators, but their practical usefulness is limited by the fact that they require a complete spectral decomposition of the operator. Tikhonov estimators are simpler to compute, but still involve the inversion of an operator and achieve minimax rates only in restricted smoothness classes. In this paper we introduce a unifying technique to study the mean square error of a large class of regularization methods (spectral methods) including the aforementioned estimators as well as many iterative methods, such as í-methods and the Landweber iteration. The latter estimators converge at the same rate as spectral cut-off, but only require matrixvector products. Our results are applied to various problems, in particular we obtain precise convergence rates for satellite gradiometry, L2-boosting, and errors in variable problems.
Statistical inverse problems
iterative regularization methods
Tikhonov regularization
nonparametric regression
minimax convergence rates
satellite gradiometry
Hilbert scales
errors in variable
Document Type: 
Working Paper

Files in This Item:
311.29 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.