Topological sensitivity analysis for elliptic problems on graphs
Leugering G, Sokolowski J (2008)
Publication Language: English
Publication Status: Published
Publication Type: Journal article, Original article
Publication year: 2008
Journal
Publisher: Polish Academy of Sciences
Book Volume: 37
Pages Range: 971-997
Journal Issue: 4
URI: https://hal.archives-ouvertes.fr/hal-00261861/
Open Access Link: https://hal.archives-ouvertes.fr/hal-00261861/document
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 q and ask as to whether that node should be resolved into a number of nodes of edge degree less than q, in order to decrease the cost. With this question in mind, we are looking into the sensitivity analysis of a graph carrying a second order elliptic equation with respect to changing its topology by releasing nodes with high edge degree or including an edge. With the machinery at hand developed here, we are in the position to define the topological gradient of an elliptic problem on a graph.
Authors with CRIS profile
Involved external institutions
France (FR)How to cite
APA:
Leugering, G., & Sokolowski, J. (2008). Topological sensitivity analysis for elliptic problems on graphs. Control and Cybernetics, 37(4), 971-997.
MLA:
Leugering, Günter, and Jan Sokolowski. "Topological sensitivity analysis for elliptic problems on graphs." Control and Cybernetics 37.4 (2008): 971-997.
BibTeX: Download