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...
Saved in:
Main Author:  

Format:  eBook 
Language:  English 
Published: 
Cambridge ; New York :
Cambridge University Press,
2011.

Series:  Cambridge monographs on applied and computational mathematics ;
20. 
Subjects:  
Online Access:  Subscribed ebook (available only in University campuswide network);click to view 
Tags: 
Add Tag
No Tags, Be the first to tag this record!

LEADER  03061nam a2200349 a 4500  

001  ebr10514275  
003  CaPaEBR  
006  m u  
007  cr cn  
008  110611s2011 enk sb 001 0 eng d  
010  z 2011025053  
020  z 9781107003378 (hardback)  
020  z 9781139157551 (ebook)  
040  a CaPaEBR c CaPaEBR  
035  a (OCoLC)773039084  
050  1  4  a QA221 b .T455 2011eb 
082  0  4  a 518/.5 2 23 
100  1  a Temlyakov, Vladimir, d 1953  
245  1  0  a Greedy approximation h [electronic resource] / c Vladimir Temlyakov. 
260  a Cambridge ; a New York : b Cambridge University Press, c 2011.  
300  a xiv, 418 p.  
490  1  a Cambridge monographs on applied and computational mathematics ; v 20  
504  a Includes bibliographical references and index.  
505  8  a 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.  
520  a "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 without proof. We included proofs of the most important and typical results; and we tried to include those proofs which demonstrate different ideas and are based on different techniques. In this sense the book has a feature of a survey  it tries to cover broad material. On the other hand, we limit ourselves to a systematic treatment of a specific topic rather than trying to give an overview of all related topics. In this sense the book is close to a textbook. There are many papers on theoretical and computational aspects of greedy approximation, learning theory and compressed sensing. We have chosen to cover the mathematical foundations of greedy approximation, learning theory and compressed sensing. The book is addressed to researchers working in numerical mathematics, analysis, functional analysis and statistics. It quickly takes the reader from classical results to the frontier of the unknown, but is written at the level of a graduate course and does not require a broad background in order to understand the topics" c Provided by publisher.  
533  a Electronic reproduction. b Palo Alto, Calif. : c ebrary, d 2013. n Available via World Wide Web. n Access may be limited to ebrary affiliated libraries.  
650  0  a Approximation theory.  
655  7  a Electronic books. 2 local  
830  0  a Cambridge monographs on applied and computational mathematics ; v 20.  
856  4  0  u http://site.ebrary.com/lib/unicalicut/Doc?id=10514275 z Subscribed ebook (available only in University campuswide network);click to view 
952  a ON c EBR y EB  
999  c ebr10514275 