![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Approximation Theory, Volume 252
Volume 252, April 2020
- William T. Butterworth:
Corrigendum to "Abel Summability of Entire Functions of Exponential Type" [Progress in Approximation Theory, P. Nevai and A. Pinkus, Eds. (1991) 117-139]. 105296 - Borislav R. Draganov:
Corrigendum to "Strong estimates of the weighted simultaneous approximation by the Bernstein and Kantorovich operators and their iterated Boolean sums" [J. Approx. Theory 200 (2015) 92-135]. 105321 - The Anh Bui:
Hermite pseudo-multipliers on new Besov and Triebel-Lizorkin spaces. 105348 - Michael I. Ganzburg:
Sharp constants of approximation theory. III. Certain polynomial inequalities of different metrics on convex sets. 105351 - Qingjun Chang
, Chongyang Deng, Michael S. Floater:
An interpolatory view of polynomial least squares approximation. 105360 - Sergey Khrushchev:
A continuous function with universal Fourier series on a given closed set of Lebesgue measure zero. 105361 - Viktor I. Kolyada:
On the optimal relationships between LP-norms for the Hardy operator and its dual for decreasing functions. 105362 - Daniel Li
, Hervé Queffélec, Luis Rodríguez-Piazza
:
An extremal composition operator on the Hardy space of the bidisk with small approximation numbers. 105363 - Vilmos Totik:
Polynomial approximation in several variables. 105364
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.