A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
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
Modular rational sparse multivariate polynomial interpolation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
On zero-testing and interpolation of k -sparse multivariate polynomials over finite fields
Theoretical Computer Science
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
On computing greatest common divisors with polynomials given by black boxes for their evaluations
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
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
Modern Computer Algebra
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Numerical Polynomial Algebra
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Proceedings of the 2007 international workshop on Symbolic-numeric computation
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proceedings of the 2007 international symposium on Symbolic and algebraic 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
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Interpolation of polynomials given by straight-line programs
Theoretical Computer Science
On factorization of multivariate polynomials over algebraic number and function fields
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Parallel sparse polynomial interpolation over finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Recursive sparse interpolation
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the best-known algorithm for interpolation over large finite fields by presenting a Las Vegas randomized algorithm that uses fewer black box evaluations. Using related techniques, we also address numerical interpolation of sparse polynomials with complex coefficients, and provide the first provably stable algorithm (in the sense of relative error) for this problem, at the cost of modestly more evaluations. A key new technique is a randomization which makes all coefficients of the unknown polynomial distinguishable, producing what we call a diverse polynomial. Another departure from most previous approaches is that our algorithms do not rely on root finding as a subroutine. We show how these improvements affect the practical performance with trial implementations.