Sparse polynomial interpolation with Bernstein polynomials
Özet
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 given black box polynomial for f so that we can make use of Prony's algorithm.
Kaynak
Turkish Journal of MathematicsKoleksiyonlar
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
A Note on Sparse Polynomial Interpolation in Dickson Polynomial Basis
İmamoğlu, Erdal; Kaltofen, Erich L. (Assoc Computing Machinery, 2020)[Abstract Not Available] -
PIECEWISE QUADRATIC BOUNDING FUNCTIONS FOR FINDING REAL ROOTS OF POLYNOMIALS
Aaid, Djamel; Noui, Amel; Özer, Özen (Amer Inst Mathematical Sciences-Aims, 2021)In this paper, our main interest is to create/ construct a new useful and outstanding algorithm to obtain roots of the real polynomial represented by f(x) = c(0) +c(1)x+ ... + c(i)x(i) + ... + c(n)(x)n where coefficients ... -
Analytical solution of D-dimensional radial Schrödinger equation for sextic potential by the extended Nikiforov–Uvarov method and biconfluent Heun polynomials
Karayer, Hasibe Hale (2019)D-dimensional radial Schrödinger equation (SE) for sextic potential is solved using the extended Nikiforov–Uvarov method analytically. Energy eigenvalue and eigenfunction solutions are achieved systematically. It is ...