Random Sampling of Sparse Trigonometric Polynomials

Details Random Sampling of Sparse Trigonometric Polynomials Random Sampling of Sparse Trigonometric Polynomials

2005-12-29

arxiv.org/abs/math/0512642v1

Mathematics

Classical Analysis and ODEs

38 pages, 7 figures

Scientific paper

We study the problem of reconstructing a multivariate trigonometric polynomial having only few non-zero coefficients from few random samples. Inspired by recent work of Candes, Romberg and Tao we propose to recover the polynomial by Basis Pursuit, i.e., by $\ell^1$-minimization. Numerical experiments show that in many cases the trigonometric polynomial can be recovered exactly provided the number $N$ of samples is high enough compared to the ``sparsity'' -- the number of non-vanishing coefficients. However, $N$ can be chosen small compared to the assumed maximal degree of the trigonometric polynomial. Hence, the proposed scheme may overcome the Nyquist rate. We present two theorems that explain this observation. Unexpectly, they establish a connection to an interesting combinatorial problem concerning set partitions, which seemingly has not yet been considered before.

Affiliated with

Also associated with

No associations

Rating

Random Sampling of Sparse Trigonometric Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Sampling of Sparse Trigonometric Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Sampling of Sparse Trigonometric Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701122