Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

DOI10.1145/345542.345629zbMath1326.68358OpenAlexW2076309556MaRDI QIDQ3454763

Austin A. Lobo, Wen-Shin Lee, Erich L. Kaltofen

Publication date: 26 November 2015

Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/345542.345629

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Approximation by polynomials (41A10)

Related Items (14)

Early termination in sparse interpolation algorithms ⋮ Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases ⋮ A new algorithm for sparse interpolation of multivariate polynomials ⋮ On efficient sparse integer matrix Smith normal form computations ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Integration-by-parts reductions of Feynman integrals using singular and GPI-space ⋮ Resultant elimination via implicit equation interpolation ⋮ Faint and clustered components in exponential analysis ⋮ Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} ⋮ Balancing act: multivariate rational reconstruction for IBP ⋮ Sparse interpolation of multivariate rational functions ⋮ Reconstructing rational functions with \texttt{FireFly} ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ Sparse interpolation in terms of multivariate Chebyshev polynomials

Uses Software

• ffmodstd

This page was built for publication: Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm