Abstract
We consider solving of linear ill-posed problems using the Tikhonov method (in self-adjoint case the Lavrentiev method), its iterated variant, Landweber method and conjugate gradient type methods. Several rules for a posteriori choice of the regularization parameter are proposed. In case of known noise level of data we propose to compute in Tikhonov method certain 2 parameters and take for regularization parameter minimal of them. In case of unknown noise level we consider family of rules where a certain function is minimized. The quasioptimality criterion and Hanke-Raus rule are included, error estimates are given. Extensive numerical experiments show an advantage of proposed rules over known rules.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
