# Kolmogorov n-widths for linear dynamical systems

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

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Jun 2018.

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

- [Lagrangian PINNs: A causality-conforming solution to failure modes of physics-informed neural networks](https://mlsanity.com/paper/2205.02902/) (2022)
- [Predicting waves in fluids with deep neural network](https://mlsanity.com/paper/2201.06628/) (2022)
- [Low-dimensional Data-based Surrogate Model of a Continuum-mechanical Musculoskeletal System Based on Non-intrusive Model Order Reduction](https://mlsanity.com/paper/2302.06528/) (2023)
- [Multi-Hierarchical Surrogate Learning for Structural Dynamical Crash Simulations Using Graph Convolutional Neural Networks](https://mlsanity.com/paper/2402.09234/) (2024)
- [Leveraging time and parameters for nonlinear model reduction methods](https://mlsanity.com/paper/2501.03853/) (2025)
- [Nonlinear model reduction for transport-dominated problems](https://mlsanity.com/paper/2602.01397/) (2026)
- [Combined space-time reduced-order model with 3D deep convolution for extrapolating fluid dynamics](https://mlsanity.com/paper/2211.00307/) (2022)

## Abstract (arXiv)

Kolmogorov n-widths and Hankel singular values are two commonly used concepts in model reduction. Here we show that for the special case of linear time-invariant dynamical (LTI) systems, these two concepts are directly connected. More specifically, the greedy search applied to the Hankel operator of an LTI system resembles the minimizing subspace for the Kolmogorov n-width and the Kolmogorov n-width of an LTI system equals its (n+1)st Hankel singular value once the subspaces are appropriately defined. We also establish a lower bound for the Kolmorogov n-width for parametric LTI systems and illustrate that the method of active subspaces can be viewed as the dual concept to the minimizing subspace for the Kolmogorov n-width.