On sparse interpolation of rational functions and gcds

DOI10.1145/3466895.3466896MaRDI QIDQ5102020zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven, Grégoire Lecerf

Publication date 6 September 2022

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

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1273635
• Sparse rational function interpolation with finitely many values for the coefficients
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• scientific article; zbMATH DE number 871950
• Sparse interpolation of multivariate rational functions

Cited in

(9)

• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Computing Sparse Representations of Systems of Rational Fractions
• Using monodromy to recover symmetries of polynomial systems
• Sparse interpolation of multivariate rational functions
• A new black box GCD algorithm using Hensel lifting
• Factoring sparse polynomials fast
• Fast interpolation and multiplication of unbalanced polynomials
• A new sparse polynomial GCD by separating terms
• Solving parametric linear matrix inequalities

This page was built for publication: On sparse interpolation of rational functions and gcds

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