A new algorithm for sparse interpolation of multivariate polynomials

Authors:
Annie Cuyt;Wen-shin Lee
Affiliations:
Department of Mathematics and Computer Science, University of Antwerp, Middelheimlaan 1, 2020 Antwerpen, Belgium;Department of Mathematics and Computer Science, University of Antwerp, Middelheimlaan 1, 2020 Antwerpen, Belgium
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 7

A deterministic algorithm for sparse multivariate polynomial interpolation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A Stable Numerical Method for Inverting Shape from Moments

SIAM Journal on Scientific Computing
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Improved Sparse Multivariate Polynomial Interpolation Algorithms

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
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

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Sparse multivariate polynomial interpolation via the quotient-difference algorithm

ACM Communications in Computer Algebra
Symbolic-numeric sparse interpolation of multivariate rational functions

ACM Communications in Computer Algebra
Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate

Applied Numerical Mathematics
Reconstructing sparse trigonometric functions

ACM Communications in Computer Algebra
Sparse interpolation of multivariate rational functions

Theoretical Computer Science
Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

Journal of Symbolic Computation
Diversification improves interpolation

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser's qd-algorithm, in which we overcome both drawbacks.