Sparse polynomial interpolation with Bernstein polynomials
Copyright policy )Sparse polynomial interpolation with Bernstein polynomials
Summary: We present an algorithm for interpolating an unknown univariate polynomial \(f\) that has a \(t\) sparse representation (\(t\ll\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.
- Kırklareli University Turkey
Approximation by polynomials, Symbolic computation, sparse polynomial interpolation, Bernstein polynomials, Symbolic computation and algebraic computation, Bernstein polynomial basis, Interpolation in approximation theory, symbolic computation
Approximation by polynomials, Symbolic computation, sparse polynomial interpolation, Bernstein polynomials, Symbolic computation and algebraic computation, Bernstein polynomial basis, Interpolation in approximation theory, symbolic computation
selected citations These citations are derived from selected sources.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
Citations provided by BIP!Popularity provided by BIP!