Journal of Inverse and Ill-posed Problems
Editor-in-Chief: Kabanikhin, Sergey I.
6 Issues per year
IMPACT FACTOR 2016: 0.783
5-year IMPACT FACTOR: 0.792
CiteScore 2016: 0.80
SCImago Journal Rank (SJR) 2016: 0.589
Source Normalized Impact per Paper (SNIP) 2016: 1.125
Mathematical Citation Quotient (MCQ) 2015: 0.43
Why a minimizer of the Tikhonov functional is closer to the exact solution than the first guess
Suppose that a uniqueness theorem is valid for an ill-posed problem. It is shown then that the distance between the exact solution and terms of a minimizing sequence of the Tikhonov functional is less than the distance between the exact solution and the first guess. Unlike the classical case when the regularization parameter tends to zero, only a single value of this parameter is used. Indeed, the latter is always the case in computations. Next, this result is applied to a specific coefficient inverse problem. A uniqueness theorem for this problem is based on the method of Carleman estimates. In particular, the importance of obtaining an accurate first approximation for the correct solution follows from Theorems 7 and 8. The latter points towards the importance of the development of globally convergent numerical methods as opposed to conventional locally convergent ones. A numerical example is presented.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.