This article is cited in 1 scientific paper (total in 1 paper)
Comparison of Purely Greedy and Orthogonal Greedy Algorithm
K. S. Vishnevetskiy ab email 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.
Received: 30.07.2022Revised: 18.03.2023
Citation:
K. S. Vishnevetskiy, “Comparison of Purely Greedy and Orthogonal Greedy Algorithm”, Mat. Zametki , 115 :1 (2024), 43–50 ; Math. Notes , 115 :1 (2024), 37–43
Linking options:
https://www.mathnet.ru/eng/mzm13678 https://doi.org/10.4213/mzm13678 https://www.mathnet.ru/eng/mzm/v115/i1/p43
Statistics & downloads :
Abstract page: 105 Russian version HTML: 2 References: 20 First page: 9