Robust algorithms for sparse interpolation of multivariate polynomials

DOI10.1145/3338637.3338648MaRDI QIDQ5880533zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

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

Cited in

(3)

• Faster sparse multivariate polynomial interpolation of straight-line programs
• Robust computation methods for sparse interpolation of multivariate polynomials
• Randomized interpolation and approximation of sparse polynomials stPreliminary version

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)