Robust computation methods for sparse interpolation of multivariate polynomials

DOI10.1145/3377006.3377018MaRDI QIDQ5060836zbMATH OpenOpenAlexFDO

Authors Kazuki Kondo, Hiroshi Sekigawa

Publication date 11 January 2023

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

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Robust algorithms for sparse interpolation of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials
• A new algorithm for sparse interpolation of multivariate polynomials
• An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown

Cited in

(5)

• Faster sparse multivariate polynomial interpolation of straight-line programs
• Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• Robust algorithms for sparse interpolation of multivariate polynomials
• -discrepancy sets and their application for interpolation of sparse polynomials

This page was built for publication: Robust computation methods 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 Q5060836)