Greedy Approximation: 20 (Cambridge Monographs on Applied and Computational Mathematics, Series Number 20) - Hardcover

Temlyakov, Vladimir

Hardcover

ISBN 10: 1107003377 ISBN 13: 9781107003378

Publisher: Cambridge University Press, 2011

Synopsis

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.

About this title

About the Author

Vladimir Temlyakov is Carolina Distinguished Professor in the Department of Mathematics at the University of South Carolina.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2011
• Language: English
• ISBN 10: 1107003377
• ISBN 13: 9781107003378
• Binding: Hardcover
• Number of pages: 432