Greedy Approximation

Vladimir Temlyakov

• Publisher: Cambridge University Press
• Year: 2011
• Print ISBN:
  9781107003378
• eBook ISBN:
  9781139153775
• Topic: Computer Science
• Subtopic: Programming Algorithms
• Index: Computer Science

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.

Table of contents

• Cover
• CAMBRIDGE MONOGRAPHS ON APPLIED AND COMPUTATIONAL MATHEMATICS
• Title
• Copyright
• Contents
• Preface
• 1 Greedy approximation with regard to bases
• 2 Greedy approximation with respect to dictionaries: Hilbert spaces
• 3 Entropy
• 4 Approximation in learning theory
• 5 Approximation in compressed sensing
• 6 Greedy approximation with respect to dictionaries: Banach spaces
• References
• Index