IDENTIFIABILITY FOR COMPOSITE STRING VIBRATION PROBLEM

The paper considers the identifiability (i.e., the unique identification) of a composite string in the class of piecewise constant parameters. The 1-D string vibration is measured at finitely many observation points. The observations are processed to obtain the first eigenvalue and a constant multip...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Korean Mathematical Society Vol. 47; no. 5; pp. 1077 - 1095
Main Authors Gutman, Semion, Ha, Jun-Hong
Format Journal Article
LanguageKorean
Published 2010
Subjects
identification
identifiability
string vibration
piecewise constant parameters
Online AccessGet full text

Cover

More Information
Summary:The paper considers the identifiability (i.e., the unique identification) of a composite string in the class of piecewise constant parameters. The 1-D string vibration is measured at finitely many observation points. The observations 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 parameters. A numerical algorithm for the identification in the presence of noise is proposed and implemented.
Bibliography:KISTI1.1003/JNL.JAKO201025240675046
ISSN:0304-9914