TIT
2008
14 years 19 days ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
FOCM
2008
14 years 24 days ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
ISSAC
2001
Springer
14 years 5 months ago
2001
Springer
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...