Greedy approximation / Vladimir Temlyakov.
"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...
Saved in:
| Superior document: | Cambridge monographs on applied and computational mathematics ; 20 |
|---|---|
| : | |
| TeilnehmendeR: | |
| Year of Publication: | 2011 |
| Language: | English |
| Series: | Cambridge monographs on applied and computational mathematics ;
20. |
| Online Access: | |
| Physical Description: | xiv, 418 p. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.