Greedy Approximation by Vladimir Temlyakov

Greedy Approximation by Vladimir Temlyakov

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.

SKU	Unavailable
ISBN 13
Title	Greedy Approximation
Author	Vladimir Temlyakov
Condition	Unavailable
Binding Type
Publisher
Year published
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.