Dynamic domain decomposition of optimal control problems for networks of strings and Timoshenko beams

Leugering G (1999)


Publication Language: English

Publication Status: Published

Publication Type: Journal article, Original article

Publication year: 1999

Journal

Publisher: Society for Industrial and Applied Mathematics

Book Volume: 37

Pages Range: 1649-1675

Journal Issue: 6

URI: http://epubs.siam.org/doi/abs/10.1137/S0363012997331986

DOI: 10.1137/S0363012997331986

Abstract

We consider general networks of strings and/or Timoshenko beams. We apply controls at boundary nodes of the network and want to minimize some cost function along (part of) the structure. Optimality systems for the entire structure are far too complex to compute in reasonable time. In particular, in real-time applications one wants to reduce the size of the problem. Thus, dynamic decomposition into its physical elements appears to be a natural approach. We show how to iteratively decompose the global optimality system into a system related to a substructure. Then we interpret the local system as an optimality system corresponding to an optimal control problem for the substructure and finally we show convergence of the "outer" iteration.

Authors with CRIS profile

How to cite

APA:

Leugering, G. (1999). Dynamic domain decomposition of optimal control problems for networks of strings and Timoshenko beams. SIAM Journal on Control and Optimization, 37(6), 1649-1675. https://doi.org/10.1137/S0363012997331986

MLA:

Leugering, Günter. "Dynamic domain decomposition of optimal control problems for networks of strings and Timoshenko beams." SIAM Journal on Control and Optimization 37.6 (1999): 1649-1675.

BibTeX: Download