A Regularization Approach for an Inverse Source Problem in Elliptic Systems from Single Cauchy Data

In this article, we investigate the problem of identifying the source term f in the elliptic system from a single noisy measurement couple of the Neumann and Dirichlet data (j, g) with noise level In this context, the diffusion matrix Q is given. A variational method of Tikhonov-type regularization...

Full description

Saved in:
Bibliographic Details
Published inNumerical functional analysis and optimization Vol. 40; no. 9; pp. 1080 - 1112
Main Authors Hinze, Michael, Hofmann, Bernd, Quyen, Tran Nhan Tam
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 04.07.2019
Taylor & Francis Ltd
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this article, we investigate the problem of identifying the source term f in the elliptic system from a single noisy measurement couple of the Neumann and Dirichlet data (j, g) with noise level In this context, the diffusion matrix Q is given. A variational method of Tikhonov-type regularization with specific misfit term of Kohn-Vogelius-type and quadratic stabilizing penalty term is suggested to tackle this linear inverse problem. The method also appears as a variant of the Lavrentiev regularization. For the occurring linear inverse problem in infinite dimensional Hilbert spaces, convergence and rate results can be found from the general theory of classical Tikhonov and Lavrentiev regularization. Using the variational discretization concept, where the PDE is discretized with piecewise linear and continuous finite elements, we show the convergence of finite element approximations to a sought source function. Moreover, we derive an error bound and corresponding convergence rates provided a suitable range-type source condition is satisfied. For the numerical solution, we propose a conjugate gradient method. To illustrate the theoretical results, a numerical case study is presented which supports our analytical findings.
ISSN:0163-0563
1532-2467
DOI:10.1080/01630563.2019.1596953