Controllability of tree-shaped networks of vibrating strings

27Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a tree-shaped network of vibrating strings. The problem of controllability when the control acts on the root of the tree is analyzed. We give a necessary and sufficient condition for the approximate controllability of the system in time 2(ℓ1++ℓM), where ℓ1,...,ℓM denote the lengths of the strings of the network. This is a non-degeneracy condition guaranteeing that the spectra of any two subtrees of the network connected at a multiple node are mutually disjoint. © 2001 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS.

Cite

CITATION STYLE

APA

Dáger, R., & Zuazua, E. (2001). Controllability of tree-shaped networks of vibrating strings. Comptes Rendus de l’Academie Des Sciences - Series I: Mathematics, 332(12), 1087–1092. https://doi.org/10.1016/S0764-4442(01)01942-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free