LEADER 03421nam  22006852  450 
001 9910781574003321
005 20151005020622.0
010   $a1-107-22690-2
010   $a1-283-34243-X
010   $a1-139-16037-0
010   $a9786613342430
010   $a0-511-76229-1
010   $a1-139-16137-7
010   $a1-139-15580-6
010   $a1-139-15932-1
010   $a1-139-15755-8
035   $a(CKB)2550000000065970
035   $a(EBL)807191
035   $a(OCoLC)763159240
035   $a(SSID)ssj0000554817
035   $a(PQKBManifestationID)11368622
035   $a(PQKBTitleCode)TC0000554817
035   $a(PQKBWorkID)10517171
035   $a(PQKB)11210047
035   $a(UkCbUP)CR9780511762291
035   $a(MiAaPQ)EBC807191
035   $a(Au-PeEL)EBL807191
035   $a(CaPaEBR)ebr10514275
035   $a(CaONFJC)MIL334243
035   $a(PPN)261291270
035   $a(EXLCZ)992550000000065970
100   $a20100506d2011||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGreedy approximation /$fVladimir Temlyakov$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2011.
215   $a1 online resource (xiv, 418 pages) $cdigital, PDF file(s)
225 1 $aCambridge monographs on applied and computational mathematics ;$v20
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a1-107-00337-7 
320   $aIncludes bibliographical references and index.
327   $a1. Greedy approximation with respect to bases -- 2. Greedy approximation with respect to dictionaries: Hilbert spaces -- 3. Entropy -- 4. Approximation in learning theory -- 5. Approximation in compressed sensing -- 6. Greedy approximation with respect to dictionaries: Banach spaces.
330   $aThis first book on greedy approximation gives a systematic presentation of the fundamental results. It also contains an introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. Nonlinear approximation is becoming increasingly important, especially since two types are frequently employed in applications: adaptive methods are used in PDE solvers, while m-term approximation is used in image/signal/data processing, as well as in the design of neural networks. The fundamental question of nonlinear approximation is how to devise good constructive methods (algorithms) and recent results have established that greedy type algorithms may be the solution. The author has drawn on his own teaching experience to write a book ideally suited to graduate courses. The reader does not require a broad background to understand the material. Important open problems are included to give students and professionals alike ideas for further research.
410  0$aCambridge monographs on applied and computational mathematics ;$v20.
606   $aApproximation theory
606   $aCompressed sensing (Telecommunication)
615  0$aApproximation theory.
615  0$aCompressed sensing (Telecommunication)
676   $a518/.5
686   $aMAT034000$2bisacsh
700   $aTemlyakov$b Vladimir$f1953-$01561800
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910781574003321
996   $aGreedy approximation$93828818
997   $aUNINA