RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2008 Volume 11, Number 2, Pages 167–186 (Mi sjvm41)

This article is cited in 6 papers

On elimination of accuracy saturation of regularizing algorithms

A. S. Leonov

Moscow Engineering Physics Institute

Abstract: 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.

Key words: ill-posed problems, accuracy saturation, soursewise represented solutions.

UDC: 519.6

Received: 27.02.2007


 English version:
Numerical Analysis and Applications, 2008, 1:2, 135–150


© Steklov Math. Inst. of RAS, 2026