Comparative analysis of inverse coefficient problems for parabolic equations. Part II: Coarse-fine grid algorithm

2011

Closed access Metadata (CSL-JSON)
DOI 10.1080/17415977.2011.579606
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This article presents a computational analysis of the adjoint problem approach for parabolic inverse coefficient problems based on boundary measured data. The proposed coarse-fine grid algorithm constructed on the basis of this approach is an effective computational tool for the numerical solution of inverse coefficient problems with various Neumann or/and Dirichlet type measured output data. In the previous Part I paper it was shown that the ill-posedness also depends on where Neumann and Dirichlet conditions are given: in the direct problem or as an output data. Based on integral identities relating solutions of direct problems to appropriate adjoint problems solutions, a coarse-fine grid algorithm for parabolic coefficient identification problems is constructed. It is shown that use of a coarse grid for the interpolation of the unknown coefficient and a fine grid for the numerical solution of the well-posed forward and backward parabolic problems guarantees an optimal compromise between the accuracy and stability in numerically solving the inverse problems. The efficiency and applicability of this method is demonstrated on various numerical examples with noisy free and noisy data.