Topological sensitivity analysis for elliptic problems on graphs

Abstract : We consider elliptic problems on graphs under given loads and bilateral contact conditions. We ask the question which graph is best suited to sustain the loads and the constraints. More precisely, given a cost function we may look at a multiple node of the graph with edge degree $N$ and ask as to whether that node should be resolved into a number of node of edge degree 3, in order to decrease the cost. Thus, we are looking into the sensitivity of a graph carrying an elliptic problem with respect to changing the topology of the graph by releasing nodes with high edge degree. In order words, we are looking into the topological gradient of an elliptic problem on a graph.
Document type :
Preprints, Working Papers, ...

Cited literature [13 references]

https://hal.archives-ouvertes.fr/hal-00261861
Contributor : Jan Sokolowski <>
Submitted on : Monday, March 10, 2008 - 11:33:49 AM
Last modification on : Tuesday, April 24, 2018 - 1:36:32 PM
Long-term archiving on : Thursday, May 20, 2010 - 8:48:05 PM

File

2008-13.pdf
Files produced by the author(s)

Identifiers

• HAL Id : hal-00261861, version 1

Citation

Günter Leugering, Jan Sokolowski. Topological sensitivity analysis for elliptic problems on graphs. 2008. ⟨hal-00261861⟩

Record views