Kolmogorov $n$-widths for linear dynamical systems

Abstract

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.

S. Adv Comput Math (2019)

Cited by in corpus (10)

• Quadratic Approximation Manifold for Mitigating the Kolmogorov Barrier in Nonlinear Projection-Based Model Order Reduction
• Lagrangian PINNs: A causality-conforming solution to failure modes of physics-informed neural networks
• Projection-Based Model Reduction with Dynamically Transformed Modes
• Predicting waves in fluids with deep neural network
• Manifold Approximations via Transported Subspaces: Model reduction for transport-dominated problems
• Efficient Wildland Fire Simulation via Nonlinear Model Order Reduction
• Low-dimensional Data-based Surrogate Model of a Continuum-mechanical Musculoskeletal System Based on Non-intrusive Model Order Reduction
• From Time-Domain Data to Low-Dimensional Structured Models
• Decomposition of flow data via gradient-based transport optimization
• Estimates of the Kolmogorov n-width for nonlinear transformations with application to distributed-parameter control systems