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
A weakly stable algorithm for Pade´ approximants and the inversion of Hankel matrices
SIAM Journal on Matrix Analysis and Applications
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
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
Conditioning of Rectangular Vandermonde Matrices with Nodes in the Unit Disk
SIAM Journal on Matrix Analysis and Applications
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
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
SIAM Journal on Numerical Analysis
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
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium 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)
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
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On the numerical condition of a generalized Hankel eigenvalue problem
Numerische Mathematik
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Reconstructing polygons from moments with connections to arrayprocessing
IEEE Transactions on Signal Processing
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Reconstructing sparse trigonometric functions
ACM Communications in Computer Algebra
Sparse interpolation of multivariate rational functions
Theoretical Computer Science
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Rounding coefficients and artificially underflowing terms in non-numeric expressions
ACM Communications in Computer Algebra
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Representation of sparse Legendre expansions
Journal of Symbolic Computation
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Sparse multivariate function recovery from values with noise and outlier errors
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| 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 analyse 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.