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...

Full description

Saved in:
Bibliographic Details
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!
id 500807191
ctrlnum (MiAaPQ)500807191
(Au-PeEL)EBL807191
(CaPaEBR)ebr10514275
(CaONFJC)MIL334243
(OCoLC)763159240
collection bib_alma
record_format marc
spelling Temlyakov, Vladimir, 1953-
Greedy approximation [electronic resource] / Vladimir Temlyakov.
Cambridge ; New York : Cambridge University Press, 2011.
xiv, 418 p.
Cambridge monographs on applied and computational mathematics ; 20
Includes bibliographical references and index.
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.
"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"-- Provided by publisher.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Approximation theory.
Electronic books.
ProQuest (Firm)
Cambridge monographs on applied and computational mathematics ; 20.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=807191 Click to View
language English
format Electronic
eBook
author Temlyakov, Vladimir, 1953-
spellingShingle Temlyakov, Vladimir, 1953-
Greedy approximation
Cambridge monographs on applied and computational mathematics ;
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.
author_facet Temlyakov, Vladimir, 1953-
ProQuest (Firm)
ProQuest (Firm)
author_variant v t vt
author2 ProQuest (Firm)
author2_role TeilnehmendeR
author_corporate ProQuest (Firm)
author_sort Temlyakov, Vladimir, 1953-
title Greedy approximation
title_full Greedy approximation [electronic resource] / Vladimir Temlyakov.
title_fullStr Greedy approximation [electronic resource] / Vladimir Temlyakov.
title_full_unstemmed Greedy approximation [electronic resource] / Vladimir Temlyakov.
title_auth Greedy approximation
title_new Greedy approximation
title_sort greedy approximation
series Cambridge monographs on applied and computational mathematics ;
series2 Cambridge monographs on applied and computational mathematics ;
publisher Cambridge University Press,
publishDate 2011
physical xiv, 418 p.
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.
isbn 9781139157551 (electronic bk.)
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA221
callnumber-sort QA 3221 T455 42011
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=807191
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 518 - Numerical analysis
dewey-full 518/.5
dewey-sort 3518 15
dewey-raw 518/.5
dewey-search 518/.5
oclc_num 763159240
work_keys_str_mv AT temlyakovvladimir greedyapproximation
AT proquestfirm greedyapproximation
status_str n
ids_txt_mv (MiAaPQ)500807191
(Au-PeEL)EBL807191
(CaPaEBR)ebr10514275
(CaONFJC)MIL334243
(OCoLC)763159240
hierarchy_parent_title Cambridge monographs on applied and computational mathematics ; 20
hierarchy_sequence 20.
is_hierarchy_title Greedy approximation
container_title Cambridge monographs on applied and computational mathematics ; 20
author2_original_writing_str_mv noLinkedField
_version_ 1792330722970697728
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03154nam a2200397 a 4500</leader><controlfield tag="001">500807191</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">110611s2011 enk sb 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2011025053</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107003378 (hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139157551 (electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)500807191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL807191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10514275</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL334243</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)763159240</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA221</subfield><subfield code="b">.T455 2011</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">518/.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Temlyakov, Vladimir,</subfield><subfield code="d">1953-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Greedy approximation</subfield><subfield code="h">[electronic resource] /</subfield><subfield code="c">Vladimir Temlyakov.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 418 p.</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge monographs on applied and computational mathematics ;</subfield><subfield code="v">20</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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"--</subfield><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Approximation theory.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge monographs on applied and computational mathematics ;</subfield><subfield code="v">20.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=807191</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>