Super Greedy Type Algorithms

Details Super Greedy Type Algorithms Super Greedy Type Algorithms

2010-10-26

arxiv.org/abs/1010.5423v1

Mathematics

Numerical Analysis

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Super Greedy Type Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Super Greedy Type Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Super Greedy Type Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159630