Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases
From MaRDI portal
Publication:5120200
DOI10.1145/3208976.3208999zbMath1467.41002OpenAlexW2809681094MaRDI QIDQ5120200
Zhengfeng Yang, Erich L. Kaltofen, Erdal Imamoglu
Publication date: 9 September 2020
Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3208976.3208999
Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Approximation by polynomials (41A10)
Related Items (4)
Learning algebraic decompositions using Prony structures ⋮ Sparse polynomial interpolation with Bernstein polynomials ⋮ Multiscale matrix pencils for separable reconstruction problems ⋮ On computing the degree of a Chebyshev polynomial from its value
This page was built for publication: Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases