TY - JOUR

T1 - Adjoint-weighted variational formulation for a direct computational solution of an inverse heat conduction problem

AU - Barbone, Paul E.

AU - Oberai, Assad A.

AU - Harari, Isaac

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We consider the direct (i.e. non-iterative) solution of the inverse problem of heat conduction for which at least two interior temperature fields are available. The strong form of the problem for the single, unknown, thermal conductivity field is governed by two partial differential equations of pure advective transport. The given temperature fields must satisfy a compatibility condition for the problem to have a solution. We introduce a novel variational formulation, the adjoint-weighted equation (AWE), for solving the two-field problem. In this case, the gradients of two given temperature fields must be linearly independent in the entire domain, a weaker condition than the compatibility required by the strong form. We show that the solution of the AWE formulation is equivalent to that of the strong form when both are well posed. We prove that the Galerkin discretization of the AWE formulation leads to a stable, convergent numerical method that has optimal rates of convergence. We show computational examples that confirm these optimal rates. The AWE formulation shows good numerical performance on problems with both smooth and rough coefficients and solutions.

AB - We consider the direct (i.e. non-iterative) solution of the inverse problem of heat conduction for which at least two interior temperature fields are available. The strong form of the problem for the single, unknown, thermal conductivity field is governed by two partial differential equations of pure advective transport. The given temperature fields must satisfy a compatibility condition for the problem to have a solution. We introduce a novel variational formulation, the adjoint-weighted equation (AWE), for solving the two-field problem. In this case, the gradients of two given temperature fields must be linearly independent in the entire domain, a weaker condition than the compatibility required by the strong form. We show that the solution of the AWE formulation is equivalent to that of the strong form when both are well posed. We prove that the Galerkin discretization of the AWE formulation leads to a stable, convergent numerical method that has optimal rates of convergence. We show computational examples that confirm these optimal rates. The AWE formulation shows good numerical performance on problems with both smooth and rough coefficients and solutions.

UR - http://www.scopus.com/inward/record.url?scp=36749087742&partnerID=8YFLogxK

U2 - 10.1088/0266-5611/23/6/003

DO - 10.1088/0266-5611/23/6/003

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:36749087742

VL - 23

SP - 2325

EP - 2342

JO - Inverse Problems

JF - Inverse Problems

SN - 0266-5611

IS - 6

ER -