Date of Award
1-1-2011
Document Type
Campus Access Dissertation
Department
Mathematics
First Advisor
Vladimir N Temlyakov
Abstract
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.
Rights
© 2011, Jessica Lee Nelson
Recommended Citation
Nelson, J. L.(2011). Greedy Algorithms and Incoherent Systems. (Doctoral dissertation). Retrieved from https://scholarcommons.sc.edu/etd/1607
COinS