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.
","abstract_html":"<p>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.</p>","abstract_has_math":false,"creators":["Nelson, Jessica Lee"],"institution":null,"degree_name":"Ph.D.","degree_level":"Campus Access Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Vladimir N Temlyakov"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-01-01T08:00:00Z","date_published":"2011-01-01T08:00:00Z","updated_at":"2026-07-24T04:37:34Z","subjects":["Mathematics","Physical Sciences and Mathematics","Coherence","Greedy Algorithms","Incoherent Dictionary","Pure Greedy Algorithm","Redundant Dictionary"],"languages":[],"rights":["© 2011, Jessica Lee Nelson"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarcommons.sc.edu/etd/1607","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Vladimir N Temlyakov"]},{"key":"dc:creator","label":"Author","values":["Nelson, Jessica Lee"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Campus Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Physical Sciences and Mathematics","Coherence","Greedy Algorithms","Incoherent Dictionary","Pure Greedy Algorithm","Redundant Dictionary"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© 2011, Jessica Lee Nelson"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarcommons.sc.edu/etd/1607"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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.
"]},{"key":"dc:title","label":"Title","values":["Greedy Algorithms and Incoherent Systems"]}]}],"canonical_facts":{"dc:contributor":["Vladimir N Temlyakov"],"dc:creator":["Nelson, Jessica Lee"],"dc:description.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.
"],"dc:identifier":["https://scholarcommons.sc.edu/etd/1607"],"dc:rights":["© 2011, Jessica Lee Nelson"],"dc:subject":["Mathematics","Physical Sciences and Mathematics","Coherence","Greedy Algorithms","Incoherent Dictionary","Pure Greedy Algorithm","Redundant Dictionary"],"dc:title":["Greedy Algorithms and Incoherent Systems"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Campus Access Dissertation"],"thesis:degree_name":["Ph.D."]},"updated_at":"2026-07-24T04:37:34Z"}