Date of Award
Campus Access Thesis
Vladimir N Temlyakov
In this paper we aim to provide an easily readable survey of the paper  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.
Brown, G. E.(2012). Greedy Algorithm and M-Term Trigonometric Approximation: A Survey. (Master's thesis). Retrieved from http://scholarcommons.sc.edu/etd/1588