Multivariate sparse interpolation using randomized Kronecker substitutions
From MaRDI portal
Publication:3452374
DOI10.1145/2608628.2608674zbMath1325.68262arXiv1401.6694OpenAlexW1984743613MaRDI QIDQ3452374
Daniel S. Roche, Andrew Arnold
Publication date: 11 November 2015
Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6694
Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Randomized algorithms (68W20)
Related Items
Sparse polynomial interpolation based on diversification, Faster sparse multivariate polynomial interpolation of straight-line programs, Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs, Sparse interpolation in terms of multivariate Chebyshev polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- The Jordan Curve Theorem, Formally and Informally
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Definability and decision problems in arithmetic