Identifiability for Composite String Vibration Problem

Abstract

Abstract. 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.