Sparse Approximation with Bases

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

Full description

Bibliographic Details
Main Author: Temlyakov, Vladimir
Other Authors: Tikhonov, Sergey (Editor)
Format: eBook
Language:English
Published: Basel Birkhäuser 2015, 2015
Edition:1st ed. 2015
Series:Advanced Courses in Mathematics - CRM Barcelona
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02458nmm a2200325 u 4500
001 EB001029212
003 EBX01000000000000000822802
005 00000000000000.0
007 cr|||||||||||||||||||||
008 150402 ||| eng
020 |a 9783034808903 
100 1 |a Temlyakov, Vladimir 
245 0 0 |a Sparse Approximation with Bases  |h Elektronische Ressource  |c by Vladimir Temlyakov ; edited by Sergey Tikhonov 
250 |a 1st ed. 2015 
260 |a Basel  |b Birkhäuser  |c 2015, 2015 
300 |a XI, 261 p  |b online resource 
505 0 |a Introduction -- 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 
653 |a Functional analysis 
653 |a Functional Analysis 
653 |a Algorithms 
653 |a Approximations and Expansions 
653 |a Approximation theory 
700 1 |a Tikhonov, Sergey  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Advanced Courses in Mathematics - CRM Barcelona 
028 5 0 |a 10.1007/978-3-0348-0890-3 
856 4 0 |u https://doi.org/10.1007/978-3-0348-0890-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.4 
520 |a This 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