Abstract
Understanding how to optimally approximate general compact sets using finite-dimensional spaces is of central interest for designing efficient numerical methods in forward simulation or inverse problems. The concept of n-width, introduced in 1936 by Kolmogorov, is well suited to linear approximation methods. Interest in n-width has recently been revived by the approximation of parametrized/stochastic PDEs and the development of reduced basis methods. We briefly review some now-classical results.
We then focus on analogous concepts for nonlinear approximation that remain the subject of current research, driven in particular by the development of neural networks and potential applications to hyperbolic parametrized PDEs for which linear methods are ineffective. We discuss a general framework that encompasses various concepts of linear and nonlinear widths, and present some recent results and relevant open problems within this framework.