Sparse shifts for univariate polynomials

DOI10.1007/BF01293594zbMath0953.12006MaRDI QIDQ1924546

B. David Saunders, Y. N. Lakshman

Publication date: 15 April 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmuniquenesspolynomial time algorithmrationalityunivariate polynomialsrational polynomialsparse decompositionsparse shift

Mathematics Subject Classification ID

Related Items (5)

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases ⋮ On the linear independence of shifted powers ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Reconstruction algorithms for sums of affine powers ⋮ Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolating polynomials from their values
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
• The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
• On the invariance of chains of fields
• Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Computational Complexity of Sparse Rational Interpolation
• Randomized Interpolation and Approximation of Sparse Polynomials
• Sparse Polynomial Interpolation in Nonstandard Bases
• Global time evolution of an axisymmetric vortex ring at low Reynolds numbers
• Polynomial decomposition algorithms

This page was built for publication: Sparse shifts for univariate polynomials