Greedy approximation:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2011
|
Schriftenreihe: | Cambridge monographs on applied and computational mathematics
20 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIV, 418 S. |
ISBN: | 9781107003378 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV039700452 | ||
003 | DE-604 | ||
005 | 20121109 | ||
007 | t | ||
008 | 111115s2011 |||| 00||| eng d | ||
020 | |a 9781107003378 |9 978-1-107-00337-8 | ||
035 | |a (OCoLC)762123017 | ||
035 | |a (DE-599)HEB268430705 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-634 |a DE-739 |a DE-188 |a DE-83 |a DE-703 | ||
082 | 0 | |a 511.4 | |
084 | |a SK 470 |0 (DE-625)143241: |2 rvk | ||
084 | |a 41A46 |2 msc | ||
100 | 1 | |a Temlyakov, Vladimir |d 1953- |e Verfasser |0 (DE-588)102386116X |4 aut | |
245 | 1 | 0 | |a Greedy approximation |c Vladimir Temlyakov |
264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2011 | |
300 | |a XIV, 418 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Cambridge monographs on applied and computational mathematics |v 20 | |
650 | 0 | 7 | |a Nichtlineare Approximation |0 (DE-588)4127922-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |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 | |5 DE-604 | |
830 | 0 | |a Cambridge monographs on applied and computational mathematics |v 20 |w (DE-604)BV011073737 |9 20 | |
856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024549013&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-024549013 |
Datensatz im Suchindex
_version_ | 1804148573490642944 |
---|---|
adam_text | Contents
Preface
page
ix
Greedy approximation with regard to bases
Introduction
Schauder
bases in Banach spaces
Greedy bases
Quasi-greedy and almost greedy bases
Weak Greedy Algorithms with respect to bases
Thresholding and minimal systems
Greedy approximation with respect to the trigonometric
system
Greedy-type bases; direct and inverse theorems
Some further results
Systems
L p
-equivalent to the
Haar
basis
Open problems
Greedy approximation with respect to dictionaries:
Hilbert spaces
Introduction
Convergence
Rate of convergence
Greedy algorithms for systems that are not dictionaries
Greedy approximation with respect to
λ
-quasi-orthogonal
dictionaries
Lebesgue-type inequalities for greedy approximation
Saturation property of greedy-type algorithms
Some further remarks
Open problems
Entropy
Introduction: definitions and some simple properties
vi
Contents
3.2
Finite
dimensional
spaces
144
3.3
Trigonometric polynomials and volume estimates
151
3.4
The function classes
165
3.5
General inequalities
168
3.6
Some further remarks
175
3.7
Open problems
182
4
Approximation in learning theory
183
4.1
Introduction
183
4.2
Some basic concepts of probability theory
189
4.3
Improper function learning; upper estimates
206
4.4
Proper function learning; upper estimates
235
4.5
The lower estimates
253
4.6
Application of greedy algorithms in learning theory
270
5
Approximation in compressed sensing
277
5.1
Introduction
277
5.2
Equivalence of three approximation properties of the
compressed sensing matrix
283
5.3
Construction of a good matrix
287
5.4
Dealing with noisy data
294
5.5
First results on exact recovery of sparse signals;
the Orthogonal Greedy Algorithm
298
5.6
Exact recovery of sparse signals; the Subspace Pursuit
Algorithm
305
5.7
On the size of incoherent systems
314
5.8
Restricted Isometry Property for random matrices
327
5.9
Some further remarks
330
5.10
Open problems
332
6
Greedy approximation with respect to dictionaries:
Banach spaces
334
6.1
Introduction
334
6.2
The Weak Chebyshev Greedy Algorithm
340
6.3
Relaxation; co-convex approximation
347
6.4
Free relaxation
350
6.5
Fixed relaxation
354
6.6
Thresholding algorithms
359
6.7
Greedy expansions
363
6.8
Relaxation; X-greedy algorithms
378
6.9
Incoherent dictionaries and exact recovery
381
6.10
Greedy algorithms with approximate evaluations
and restricted search
385
Contents
vii
6.11 An
application
of greedy algorithms for the discrepancy
estimates
390
6.12
Open problems
404
References
405
Index
415
|
any_adam_object | 1 |
author | Temlyakov, Vladimir 1953- |
author_GND | (DE-588)102386116X |
author_facet | Temlyakov, Vladimir 1953- |
author_role | aut |
author_sort | Temlyakov, Vladimir 1953- |
author_variant | v t vt |
building | Verbundindex |
bvnumber | BV039700452 |
classification_rvk | SK 470 |
ctrlnum | (OCoLC)762123017 (DE-599)HEB268430705 |
dewey-full | 511.4 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.4 |
dewey-search | 511.4 |
dewey-sort | 3511.4 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01729nam a2200409 cb4500</leader><controlfield tag="001">BV039700452</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20121109 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">111115s2011 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107003378</subfield><subfield code="9">978-1-107-00337-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)762123017</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)HEB268430705</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-703</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.4</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 470</subfield><subfield code="0">(DE-625)143241:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">41A46</subfield><subfield code="2">msc</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="0">(DE-588)102386116X</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 [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 418 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</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="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">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">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="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge monographs on applied and computational mathematics</subfield><subfield code="v">20</subfield><subfield code="w">(DE-604)BV011073737</subfield><subfield code="9">20</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024549013&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024549013</subfield></datafield></record></collection> |
id | DE-604.BV039700452 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T00:09:17Z |
institution | BVB |
isbn | 9781107003378 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024549013 |
oclc_num | 762123017 |
open_access_boolean | |
owner | DE-634 DE-739 DE-188 DE-83 DE-703 |
owner_facet | DE-634 DE-739 DE-188 DE-83 DE-703 |
physical | XIV, 418 S. |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Cambridge Univ. Press |
record_format | marc |
series | Cambridge monographs on applied and computational mathematics |
series2 | Cambridge monographs on applied and computational mathematics |
spelling | Temlyakov, Vladimir 1953- Verfasser (DE-588)102386116X aut Greedy approximation Vladimir Temlyakov Cambridge [u.a.] Cambridge Univ. Press 2011 XIV, 418 S. txt rdacontent n rdamedia nc rdacarrier Cambridge monographs on applied and computational mathematics 20 Nichtlineare Approximation (DE-588)4127922-0 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 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 DE-604 Cambridge monographs on applied and computational mathematics 20 (DE-604)BV011073737 20 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024549013&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Temlyakov, Vladimir 1953- Greedy approximation Cambridge monographs on applied and computational mathematics Nichtlineare Approximation (DE-588)4127922-0 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Greedy-Algorithmus (DE-588)4331446-6 gnd |
subject_GND | (DE-588)4127922-0 (DE-588)4500954-5 (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 | Nichtlineare Approximation (DE-588)4127922-0 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Greedy-Algorithmus (DE-588)4331446-6 gnd |
topic_facet | Nichtlineare Approximation Approximationsalgorithmus Greedy-Algorithmus |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024549013&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV011073737 |
work_keys_str_mv | AT temlyakovvladimir greedyapproximation |