RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive
Mat. Zametki, 2024 Volume 115, Issue 1, Pages 43–50 (Mi mzm13678)
This article is cited in 1 paper

Comparison of Purely Greedy and Orthogonal Greedy Algorithm

K. S. Vishnevetskiyab

a Lomonosov Moscow State University
b Moscow Center for Fundamental and Applied Mathematics

Abstract: Conditions for a dictionary in a Hilbert space are obtained that are necessary or sufficient for the coincidence of purely greedy and orthogonal greedy algorithms with respect to this dictionary.

Keywords: greedy approximation, $m$-term approximation, Hilbert space, coherence parameter.

UDC: 517.982.256

Received: 30.07.2022
Revised: 18.03.2023

DOI: 10.4213/mzm13678


 English version: Mathematical Notes, 2024, 115:1, 37–43

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025