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

$L^2$逼近的最优逐点抽样

Optimal pointwise sampling for $L^2$ approximation

Albert Cohen, Matthieu Dolbeault

摘要:

给定一个函数$u\in L^2=L^2(D,μ)$,其中$D\subset \mathbb R^d$和$μ$是$D$上的一个测度,以及$n$维的线性子空间$V_n\subset L^2$,我们证明了在$V_n$中的$u$的近最佳逼近可以从$Cn$逐点估计的近最优预算中计算出来,其中$C>1$是一个普适常数.该方法根据一定的随机分布抽取采样点,采用加权最小二乘法计算采样点的近似值,并以期望$L^2$范数估计误差。该结果改进了[6,8]中的结果,由于[17,18]中引入的稀疏化策略,[6,8]中的结果需要对数因子次优的采样预算。作为结果,我们得到的任何紧凑类$\mathcal K\subset L^2$的随机设置中的采样数$ρ_{Cn}^{\rm rand}(\mathcal K)_{L^2}$是占主导地位的Kolmogorov $n$-宽度$d_n(\mathcal K)_{L^2}$。虽然我们的结果表明存在具有此类接近最佳属性的随机抽样,但我们讨论了有关通过计算高效算法生成随机抽样的剩余问题。

英文摘要:

Given a function $u\in L^2=L^2(D,μ)$, where $D\subset \mathbb R^d$ and $μ$ is a measure on $D$, and a linear subspace $V_n\subset L^2$ of dimension $n$, we show that near-best approximation of $u$ in $V_n$ can be computed from a near-optimal budget of $Cn$ pointwise evaluations of $u$, with $C>1$ a universal constant. The sampling points are drawn according to some random distribution, the approximation is computed by a weighted least-squares method, and the error is assessed in expected $L^2$ norm. This result improves on the results in [6,8] which require a sampling budget that is sub-optimal by a logarithmic factor, thanks to a sparsification strategy introduced in [17,18]. As a consequence, we obtain for any compact class $\mathcal K\subset L^2$ that the sampling number $ρ_{Cn}^{\rm rand}(\mathcal K)_{L^2}$ in the randomized setting is dominated by the Kolmogorov $n$-width $d_n(\mathcal K)_{L^2}$. While our result shows the existence of a randomized sampling with such near-optimal properties, we discuss remaining issues concerning its generation by a computationally efficient algorithm.

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

↑