How many Fourier coefficients are needed?

arxiv(2022)

引用 0|浏览1
暂无评分
摘要
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, … , 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.
更多
查看译文
关键词
Interpolation,sparse exponential sums,non-harmonic exponential sums,Fourier coefficients,inverse problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要