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

DOI10.1145/345542.345629MaRDI QIDQ3454763zbMATH OpenOpenAlexFDO

Authors Erich L. Kaltofen, Wen-shin Lee, Austin A. Lobo

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)

Cited in

(15)

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

Describes a project that uses

Uses Software

• ffmodstd

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454763)