DMCA
ON THE GENERALIZED DISCREPANCY PRINCIPLE FOR TIKHONOV REGULARIZATION IN HILBERT SCALES
Cached
Download Links
| Citations: | 1 - 1 self |
BibTeX
@MISC{Lu_onthe,
author = {S. Lu and S. V. Pereverzev and Y. Shao and U. Tautenhahn and Dedicated Charles and W. Groetsch},
title = {ON THE GENERALIZED DISCREPANCY PRINCIPLE FOR TIKHONOV REGULARIZATION IN HILBERT SCALES},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. For solving linear ill-posed problems regularization methods are required when the right hand side and the operator are with some noise. In the present paper regularized solutions are obtained by Tikhonov regularization in Hilbert scales and the regularization parameter is chosen by the generalized discrepancy principle. Under certain smoothness assumptions we provide order optimal error bounds that characterize the accuracy of the regularized solution. It appears that for getting small error bounds a proper scaling of the penalizing operator B is required. For the computation of the regularization parameter fast algorithms of Newton type are constructed which are based on special transformations. These algorithms are globally and monotonically convergent. The results extend earlier results where the problem operator is exactly given. Some of our theoretical results are illustrated by numerical experiments. 1.
Keyphrases
regularization parameter right hand side generalized discrepancy principle numerical experiment penalizing operator proper scaling certain smoothness assumption linear ill-posed problem regularization method special transformation order optimal error newton type hilbert scale small error theoretical result present paper problem operator tikhonov regularization regularized solution
