Error-Correcting Sparse Interpolation in the Chebyshev Basis
From MaRDI portal
Publication:2819732
DOI10.1145/2755996.2756652zbMath1345.65004MaRDI QIDQ2819732
Erich L. Kaltofen, Andrew Arnold
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2755996.2756652
Chebyshev polynomials; orthogonal basis; error-correcting code; Descartes' rule of signs; sparse polynomial interpolation; Prony's algorithm
68W30: Symbolic computation and algebraic computation
65D05: Numerical interpolation
68W20: Randomized algorithms
94B35: Decoding
Related Items
Sparse polynomial interpolation with Bernstein polynomials, Sparse interpolation in terms of multivariate Chebyshev polynomials, On computing the degree of a Chebyshev polynomial from its value, Mini-workshop: Interpolation, approximation, and algebra. Abstracts from the mini-workshop held February 13--19, 2022