In this paper we aim to provide an easily readable survey of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are usually omitted for the sake of brevity.
","abstract_html":"<p>In this paper we aim to provide an easily readable survey of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are usually omitted for the sake of brevity.</p>","abstract_has_math":false,"creators":["Brown, Grace Elizabeth"],"institution":null,"degree_name":"M.S.","degree_level":"Campus Access Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Vladimir N Temlyakov"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-01-01T08:00:00Z","date_published":"2012-01-01T08:00:00Z","updated_at":"2026-07-24T04:38:07Z","subjects":["Mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":["© 2012, Grace Elizabeth Brown"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarcommons.sc.edu/etd/1588","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":["Brown, Grace Elizabeth"]}]},{"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 Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© 2012, Grace Elizabeth Brown"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarcommons.sc.edu/etd/1588"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this paper we aim to provide an easily readable survey of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are usually omitted for the sake of brevity.
"]},{"key":"dc:title","label":"Title","values":["Greedy Algorithm and M-Term Trigonometric Approximation: A Survey"]}]}],"canonical_facts":{"dc:contributor":["Vladimir N Temlyakov"],"dc:creator":["Brown, Grace Elizabeth"],"dc:description.abstract":["In this paper we aim to provide an easily readable survey of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are usually omitted for the sake of brevity.
"],"dc:identifier":["https://scholarcommons.sc.edu/etd/1588"],"dc:rights":["© 2012, Grace Elizabeth Brown"],"dc:subject":["Mathematics","Physical Sciences and Mathematics"],"dc:title":["Greedy Algorithm and M-Term Trigonometric Approximation: A Survey"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Campus Access Thesis"],"thesis:degree_name":["M.S."]},"updated_at":"2026-07-24T04:38:07Z"}