000			03021nam a2200337 a 4500
001			ebr10514275
003			CaPaEBR
006			m u
007			cr cn|||||||||
008			110611s2011 enk sb 001 0 eng d
010			_z 2011025053
020			_z9781107003378 (hardback)
020			_z9781139157551 (e-book)
040			_aCaPaEBR _cCaPaEBR
035			_a(OCoLC)773039084
050	1	4	_aQA221 _b.T455 2011eb
082	0	4	_a518/.5 _223
100	1		_aTemlyakov, Vladimir, _d1953-
245	1	0	_aGreedy approximation _h[electronic resource] / _cVladimir Temlyakov.
260			_aCambridge ; _aNew York : _bCambridge University Press, _c2011.
300			_axiv, 418 p.
490	1		_aCambridge monographs on applied and computational mathematics ; _v20
504			_aIncludes bibliographical references and index.
505	8		_aMachine 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"-- _cProvided by publisher.
533			_aElectronic reproduction. _bPalo Alto, Calif. : _cebrary, _d2013. _nAvailable via World Wide Web. _nAccess may be limited to ebrary affiliated libraries.
650		0	_aApproximation theory.
655		7	_aElectronic books. _2local
710	2		_aebrary, Inc.
830		0	_aCambridge monographs on applied and computational mathematics ; _v20.
856	4	0	_uhttp://site.ebrary.com/lib/daystar/Doc?id=10514275 _zAn electronic book accessible through the World Wide Web; click to view
999			_c196623 _d196623