In this note, we consider the problem of interpolating a sparse function from the values of its multiple derivatives at some given point. We give efficient algorithms for reconstructing sparse Fourier series and sparse polynomials over Sturm-Liouville bases. In both cases, the number of evaluations is linear in the sparsity.
The black box algorithm for separating the numerator from the denominator of a multivariate rational...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
Sparse interpolation or exponential analysis, is widely used and in quite different applications and...
AbstractMultiquadric interpolation is a technique for interpolating nonuniform samples of multivaria...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the e...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
AbstractConsider the black box interpolation of a τ-sparse, n-variate rational function f, where τ i...
We present two algorithms for interpolating sparse rational functions. The first is the interpolatio...
AbstractWe develop a fast discrete algorithm for computing the sparse Fourier expansion of a functio...
International audienceWe show that the sparse polynomial interpolation problem reduces to a discrete...
International audienceIn this note, we present a variant of a probabilistic algorithm by Cuyt and Le...
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm...
Sparse polynomial interpolation consists in recovering of a sparse representation of a polynomial P ...
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse rep...
The black box algorithm for separating the numerator from the denominator of a multivariate rational...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
Sparse interpolation or exponential analysis, is widely used and in quite different applications and...
AbstractMultiquadric interpolation is a technique for interpolating nonuniform samples of multivaria...
AbstractTo reconstruct a black box multivariate sparse polynomial from its floating point evaluation...
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the e...
Abstract. We consider the problem of interpolating sparse multivariate polynomials from their values...
AbstractConsider the black box interpolation of a τ-sparse, n-variate rational function f, where τ i...
We present two algorithms for interpolating sparse rational functions. The first is the interpolatio...
AbstractWe develop a fast discrete algorithm for computing the sparse Fourier expansion of a functio...
International audienceWe show that the sparse polynomial interpolation problem reduces to a discrete...
International audienceIn this note, we present a variant of a probabilistic algorithm by Cuyt and Le...
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm...
Sparse polynomial interpolation consists in recovering of a sparse representation of a polynomial P ...
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse rep...
The black box algorithm for separating the numerator from the denominator of a multivariate rational...
AbstractWe give a new class of algorithms for computing sparsest shifts of a given polynomial. Our a...
Sparse interpolation or exponential analysis, is widely used and in quite different applications and...