Robust algorithms for sparse interpolation of multivariate polynomials

DOI10.1145/3338637.3338648OpenAlexW2947359832MaRDI QIDQ5880533

Dai Numahata, Hiroshi Sekigawa

Publication date: 3 March 2023

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Faster sparse multivariate polynomial interpolation of straight-line programs ⋮ Randomized interpolation and approximation of sparse polynomials stPreliminary version

Recommendations

• An improved early termination sparse interpolation algorithm for multivariate polynomials 👍 👎
• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials 👍 👎
• Sparse interpolation in terms of multivariate Chebyshev polynomials 👍 👎
• Sparse polynomial interpolation based on diversification 👍 👎
• Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs 👍 👎
• A new algorithm for sparse interpolation of multivariate polynomials 👍 👎
• A new deterministic algorithm for sparse multivariate polynomial interpolation 👍 👎
• Randomized Interpolation and Approximation of Sparse Polynomials 👍 👎
• Robust computation methods for sparse interpolation of multivariate polynomials 👍 👎

This page was built for publication: Robust algorithms for sparse interpolation of multivariate polynomials

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