arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.10348math.CAcs.NAmath.NA
收藏

需要多少个傅里叶系数?

How many Fourier coefficients are needed?

Benedikt Diederichs, Mihail N. Kolountzakis, Effie Papageorgiou

摘要:

我们正在寻找家庭的功能或措施的环面是指定的有限数量的参数$N$。对于给定的族,任务是在预定的并且可以仅取决于$N$的一组位置处查看对象的少量傅里叶系数,并且确定对象。我们看看(a)在最多$N$间隔的环面和(b)在最多$N$复杂的点质量的多维环面上的总和的指示函数。在第一种情况下,我们重新证明了一个定理的考特尼说,傅里叶系数的位置$0, 1, \ldots, N$是足够的,以确定功能(的间隔)。在第二种情况下,我们产生一组大小为$O(N \log^{d-1} N)$的位置,足以确定测度。

英文摘要:

We are looking at families of functions or measures on the torus which are specified by a finite number of parameters $N$. The task, for a given family, is to look at a small number of Fourier coefficients of the object, at a set of locations that is predetermined and may depend only on $N$, and determine the object. We look at (a) the indicator functions of at most $N$ intervals of the torus and (b) at sums of at most $N$ complex point masses on the multidimensional torus. In the first case we reprove a theorem of Courtney which says that the Fourier coefficients at the locations $0, 1, \ldots, N$ are sufficient to determine the function (the intervals). In the second case we produce a set of locations of size $O(N \log^{d-1} N)$ which suffices to determine the measure.

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

↑