Leugering G (2000)
Publication Language: English
Publication Status: Published
Publication Type: Journal article, Original article
Publication year: 2000
Publisher: Elsevier
Book Volume: 120
Pages Range: 133-157
Journal Issue: 1-2
URI: http://www.sciencedirect.com/science/article/pii/S0377042700003071
DOI: 10.1016/S0377-0427(00)00307-1
We consider a star-graph as an examplary network, with elastic strings stretched along the edges. The network is allowed to perform out-of-the plane displacements. We consider such networks as being controlled at its simple nodes via Dirichlet conditions. The objective is to steer given initial data to final target data in a given time T with minimal control costs. This problem is discussed in the continuous as well as in the discrete case. We discuss an iterative domain decomposition technique and its discrete analogue. We prove convergence and show some numerical results. (C) 2000 Elsevier Science B.V. All rights reserved.
APA:
Leugering, G. (2000). On the semi-discretization of optimal control problems for networks of elastic strings: global optimality systems and domain decomposition. Journal of Computational and Applied Mathematics, 120(1-2), 133-157. https://dx.doi.org/10.1016/S0377-0427(00)00307-1
MLA:
Leugering, Günter. "On the semi-discretization of optimal control problems for networks of elastic strings: global optimality systems and domain decomposition." Journal of Computational and Applied Mathematics 120.1-2 (2000): 133-157.
BibTeX: Download