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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Temlyakov, Vladimir (Autor)
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Tikhonov, Sergey (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Basel : Springer Basel : Imprint: Birkhäuser, 2015.
Edición:1st ed. 2015.
Colección:Advanced Courses in Mathematics - CRM Barcelona,
Temas:
Approximation theory.
Functional analysis.
Algorithms.
Approximations and Expansions.
Functional Analysis.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-0348-0890-3
003 DE-He213
005 20220116021159.0
007 cr nn 008mamaa
008 150327s2015 sz | s |||| 0|eng d
020 |a 9783034808903  |9 978-3-0348-0890-3 
024 7 |a 10.1007/978-3-0348-0890-3  |2 doi 
050 4 |a QA221-224 
072 7 |a PBKJ  |2 bicssc 
072 7 |a MAT034000  |2 bisacsh 
072 7 |a PBKJ  |2 thema 
082 0 4 |a 511.4  |2 23 
100 1 |a Temlyakov, Vladimir.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Sparse Approximation with Bases  |h [electronic resource] /  |c by Vladimir Temlyakov ; edited by Sergey Tikhonov. 
250 |a 1st ed. 2015. 
264 1 |a Basel :  |b Springer Basel :  |b Imprint: Birkhäuser,  |c 2015. 
300 |a XI, 261 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Advanced Courses in Mathematics - CRM Barcelona,  |x 2297-0312 
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. 
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. 
650 0 |a Approximation theory. 
650 0 |a Functional analysis. 
650 0 |a Algorithms. 
650 1 4 |a Approximations and Expansions. 
650 2 4 |a Functional Analysis. 
650 2 4 |a Algorithms. 
700 1 |a Tikhonov, Sergey.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783034808910 
776 0 8 |i Printed edition:  |z 9783034808897 
830 0 |a Advanced Courses in Mathematics - CRM Barcelona,  |x 2297-0312 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-0348-0890-3  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares