Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Determination of a spacewise dependent heat source
Journal of Computational and Applied Mathematics
Mathematics and Computers in Simulation
Source term identification in 1-D IHCP
Computers & Mathematics with Applications
Inverse problem of time-dependent heat sources numerical reconstruction
Mathematics and Computers in Simulation
Determination of a source in the heat equation from integral observations
Journal of Computational and Applied Mathematics
Hi-index | 0.09 |
The inverse problem of identifying the unknown time-dependent heat source H(t) of the variable coefficient heat equation u"t=(k(x)u"x)"x+F(x)H(t), with separable sources of the form F(x)H(t), from supplementary temperature measurement h(t)@?u(0,t) at the left end of the rod, is investigated. The Fourier method is employed to illustrate the comparison of spacewise (F(x)) and time-dependent (H(t) heat source identification problems. An explicit formula for the Frechet gradient of the cost functional J(H)=@?u(0,@?;H)-h@?"L"""2"("0","T"""f")^2 is derived via the unique solution of the appropriate adjoint problem. The Conjugate Gradient Algorithm, based on the gradient formula for the cost functional, is then proposed for numerical solution of the inverse source problem. The algorithm is examined through numerical examples related to reconstruction of continuous and discontinuous heat sources H(t), when heat is transferred through non-homogeneous as well as composite structures. Numerical analysis of the algorithm applied to the inverse source problem in typical classes of source functions is presented. Computational results, obtained for random noisy output data, show how the iteration number of the Conjugate Gradient Algorithm can be estimated. Based on these results it is shown that this iteration number plays a role of a regularization parameter. Numerical results illustrate bounds of applicability of the proposed algorithm, and also its efficiency and accuracy.