On the Reconstruction of a String from Spectral Data
โ Scribed by Matthias Weber
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 865 KB
- Volume
- 197
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
We consider the problem to reconstruct the mass distribution of a string where the mass is concentrated in a finite number of points, or, equivalently, the problem to reconstruct a simply connected mass spring system with unknown masses and stiffness parameters if the following data are given.
Problem 1: The spectra of the string and of a modification of the string, or.
Problem 2: The spectra of two different modifications of the string.
Here a modification of the string is a string which appears if we link the unknown string with another string of known mass distribution.
The paper contains a necessary condition for the existence of a solution of Problem 1, and explicit formulas and an algorithm for the solutions of the Problems 1 and 2 under the condition that there exists a solution.
For the case that the mass distribution of the unknown string is not discrete we consider the problem to find discrete approximations of this distribution from the respective spectral data.
The methods are based on the spectral theory of generalized second order differential operators as developed by M. G. Krein
๐ SIMILAR VOLUMES
Simple, new, direct methods are derived for constructing real, symmetric, bordered-diagonal and tridiagonaf matrices from their eigenvalues and the eigenvalues of any one of their principal submatrices. A direct method is also presented for constructing, from its eigenvalues, a real tridiagonaf mat