Date of Award
Campus Access Dissertation
Vladimir N Temlyakov
This dissertation concerns estimates on the size of sets that have small coherence among the elements, the latest best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.
Nelson, J. L.(2011). Greedy Algorithms and Incoherent Systems. (Doctoral dissertation). Retrieved from http://scholarcommons.sc.edu/etd/1607