Model Reduction for Switched Linear Systems via Generalized Lyapunov Equations

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Manucci, Mattia, Unger, Benjamin
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909044997881856
author Manucci, Mattia
Unger, Benjamin
author_facet Manucci, Mattia
Unger, Benjamin
contents In this work, we study projection-based model order reduction (MOR) for switched linear systems (SLS) in control form, where the projection matrices are obtained from the solutions of generalized Lyapunov equations (GLEs). We investigate how numerical inaccuracies in solving the GLEs propagate through the MOR process and impact the accuracy and reliability of the resulting reduced-order model. This highlights the importance of accounting for such inaccuracies, motivating the introduction of a novel error bound to quantify and control the error in the approximation of the GLE solution. Moreover, classical balanced truncation error estimates for SLS are neither theoretically sound nor practically applicable, as they rely on restrictive assumptions requiring several linear matrix inequalities (LMIs) to be satisfied exactly by numerically computed GLE solutions. To address these limitations, we propose a new MOR framework for SLS, termed piecewise balanced reduction (PBR). The approach is based on solving multiple GLEs and constructing projection matrices that are piecewise constant in time. By extending the standard balanced truncation error bound for SLS, we show that the PBR framework effectively controls errors arising from inexact LMI satisfaction. In addition, the proposed error bound captures the influence of the piecewise constant in time projection matrices. Altogether, this makes the PBR approach applicable to a broad and flexible class of switched linear systems. Numerical experiments are presented to support the theoretical results.
format Preprint
id arxiv_https___arxiv_org_abs_2601_13039
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Model Reduction for Switched Linear Systems via Generalized Lyapunov Equations
Manucci, Mattia
Unger, Benjamin
Numerical Analysis
65F45, 65F55, 65P99, 93A30, 93A15, 93B99
In this work, we study projection-based model order reduction (MOR) for switched linear systems (SLS) in control form, where the projection matrices are obtained from the solutions of generalized Lyapunov equations (GLEs). We investigate how numerical inaccuracies in solving the GLEs propagate through the MOR process and impact the accuracy and reliability of the resulting reduced-order model. This highlights the importance of accounting for such inaccuracies, motivating the introduction of a novel error bound to quantify and control the error in the approximation of the GLE solution. Moreover, classical balanced truncation error estimates for SLS are neither theoretically sound nor practically applicable, as they rely on restrictive assumptions requiring several linear matrix inequalities (LMIs) to be satisfied exactly by numerically computed GLE solutions. To address these limitations, we propose a new MOR framework for SLS, termed piecewise balanced reduction (PBR). The approach is based on solving multiple GLEs and constructing projection matrices that are piecewise constant in time. By extending the standard balanced truncation error bound for SLS, we show that the PBR framework effectively controls errors arising from inexact LMI satisfaction. In addition, the proposed error bound captures the influence of the piecewise constant in time projection matrices. Altogether, this makes the PBR approach applicable to a broad and flexible class of switched linear systems. Numerical experiments are presented to support the theoretical results.
title Model Reduction for Switched Linear Systems via Generalized Lyapunov Equations
topic Numerical Analysis
65F45, 65F55, 65P99, 93A30, 93A15, 93B99
url https://arxiv.org/abs/2601.13039