Model reduction for linear switched systems with autonomous switching

Mihaly Petreczky, John-Josef Leth, Rasmus Pedersen, Rafal Wisniewski

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

1 Citation (Scopus)


This paper proposes a model reduction algorithm for linear switched systems in continuous-time with autonomous switching. An analytic upper bound on the difference between the responses of the original and the reduced order models is derived. The model reduction algorithm is based on the extension of the idea of balanced truncation. The error bound is a direct extension of the one known for linear systems, and it depends on the singular values of the grammians. The class of linear switched systems considered in this paper includes the well-known class of piecewise-linear systems.

Original languageEnglish
Title of host publication2021 American Control Conference (ACC)
Number of pages7
Publication date28 May 2021
Article number9483120
ISBN (Print)978-1-7281-9704-3
ISBN (Electronic)978-1-6654-4197-1
Publication statusPublished - 28 May 2021
Event2021 American Control Conference (ACC) - New Orleans, United States
Duration: 25 May 202128 May 2021


Conference2021 American Control Conference (ACC)
Country/TerritoryUnited States
CityNew Orleans
SeriesAmerican Control Conference


Dive into the research topics of 'Model reduction for linear switched systems with autonomous switching'. Together they form a unique fingerprint.

Cite this