Approximation of Functions: Optimal Sampling and Complexity

MaRDI QIDQ7215798arXivFDO

Authors David Krieg, Mario Ullrich

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to approximations and expansions (41-02) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Algorithms for approximation of functions (65D15)

arXiv classification

math.NA

Cited in

(3)

• Greedy sampling designs via reduced basis methods: optimal recovery in the uniform norm
• Structure-preserving quasi-interpolation for vector-valued function with multiple physical constraints
• On the power of adaption and randomization 2: Non-symmetric convex sets

This page was built for publication: Approximation of Functions: Optimal Sampling and Complexity

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