超贪心类型算法
Super Greedy Type Algorithms
AI总结:
本文研究在贪心步骤中选取多个字典元素的超贪心算法,证明对于非相干字典,其误差上界与标准贪心算法同阶,但计算更简单。
摘要:
我们研究贪心类型算法,其中在贪心步骤中选取多个字典元素,而非标准贪心类型算法中的单个字典元素。我们将此类贪心算法称为{\it 超贪心算法}。在算法的贪心步骤中选取多个元素的想法并不新鲜。最近,我们观察到以下新现象:对于非相干字典,这些新型算法(超贪心算法)提供了与标准贪心算法类似(在阶的意义上)的误差上界。超贪心算法在计算上比标准贪心算法更简单。我们继续研究这一现象。
英文摘要:
We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The idea of picking several elements at a greedy step of the algorithm is not new. Recently, we observed the following new phenomenon. For incoherent dictionaries these new type of algorithms (super greedy algorithms) provide the same (in the sense of order) upper bound for the error as their analogues from the standard greedy algorithms. The super greedy algorithms are computationally simpler than their analogues from the standard greedy algorithms. We continue to study this phenomenon.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。