Sparse interpolation of multivariate rational functions
From MaRDI portal
Publication:633622
DOI10.1016/j.tcs.2010.11.050zbMath1211.65014OpenAlexW2001343527MaRDI QIDQ633622
Wen-Shin Lee, Annie A. M. Cuyt
Publication date: 29 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.050
complexitynumerical examplesmultivariate interpolationrational functionsparse polynomialsparse interpolationBen-Or/Tiwari algorithmblack boxsparse rational interpolation algorithm
Related Items (14)
Computing sparse GCD of multivariate polynomials via polynomial interpolation ⋮ Scattering amplitudes over finite fields and multivariate functional reconstruction ⋮ Learning algebraic decompositions using Prony structures ⋮ Using monodromy to recover symmetries of polynomial systems ⋮ Resultant elimination via implicit equation interpolation ⋮ Integral reduction with Kira 2.0 and finite field methods ⋮ Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} ⋮ Balancing act: multivariate rational reconstruction for IBP ⋮ FIRE6: Feynman integral reduction with modular arithmetic ⋮ Reconstructing rational functions with \texttt{FireFly} ⋮ ESPRIT for Multidimensional General Grids ⋮ Results and techniques for higher order calculations within the gradient-flow formalism ⋮ An interpolation algorithm for computing Dixon resultants ⋮ A note on the Hermite interpolation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- On the structure of a table of multivariate rational interpolants
- A probabilistic remark on algebraic program testing
- Early termination in sparse interpolation algorithms
- A new algorithm for sparse interpolation of multivariate polynomials
- Fast rational function reconstruction
- Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Greatest common divisors of polynomials given by straight-line programs
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Computational Complexity of Sparse Rational Interpolation
- Maximal quotient rational reconstruction
- A Recursive Computation Scheme for Multivariate Rational Interpolants
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
This page was built for publication: Sparse interpolation of multivariate rational functions
