Greedy Approximation

Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances.

Vladimir Temlyakov (Author)

9781107003378, Cambridge University Press

Hardback, published 8 September 2011

432 pages
23.5 x 15.6 x 2.5 cm, 0.76 kg

'The author is the leading expert on greedy approximation and this book offers a guided tour through the state of the art of the subject. Temlyakov's book is an excellent mathematical monograph and a valuable reference for researchers not only in approximation theory, but also in numerical mathematics, analysis, functional analysis, and statistics. The book is addressed mainly to researchers interested in greedy approximation and related areas. However, it is written at a level that is approachable for graduate students interested in the aforementioned areas, and it could be used for designing graduate courses in greedy approximation, learning theory and compressed sensing. As an added bonus, the author has included an extensive list of open problems in the area that can serve as inspiration for future research papers and dissertations.' Morten Nielsen, SIAM News

This first book on greedy approximation gives a systematic presentation of the fundamental results. It also contains an introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. Nonlinear approximation is becoming increasingly important, especially since two types are frequently employed in applications: adaptive methods are used in PDE solvers, while m-term approximation is used in image/signal/data processing, as well as in the design of neural networks. The fundamental question of nonlinear approximation is how to devise good constructive methods (algorithms) and recent results have established that greedy type algorithms may be the solution. The author has drawn on his own teaching experience to write a book ideally suited to graduate courses. The reader does not require a broad background to understand the material. Important open problems are included to give students and professionals alike ideas for further research.

Preface
1. Greedy approximation with respect to bases
2. Greedy approximation with respect to dictionaries: Hilbert spaces
3. The entropy
4. Approximation in learning theory
5. Approximation in compressed sensing
6. Greedy approximation with respect to dictionaries: Banach spaces
References
Index.

Subject Areas: Computing & information technology [U], Numerical analysis [PBKS]