Sparse polynomial interpolation based on derivatives

DOI10.1016/J.JSC.2022.06.002MaRDI QIDQ2156377zbMATH OpenOpenAlexFDO

Authors Qiao-Long Huang

Publication date 18 July 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.03708

zbMATH Keywords

derivativessparse polynomialsstraight-line program

Mathematics Subject Classification ID

Computational number theory (11Yxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Algorithms in computer science (68Wxx)

Recommendations

• Sparse polynomial interpolation over fields with large or zero characteristic
• Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
• Sparse polynomial interpolation based on diversification
• Sparse interpolation over finite fields via low-order roots of unity
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications

Cites work

• Deterministically testing sparse polynomial identities of unbounded degree
• Diversification improves interpolation
• Evaluating Derivatives
• Fast construction of irreducible polynomials over finite fields
• Faster sparse interpolation of straight-line programs
• Faster sparse multivariate polynomial interpolation of straight-line programs
• Greatest common divisors of polynomials given by straight-line programs
• scientific article; zbMATH DE number 3362881 (Why is no real title available?)
• Interpolating polynomials from their values
• Interpolation of polynomials given by straight-line programs
• Modern computer algebra
• Newton-Hensel interpolation lifting
• Output-sensitive algorithms for sumset and sparse polynomial multiplication
• Randomized Interpolation and Approximation of Sparse Polynomials
• Revisit sparse polynomial interpolation based on randomized Kronecker substitution
• Sparse interpolation over finite fields via low-order roots of unity
• Sparse polynomial interpolation over fields with large or zero characteristic
• The complexity of partial derivatives

Cited in

(7)

• Sparse polynomial interpolation with finitely many values for the coefficients
• The interpolation problem for \(k\)-sparse polynomials and character sums
• Sparse polynomial interpolation in Chebyshev bases
• Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
• Sparse polynomial prediction
• Sparse Polynomial Interpolation Based on Derivative
• Fast interpolation and multiplication of unbalanced polynomials

This page was built for publication: Sparse polynomial interpolation based on derivatives

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