Complexity Reduction for Parameter-Dependent Linear Systems
Systems and Control
2012-09-25 v1 Optimization and Control
Abstract
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with fewer parameters or state variables. To do so, it minimizes the distance (i.e., H-infinity-norm of the difference) between the original system and its reduced version. We present a sub-optimal solution to this problem using sum-of-squares optimization methods. We present the results for both continuous-time and discrete-time systems. Lastly, we illustrate the applicability of our proposed algorithm on numerical examples.
Cite
@article{arxiv.1209.5077,
title = {Complexity Reduction for Parameter-Dependent Linear Systems},
author = {Farhad Farokhi and Henrik Sandberg and Karl H. Johansson},
journal= {arXiv preprint arXiv:1209.5077},
year = {2012}
}