A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Sparse Polynomial Interpolation in Nonstandard Bases
SIAM Journal on Computing
A Stable Numerical Method for Inverting Shape from Moments
SIAM Journal on Scientific Computing
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Sampling piecewise sinusoidal signals with finite rate of innovation methods
IEEE Transactions on Signal Processing
Parameter estimation for exponential sums by approximate Prony method
Signal Processing
Sparse Legendre expansions via l1-minimization
Journal of Approximation Theory
Sampling signals with finite rate of innovation
IEEE Transactions on Signal Processing
Exact sampling results for some classes of parametric nonbandlimited 2-D signals
IEEE Transactions on Signal Processing
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We derive a new deterministic algorithm for the computation of a sparse Legendre expansion f of degree N with M@?N nonzero terms from only 2M function resp. derivative values f^(^j^)(1), j=0,...,2M-1 of this expansion. For this purpose we apply a special annihilating filter method that allows us to separate the computation of the indices of the active Legendre basis polynomials and the evaluation of the corresponding coefficients.