当前位置: X-MOL 学术SIAM J. Numer. Anal. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Error Localization of Best $L_{1}$ Polynomial Approximants
SIAM Journal on Numerical Analysis ( IF 2.9 ) Pub Date : 2021-02-01 , DOI: 10.1137/19m1242860
Yuji Nakatsukasa , Alex Townsend

SIAM Journal on Numerical Analysis, Volume 59, Issue 1, Page 314-333, January 2021.
An important observation in compressed sensing is that the $\ell_0$ minimizer of an underdetermined linear system is equal to the $\ell_1$ minimizer when there exists a sparse solution vector and a certain restricted isometry property holds. Here, we develop a continuous analogue of this observation and show that the best $L_0$ and $L_1$ polynomial approximants of a polynomial that is corrupted on a set of small measure are nearly equal. We demonstrate an error localization property of best $L_1$ polynomial approximants and use our observations to develop an improved algorithm for computing best $L_1$ polynomial approximants to continuous functions.


中文翻译:

最佳$ L_ {1} $多项式近似的错误定位

SIAM数值分析杂志,第59卷,第1期,第314-333页,2021年1月。
一个重要的观察结果是,欠定线性系统的$ \ ell_0 $极小值等于$ \ ell_1 $极小值。存在一个稀疏解向量,并且具有一定的受限等距特性。在这里,我们建立了这种观察的连续类比,并表明在一组小量度上被破坏的多项式的最佳$ L_0 $和$ L_1 $多项式近似值几乎相等。我们演示了最佳$ L_1 $多项式近似值的错误定位属性,并使用我们的观察结果开发了一种改进的算法,用于计算连续函数的最佳$ L_1 $多项式近似值。
更新日期:2021-02-02
down
wechat
bug