Greedy Approximation (Hardcover, New)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Monographs on Applied and Computational Mathematics
Release date:	September 2011
First published:	August 2011
Authors:	Vladimir Temlyakov
Dimensions:	235 x 156 x 25mm (L x W x T)
Format:	Hardcover
Pages:	432
Edition:	New
ISBN-13:	978-1-107-00337-8
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Promotions
LSN:	1-107-00337-7
Barcode:	9781107003378

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!