![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Journal of Approximation Theory, Volume 128
Volume 128, Number 1, May 2004
- Ben-yu Guo, Li-lian Wang:
Jacobi approximations in non-uniformly Jacobi-weighted Sobolev spaces. 1-41 - Ingo Steinwart
:
Entropy of convex hulls--some Lorentz norm results. 42-52 - Andreas Defant, Domingo García
, Manuel Maestre
:
Estimates for the first and second Bohr radii of Reinhardt domains. 53-68 - György Gát:
On the pointwise convergence of Cesàro means of two-variable functions with respect to unbounded Vilenkin systems. 69-99 - Chelo Ferreira:
A note on the error bound for the remainder of an asymptotic expansion of the double gamma function. 100-101
Volume 128, Number 2, June 2004
- Chin-Cheng Lin, KunyangKunyang Wang:
Convergence rate of Fourier-Laplace series of L2-functions. 103-114 - Hans-Jürgen Schmeißer, Winfried Sickel:
Spaces of functions of mixed smoothness and approximation from hyperbolic crosses. 115-150 - Dorothee D. Haroske
, Susana D. Moura
:
Continuity envelopes of spaces of generalised smoothness, entropy and approximation numbers. 151-174 - K. H. Kwon, D. W. Lee:
Inequalities of Rafalson type for algebraic polynomials. 175-186 - Dietrich Braess, Tomas Sauer:
Bernstein polynomials and learning theory. 187-206 - Werner Linde:
Kolmogorov numbers of Riemann-Liouville operators over small sets and applications to Gaussian processes. 207-233
![](https://dblp.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.