RUS  ENG
Полная версия
ЖУРНАЛЫ // Успехи математических наук // Архив

УМН, 2024, том 79, выпуск 6(480), страницы 39–56 (Mi rm10186)

On greedy approximation in complex Banach spaces

A. V. Gasnikovabc, V. N. Temlyakovdbef

a Ivannikov institute for System Programming of Russian Academy of Sciences, Moscow, Russia
b Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia
c Innopolis University, Innopolis, Russia
d University of South Carolina, Columbia, USA
e Lomonosov Moscow State University, Moscow, Russia
f Moscow Center for Fundamental and Applied Mathematics, Moscow, Russia

Аннотация: The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real Banach spaces were extended to the case of complex Banach spaces. In this paper we extend some of the results known in the real case for greedy algorithms other than the WCGA to the case of complex Banach spaces.
Bibliography: 25 titles.

Ключевые слова: complex Banach space, greedy approximation, weak greedy algorithm with free relaxation, greedy algorithm with weakness and relaxation, incremental algorithm.

УДК: 517.5+519.6

Поступила в редакцию: 22.08.2024

Язык публикации: английский

DOI: 10.4213/rm10186



© МИАН, 2024