Back to results
University of South Carolina
Greedy Algorithm and M-Term Trigonometric Approximation: A Survey
Abstract
dc:description.abstract<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>
Degree
thesis:*- Name thesis:degree_name
- M.S.
- Level thesis:degree_level
- Campus Access Thesis
- Discipline thesis:degree_discipline
- Mathematics
- Year
- 2012
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Brown, Grace Elizabeth
- Contributors dc:contributor
-
- Vladimir N Temlyakov
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- © 2012, Grace Elizabeth Brown
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarcommons.sc.edu/etd/1588
- OAI identifier oai:identifier
- oai:scholarcommons.sc.edu:etd-2589