Comparison of Purely Greedy and Orthogonal Greedy Algorithm

被引:0
|
作者
Vishnevetskiy, K. S. [1 ,2 ]
机构
[1] Lomonosov Moscow State Univ, Moscow 119992, Russia
[2] Moscow Ctr Fundamental & Appl Math, Moscow 119899, Russia
基金
俄罗斯科学基金会;
关键词
greedy approximation; m-term approximation; Hilbert space; coherence parameter;
D O I
10.1134/S0001434624010048
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:37 / 43
页数:7
相关论文
共 50 条