Best linear approximation methods for some classes of analytic functions on the unit disk (Q2186316)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Best linear approximation methods for some classes of analytic functions on the unit disk |
scientific article |
Statements
Best linear approximation methods for some classes of analytic functions on the unit disk (English)
0 references
9 June 2020
0 references
This paper is divided into three sections and contains four theorems. The first section is introductory. The second section contains two theorems: The first theorem provides exact values for the Bernstein, Gelfand, Kolmogorov and linear \(n\)-widths for some classes of analytic functions on the unit disk whose moduli of continuity of their weight-averaged \(r\)th derivatives are majorized by a given function satisfying some natural constraints. In the solution of extremal problems of approximation theory for analytic functions on the disk, the computation of sharp upper bounds for the moduli of the Taylor coefficients for various classes of analytic functions is of interest (see, e.g [\textit{S. B. Vakarchuk}, Ukr. Mat. Zh. 56, No. 9, 1155--1171 (2004; Zbl 1076.30042); translation in Ukr. Math. J. 56, No. 9, 1371--1390 (2004)] or [\textit{S. B. Vakarchuk} and \textit{M. S. Shabozov}, Sb. Math. 201, No. 8, 1091--1110 (2010; Zbl 1203.41016); translation from Mat. Sb. 201, No. 8, 3--22 (2010)]). In their second theorem, the authors present a solution to this problem for the classes of functions under consideration. The last two theorems are in Section 3. They apply results obtained in Section 2 to the study of problems of optimal recovery and coding of functions as defined in Chapter 8 of [\textit{N. P. Korneichuk}, Exact constants in approximation theory. Moscow: Nauka (1987)].
0 references
modulus of continuity
0 references
weighted Bergman space
0 references
majorant
0 references
\(n\)-widths
0 references
best linear approximation methods
0 references
best coding method
0 references
0 references
0 references
0 references
0 references
0 references