Boundary Controllability and Inverse Problem for the Wave Equation on Graphs

Sergei Anatol'evich Avdonin, Karlygash Nurtazina, T. Sheronova

2006

Closed access Metadata (CSL-JSON)
DOI 10.1109/med.2006.235994
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We study the boundary control problem for the wave equation on a planar graph. We suppose that the graph is a tree (i.e., it does not contain cycles), and on each edge a string equation (with a variable density) is given. The control is acting through the Dirichlet boundary conditions applied to the exterior vertices. The exact controllability is proved and a sharp estimate of the time of controllability is obtained. We prove also that the densities of the edges are uniquely determined by the Dirichlet-to-Neumann map given at all except one boundary vertices