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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York
Cambridge University Press
2011
|
| Schriftenreihe: | Cambridge monographs on applied and computational mathematics
20 |
| Schlagworte: | |
| Zusammenfassung: | "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"-- |
| Beschreibung: | xiv, 418 p |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045252665 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181026s2011 |||| o||u| ||||||eng d | ||
| 035 | |a (ZDB-30-PAD)EBC807191 | ||
| 035 | |a (ZDB-89-EBL)EBL807191 | ||
| 035 | |a (ZDB-38-EBR)ebr10514275 | ||
| 035 | |a (OCoLC)763159240 | ||
| 035 | |a (DE-599)BVBBV045252665 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 518/.5 |2 23 | |
| 100 | 1 | |a Temlyakov, Vladimir |d 1953- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Greedy approximation |c Vladimir Temlyakov |
| 264 | 1 | |a Cambridge ; New York |b Cambridge University Press |c 2011 | |
| 300 | |a xiv, 418 p | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge monographs on applied and computational mathematics |v 20 | |
| 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"-- | ||
| 650 | 4 | |a Approximation theory | |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nichtlineare Approximation |0 (DE-588)4127922-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Greedy-Algorithmus |0 (DE-588)4331446-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Greedy-Algorithmus |0 (DE-588)4331446-6 |D s |
| 689 | 0 | 1 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 2 | |a Nichtlineare Approximation |0 (DE-588)4127922-0 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 710 | 2 | |a ProQuest (Firm) |e Sonstige |4 oth | |
| 912 | |a ZDB-30-PAD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030640640 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804178997949497344 |
|---|---|
| any_adam_object | |
| author | Temlyakov, Vladimir 1953- |
| author_facet | Temlyakov, Vladimir 1953- |
| author_role | aut |
| author_sort | Temlyakov, Vladimir 1953- |
| author_variant | v t vt |
| building | Verbundindex |
| bvnumber | BV045252665 |
| collection | ZDB-30-PAD |
| ctrlnum | (ZDB-30-PAD)EBC807191 (ZDB-89-EBL)EBL807191 (ZDB-38-EBR)ebr10514275 (OCoLC)763159240 (DE-599)BVBBV045252665 |
| dewey-full | 518/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.5 |
| dewey-search | 518/.5 |
| dewey-sort | 3518 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02866nmm a2200433zcb4500</leader><controlfield tag="001">BV045252665</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181026s2011 |||| o||u| ||||||eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC807191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL807191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10514275</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)763159240</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045252665</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><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><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Greedy approximation</subfield><subfield code="c">Vladimir Temlyakov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; 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="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge monographs on applied and computational mathematics</subfield><subfield code="v">20</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></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtlineare Approximation</subfield><subfield code="0">(DE-588)4127922-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Greedy-Algorithmus</subfield><subfield code="0">(DE-588)4331446-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Greedy-Algorithmus</subfield><subfield code="0">(DE-588)4331446-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Nichtlineare Approximation</subfield><subfield code="0">(DE-588)4127922-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030640640</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV045252665 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:12:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030640640 |
| oclc_num | 763159240 |
| open_access_boolean | |
| physical | xiv, 418 p |
| psigel | ZDB-30-PAD |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge monographs on applied and computational mathematics |
| spelling | Temlyakov, Vladimir 1953- Verfasser aut Greedy approximation Vladimir Temlyakov Cambridge ; New York Cambridge University Press 2011 xiv, 418 p txt rdacontent c rdamedia cr rdacarrier Cambridge monographs on applied and computational mathematics 20 "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"-- Approximation theory Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Nichtlineare Approximation (DE-588)4127922-0 gnd rswk-swf Greedy-Algorithmus (DE-588)4331446-6 gnd rswk-swf Greedy-Algorithmus (DE-588)4331446-6 s Approximationsalgorithmus (DE-588)4500954-5 s Nichtlineare Approximation (DE-588)4127922-0 s 1\p DE-604 ProQuest (Firm) Sonstige oth 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Temlyakov, Vladimir 1953- Greedy approximation Approximation theory Approximationsalgorithmus (DE-588)4500954-5 gnd Nichtlineare Approximation (DE-588)4127922-0 gnd Greedy-Algorithmus (DE-588)4331446-6 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4127922-0 (DE-588)4331446-6 |
| title | Greedy approximation |
| title_auth | Greedy approximation |
| title_exact_search | Greedy approximation |
| title_full | Greedy approximation Vladimir Temlyakov |
| title_fullStr | Greedy approximation Vladimir Temlyakov |
| title_full_unstemmed | Greedy approximation Vladimir Temlyakov |
| title_short | Greedy approximation |
| title_sort | greedy approximation |
| topic | Approximation theory Approximationsalgorithmus (DE-588)4500954-5 gnd Nichtlineare Approximation (DE-588)4127922-0 gnd Greedy-Algorithmus (DE-588)4331446-6 gnd |
| topic_facet | Approximation theory Approximationsalgorithmus Nichtlineare Approximation Greedy-Algorithmus |
| work_keys_str_mv | AT temlyakovvladimir greedyapproximation AT proquestfirm greedyapproximation |