Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)
ISSN 2541-9005 (Online)

For citation:

Speransky K. S. On the convergence of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2021, vol. 21, iss. 3, pp. 336-342. DOI: 10.18500/1816-9791-2021-21-3-336-342, EDN: XUZAEH

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Published online: 
31.08.2021
Full text:
download
(downloads: 1351)
Language: 
English
Heading: 
Mathematics
Article type: 
Article
UDC: 
517.5
DOI: 
10.18500/1816-9791-2021-21-3-336-342
EDN: 
XUZAEH

On the convergence of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space

Autors: 
Speransky Konstantin Sergeevich, Saratov State University
Abstract: 

In this article we consider representing properties of subspaces generated by the Szego kernel. We examine under which conditions on the sequence of points of the unit disk the order-preserving weak greedy algorithm for appropriate subspaces generated by the Szego kernel converges. Previously, we constructed a representing system based on discretized Szego kernels. The aim of this paper is to find an effective algorithm to get such representation, and we draw on the work of Silnichenko that introduced the notion of the order-preserving weak greedy algorithm. By selecting a special sequence of discretization points we refine one of Totik's results on the approximation of functions in the Hardy space using Szego kernels. As the main result we prove the convergence criteria of the order-preserving weak greedy algorithm for subspaces generated by the Szego kernel in the Hardy space.

Key words: 
representing systems
Szego kernel
order-preserving weak greedy algorithm
References: 
  1. Duren P. L. Theory of Hp Spaces. New York, Academic Press, 1970. 258 p.
  2. Duren P. L., Schuster A. P. Bergman Spaces. (Mathematical Surveys and Monographs, vol. 10). Providence, AMS, 2004. 318 p.
  3. Partington J. Interpolation, Identification, and Sampling. (London Mathematical Society Monographs, vol. 17). Oxford, New York, Clarendon Press, Oxford University Press, 1997. 288 p.
  4. Halmos P. R. A Hilbert Space Problem Book. (Graduate Texts in Mathematics, vol. 19). New York, Springer-Verlag, 1982. 369 p. https://doi.org/10.1007/978-1-4684-9330-6
  5. Fricain E., Khoi L., Lefevre P. Representing systems generated by reproducing kernels. Indagationes Mathematicae, 2018, vol. 29, iss. 3, pp. 860–872. https://doi.org/10.1016/ j.indag.2018.01.004
  6. Speransky K. S., Terekhin P. A. A representing system generated by the Szego kernel for the Hardy space. Indagationes Mathematicae, 2018, vol. 29, iss. 5, pp. 1318–1325. https://doi.org/10.1016/j.indag.2018.06.001
  7. Terekhin P. A. Frames in Banach Spaces. Functional Analysis and Its Applications, 2010, vol. 44, no. 3, pp. 199–208. https://doi.org/10.1007/s10688-010-0024-z
  8. Speransky K. S., Terekhin P. A. On existence of frames based on the Szego kernel in the Hardy space. Russian Mathematics, 2019, vol. 63, iss. 2, pp. 51–61. https://doi.org/ 10.3103/S1066369X19020075
  9. Temlyakov V. N. Greedy Approximation. New York, Cambridge University Press, 2011. 418 p. https://doi.org/10.1017/CBO9780511762291
  10. Silnichenko A. V. On the convergence of order-preserving weak greedy algorithms. Mathematical Notes, 2008, vol. 84, no. 5, pp. 741–747. https://doi.org/10.1134/ S0001434608110187
  11. Totik V. Recovery of Hp -functions. Proceedings of the American Mathematical Society, 1984, vol. 90, no. 4, pp. 531–537. https://doi.org/10.2307/2045025
Received: 
10.11.2020
Accepted: 
04.12.2020
Published: 
31.08.2021
  • 1522 reads