ニュース

JSTOR Daily4月

Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm

Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná ...