Date of Award
1-1-2012
Document Type
Campus Access Thesis
Department
Mathematics
First Advisor
Vladimir N Temlyakov
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.
Rights
© 2012, Grace Elizabeth Brown
Recommended Citation
Brown, G. E.(2012). Greedy Algorithm and M-Term Trigonometric Approximation: A Survey. (Master's thesis). Retrieved from https://scholarcommons.sc.edu/etd/1588
COinS