Greedy approximation

"An introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. This book possesses features of both a survey paper and a textbook. The majority of results are given with proofs. However,some important results with technically involved proofs are presented w...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: Temlyakov, Vladimir, 1953-
Institutionell upphovsman: ebrary, Inc
Materialtyp: Elektronisk E-bok
Språk:engelska
Publicerad: Cambridge ; New York : Cambridge University Press, 2011.
Serie:Cambridge monographs on applied and computational mathematics ; 20.
Ämnen:
Länkar:An electronic book accessible through the World Wide Web; click to view
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!
Innehållsförteckning:
  • Machine generated contents note: Preface; 1. Greedy approximation with respect to bases; 2. Greedy approximation with respect to dictionaries: Hilbert spaces; 3. The entropy; 4. Approximation in learning theory; 5. Approximation in compressed sensing; 6. Greedy approximation with respect to dictionaries: Banach spaces; References; Index.