Ara
Toplam kayıt 3, listelenen: 1-3
A Note on Sparse Polynomial Interpolation in Dickson Polynomial Basis
(Assoc Computing Machinery, 2020)
[Abstract Not Available]
Sparse polynomial interpolation with Bernstein polynomials
(Scientific Technical Research Council Turkey-Tubitak, 2021)
We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse representation (t << deg(f) ) using Bernstein polynomials as term basis from 2t evaluations. Our method is based on manipulating ...
On computing the degree of a Chebyshev Polynomial from its value
(Academic Press Ltd- Elsevier Science Ltd, 2021)
Algorithms for interpolating a polynomial f from its evaluation points whose running time depends on the sparsity to f the polynomial when it is represented as a linear combination of t Chebyshev Polynomials of the First ...