arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2209.04985math.NAcs.NA
收藏

从点值完全恢复:Chebyshev 可逼近性先验的一个最优算法

Full Recovery from Point Values: an Optimal Algorithm for Chebyshev Approximability Prior

Simon Foucart

AI总结:

针对连续函数子空间逼近模型下最优恢复过程构造缺失的问题,提出一种在维度至少为三且含常数函数的 Chebyshev 空间中构造线性最优恢复映射的实用算法。

摘要:

给定属于某个模型集的未知函数的点值样本,在 Optimal Recovery 中,人们寻求以最小化恢复过程最坏情况误差的方式恢复该函数。虽然通常已知这样的最优恢复过程可以被选择为线性的,例如当模型集基于连续函数子空间的可逼近性时,但该过程的构造却很少可用。本文揭示了一种实用的算法,用于在逼近空间为维度至少为三且包含常数函数的 Chebyshev 空间时,构造线性最优恢复映射。

英文摘要:

Given pointwise samples of an unknown function belonging to a certain model set, one seeks in Optimal Recovery to recover this function in a way that minimizes the worst-case error of the recovery procedure. While it is often known that such an optimal recovery procedure can be chosen to be linear, e.g. when the model set is based on approximability by a subspace of continuous functions, a construction of the procedure is rarely available. This note uncovers a practical algorithm to construct a linear optimal recovery map when the approximation space is a Chevyshev space of dimension at least three and containing the constant functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑