Comparison of Purely Greedy and Orthogonal Greedy Algorithm
摘要
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.