LEADER 03797nam 22006975 450 001 9910299772603321 005 20200701072513.0 010 $a3-0348-0890-9 024 7 $a10.1007/978-3-0348-0890-3 035 $a(CKB)3710000000379555 035 $a(SSID)ssj0001465723 035 $a(PQKBManifestationID)11896969 035 $a(PQKBTitleCode)TC0001465723 035 $a(PQKBWorkID)11487003 035 $a(PQKB)10567206 035 $a(DE-He213)978-3-0348-0890-3 035 $a(MiAaPQ)EBC6312834 035 $a(MiAaPQ)EBC5592127 035 $a(Au-PeEL)EBL5592127 035 $a(OCoLC)1066196746 035 $a(PPN)184895294 035 $a(EXLCZ)993710000000379555 100 $a20150327d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSparse Approximation with Bases /$fby Vladimir Temlyakov ; edited by Sergey Tikhonov 205 $a1st ed. 2015. 210 1$aBasel :$cSpringer Basel :$cImprint: Birkhäuser,$d2015. 215 $a1 online resource (XI, 261 p.) 225 1 $aAdvanced Courses in Mathematics - CRM Barcelona,$x2297-0304 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-0348-0889-5 327 $aIntroduction -- Lebesgue-type inequalities for greedy approximation with respect to some classical bases -- Quasi-greedy bases and Lebesgue-type inequalities -- Almost greedy bases and duality -- Greedy approximation with respect to the trigonometric system -- Greedy approximation with respect to dictionaries -- Appendix. 330 $aThis book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and does not require a broad background in the field. 410 0$aAdvanced Courses in Mathematics - CRM Barcelona,$x2297-0304 606 $aApproximation theory 606 $aFunctional analysis 606 $aAlgorithms 606 $aApproximations and Expansions$3https://scigraph.springernature.com/ontologies/product-market-codes/M12023 606 $aFunctional Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M12066 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 615 0$aApproximation theory. 615 0$aFunctional analysis. 615 0$aAlgorithms. 615 14$aApproximations and Expansions. 615 24$aFunctional Analysis. 615 24$aAlgorithms. 676 $a510 676 $a511.4 700 $aTemlyakov$b Vladimir$4aut$4http://id.loc.gov/vocabulary/relators/aut$0755518 702 $aTikhonov$b Sergey$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299772603321 996 $aSparse approximation with bases$91522479 997 $aUNINA