Sciweavers

2766 search results - page 1 / 554
» Algorithms for trigonometric polynomials
Sort
View
ISSAC
2001
Springer
119views Mathematics» more  ISSAC 2001»
13 years 9 months ago
Algorithms for trigonometric polynomials
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
Jamie Mulholland, Michael B. Monagan
FOCM
2008
156views more  FOCM 2008»
13 years 5 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
ADCM
2000
104views more  ADCM 2000»
13 years 5 months ago
On the detection of singularities of a periodic function
We discuss the problem of detecting the location of discontinuities of derivatives of a periodic function, given either finitely many Fourier coefficients of the function, or the ...
Hrushikesh Narhar Mhaskar, Jürgen Prestin
SIAMNUM
2010
134views more  SIAMNUM 2010»
12 years 12 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
ICASSP
2011
IEEE
12 years 9 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson