On elimination of accuracy saturation of regularizing algorithms
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 11 (2008) no. 2, pp. 167-186
Voir la notice de l'article provenant de la source Math-Net.Ru
A general approach to modification of well-known methods for the solution of linear ill-posed problems is proposed. The approach enables us to exclude a possible “saturation of accuracy” of methods on classes of sourcewise representable solutions. As a result, the modified methods possess the optimal order of accuracy on each of these classes. Numerical examples for the solution of 1D and 2D inverse problems are presented.
@article{SJVM_2008_11_2_a4,
author = {A. S. Leonov},
title = {On elimination of accuracy saturation of regularizing algorithms},
journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
pages = {167--186},
publisher = {mathdoc},
volume = {11},
number = {2},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SJVM_2008_11_2_a4/}
}
A. S. Leonov. On elimination of accuracy saturation of regularizing algorithms. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 11 (2008) no. 2, pp. 167-186. http://geodesic.mathdoc.fr/item/SJVM_2008_11_2_a4/