On sparse interpolation of rational functions and gcds-Reference-Cited by-同舟云学术

On sparse interpolation of rational functions and gcds

Published:2021-03 Issue:1 Volume:55 Page:1-12
ISSN:1932-2240
Container-title:ACM Communications in Computer Algebra
language:en
Short-container-title:ACM Commun. Comput. Algebra

Author:

van der Hoeven Joris¹,Lecerf Grégoire¹

Affiliation:

1. CNRS, École polytechnique, Institut Polytechnique de Paris, Palaiseau, France

Abstract

In this note, we present a variant of a probabilistic algorithm by Cuyt and Lee for the sparse interpolation of multivariate rational functions. We also present an analogous method for the computation of sparse gcds.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3466895.3466896

Reference17 articles.

1. Faster sparse multivariate polynomial interpolation of straight-line programs

2. Sparse interpolation of multivariate rational functions

3. Algorithms for the non-monic case of the sparse modular GCD algorithm

4. Interpolation of polynomials given by straight-line programs

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast interpolation and multiplication of unbalanced polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. A New Sparse Polynomial GCD by Separating Terms;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

3. Using monodromy to recover symmetries of polynomial systems;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

4. Sparse Polynomial Interpolation and Division in Soft-linear Time;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04