Abstract
The identifiability (i.e. the unique identification) of conductivity in a heat conduction process is considered in the class of piecewise constant conductivities. The 1-D process may have nonzero boundary inputs as well as distributed inputs. Its measurements are collected at finitely many observation points. They are processed to obtain the first eigenvalue and a constant multiple of the first eigenfunction at the observation points. It is shown that the identification by the Marching Algorithm is continuous with respect to the mean convergence in the admissible set. The result is based on the continuous dependence of eigenvalues, eigenfunctions, and the solutions on the conductivities. Numerical experiments confirm the perfect identification for noiseless data. A numerical algorithm for the identification in the presence of noise is proposed and implemented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
