
doi: 10.3906/mat-2012-65
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. Scientific and Technological Research Council of Turkey (TUBTAK)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [119F426] The authors are supported by the Scientific and Technological Research Council of Turkey (TUBTAK) under Project 119F426.
Symbolic computation, sparse polynomial interpolation, Bernstein polynomials, Bernstein polynomial basis
Symbolic computation, sparse polynomial interpolation, Bernstein polynomials, Bernstein polynomial basis
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
