Topological derivatives for networks of elastic strings
Résumé
We consider second order problems on metric graphs under given boundary and nodal conditions. We consider the problem of changing the topology of the underlying graph in that we replace a multiple node by an imported subgraph, or, in reverse, concentrate a subgraph to a single node or delete or add edges, respectively. We wish to do so in some optimal fashion. More precisely, given a cost function we may look at such operations in order to find an optimal topology of the graph. Thus, finally we are looking into the topological gradient of an elliptic problem on a graph.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...