Greedy Approximation (BOK)

Vladimir Temlyakov

889,00 88900
Sendes vanligvis innen 5-15 dager
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.

Produktfakta

Språk Engelsk Engelsk Innbinding Innbundet
Utgitt 2011 Forfatter Vladimir Temlyakov
Forlag
CAMBRIDGE UNIVERSITY PRESS
ISBN 9781107003378
Antall sider 432 Dimensjoner 15,2cm x 22,8cm x 2,5cm
Vekt 760 gram Leverandør Bertram Trading Ltd
Emner og form Numerical analysis