|
Title
|
|
|
|
A new algorithm for sparse interpolation of multivariate polynomials
|
|
|
Author
|
|
|
|
|
|
|
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 Rutishausers qd-algorithm, in which we overcome both drawbacks. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Theoretical computer science. - Amsterdam
|
|
|
Publication
|
|
|
|
Amsterdam
:
2008
|
|
|
ISSN
|
|
|
|
0304-3975
|
|
|
DOI
|
|
|
|
10.1016/J.TCS.2008.09.002
|
|
|
Volume/pages
|
|
|
|
409
:2
(2008)
, p. 180-185
|
|
|
ISI
|
|
|
|
000261716700003
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|