Fast interpolation of sparse multivariate polynomials
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917556946731008 |
|---|---|
| author | van der Hoeven, Joris Lecerf, Grégoire |
| author_facet | van der Hoeven, Joris Lecerf, Grégoire |
| contents | Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers. The problem of sparse interpolation is to recover f in its usual sparse representation, as a sum of coefficients times monomials. For the first time we present a quasi-optimal algorithm for this task. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_17664 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Fast interpolation of sparse multivariate polynomials van der Hoeven, Joris Lecerf, Grégoire Symbolic Computation Commutative Algebra Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers. The problem of sparse interpolation is to recover f in its usual sparse representation, as a sum of coefficients times monomials. For the first time we present a quasi-optimal algorithm for this task. |
| title | Fast interpolation of sparse multivariate polynomials |
| topic | Symbolic Computation Commutative Algebra |
| url | https://arxiv.org/abs/2312.17664 |