Papers › The Kolmogorov N-width for linear transport: Exact representation and the influence of the data
The Kolmogorov N-width for linear transport: Exact representation and the influence of the data
Florian Arbes, Constantin Greif, Karsten Urban
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Kolmogorov N-width describes the best possible error one can achieve by elements of an N-dimensional linear space. Its decay has extensively been studied in Approximation Theory and for the solution of Partial Differential Equations (PDEs). Particular interest has occurred within Model Order Reduction (MOR) of parameterized PDEs e.g.\ by the Reduced Basis Method (RBM). While it is known that the N-width decays exponentially fast (and thus admits efficient MOR) for certain problems, there are examples of the linear transport and the wave equation, where the decay rate deteriorates to N^(-1/2). On the other hand, it is widely accepted that a smooth parameter dependence admits a fast decay of the N-width. However, a detailed analysis of the influence of properties of the data (such as regularity or slope) on the rate of the N-width seems to lack. In this paper, we use techniques from Fourier Analysis to derive exact representations of the N-width in terms of initial and boundary conditions of the linear transport equation modeled by some function g for half-wave symmetric data. For arbitrary functions g, we derive bounds and prove that these bounds are sharp. In particular, we prove that the N-width decays as cᵣ N⁻ʳ for functions {with Sobolev regularity} g∈H^(r-ε) for all ε>0 even if g∉Hʳ. Our theoretical investigations are complemented by numerical experiments which confirm the sharpness of our bounds and give additional quantitative insight.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections