Publication
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
Volume/pages
409:2(2008), p. 180-185
ISI
000261716700003
Full text (Publishers DOI)
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 05.05.2009
Last edited 17.05.2017
To cite this reference