# Model Reduction by Moment Matching for Linear Switched Systems

arXiv: https://arxiv.org/abs/1403.1734 · HTML: https://mlsanity.com/paper/1403.1734/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Mar 2014.

## Built on by (most cited first, 1 of 1)

- [A finite-sample bound for identifying partially observed linear switched systems from a single trajectory](https://mlsanity.com/paper/2503.13766/) (2025)

## Abstract (arXiv)

Two moment-matching methods for model reduction of linear switched systems (LSSs) are presented. The methods are similar to the Krylov subspace methods used for moment matching for linear systems. The more general one of the two methods, is based on the so called "nice selection" of some vectors in the reachability or observability space of the LSS. The underlying theory is closely related to the (partial) realization theory of LSSs. In this paper, the connection of the methods to the realization theory of LSSs is provided, and algorithms are developed for the purpose of model reduction. Conditions for applicability of the methods for model reduction are stated and finally the results are illustrated on numerical examples.