Constrained Kolmogorov widths

DOI10.48550/arXiv.2606.28587MaRDI QIDQ7270429zbMATH OpenarXivFDO

Authors Ronald DeVore, Guergana Petrova, Jonathan W. Siegel, P. Wojtaszczyk, Przemysław Wojtaszczyk

Publication date 26 June 2026

Published in arXiv

Tldr We introduce and study constrained Kolmogorov widths, which measure how well an unconstrained linear space approximates a function subject to certain constraints. We show that in classical settings, such as when the constraint requires the approximation to be smooth, the additional constraint does not reduce the efficiency of approximation.

Full work available at URL https://doi.org/10.48550/arXiv.2606.28587

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary linear expressions (41A45) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

arXiv classification

math.NA

This page was built for publication: Constrained Kolmogorov widths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7270429)