A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM Journal on Computing
Algorithms for computer algebra
Algorithms for computer algebra
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
FOXBOX: a system for manipulating symbolic objects in black box representation
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A Stable Numerical Method for Inverting Shape from Moments
SIAM Journal on Scientific Computing
On the history of multivariate polynomial interpolation
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
Multivariate Hermite interpolation by algebraic polynomials: a survey
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
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
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Rounding Errors in Algebraic Processes
Rounding Errors in Algebraic Processes
On the numerical condition of a generalized Hankel eigenvalue problem
Numerische Mathematik
Reconstructing polygons from moments with connections to arrayprocessing
IEEE Transactions on Signal Processing
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation
Proceedings of the 2007 international workshop on Symbolic-numeric computation
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
A new algorithm for sparse interpolation of multivariate polynomials
Theoretical Computer Science
Sparse multivariate polynomial interpolation via the quotient-difference algorithm
ACM Communications in Computer Algebra
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
Blind image deconvolution via fast approximate GCD
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials
ACM Communications in Computer Algebra
Hi-index | 0.00 |
We consider the problem of sparse interpolation of an approximate multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomial have some error, and all numbers are represented in standard, fixed-precision, floating point arithmetic. By interpolating the black box evaluated at random primitive roots of unity, we give efficient and numerically robust solutions. We note the similarity between the exact Ben-Or/Tiwari sparse interpolation algorithm and the classical Prony's method for interpolating a sum of exponential functions, and exploit the generalized eigenvalue reformulation of Prony's method. We analyze the numerical stability of our algorithms and the sensitivity of the solutions, as well as the expected conditioning achieved through randomization. Finally, we demonstrate the effectiveness of our techniques in practice through numerical experiments and applications.