Greedy Approximation

Greedy Approximation

EnglishHardbackPrint on demand
Temlyakov Vladimir
Cambridge University Press
EAN: 9781107003378
Print on demand
Delivery on Thursday, 16. of July 2026
CZK 1,809
Common price CZK 2,010
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

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.
EAN 9781107003378
ISBN 1107003377
Binding Hardback
Publisher Cambridge University Press
Publication date September 8, 2011
Pages 432
Language English
Dimensions 235 x 156 x 25
Country United Kingdom
Authors Temlyakov Vladimir
Series Cambridge Monographs on Applied and Computational Mathematics
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.