Cantitate/Preț
Produs

Sparse Approximation with Bases (Advanced Courses in Mathematics - CRM Barcelona)

De (autor) Editat de Sergey Tikhonov
Notă GoodReads:
en Limba Engleză Carte Paperback – 17 Apr 2015
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.
Citește tot Restrânge

Din seria Advanced Courses in Mathematics - CRM Barcelona

Preț: 16721 lei

Preț vechi: 19637 lei
-15%

Puncte Express: 251

Preț estimativ în valută:
3344 3686$ 2872£

Carte disponibilă

Livrare economică 04-18 decembrie
Livrare express 23 noiembrie-03 decembrie pentru 8978 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783034808897
ISBN-10: 3034808895
Pagini: 280
Ilustrații: Bibliographie
Dimensiuni: 168 x 240 x 15 mm
Greutate: 0.54 kg
Ediția: 2015
Editura: Springer
Colecția Birkhäuser
Seria Advanced Courses in Mathematics - CRM Barcelona

Locul publicării: Basel, Switzerland

Public țintă

Graduate

Cuprins

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

Recenzii

“This book mainly deals with a kind of interesting and current nonlinear approximation called m-term approximation, or sparse approximation, with bases. … The book is based on numerous research papers of the author and is recommended to researchers working in approximation theory, numerical analysis, harmonic analysis and functional analysis. Also, it could be used for various graduate courses in the above mentioned topics.” (Sorin Gheorghe Gal, zbMATH 1317.41019, 2015)

Textul de pe ultima copertă

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.

Caracteristici

Features a thorough introduction into a new area of research (greedy approximation)

Deals with numerous applications

Recent fundamental results are combined with previous results to build the theory of greedy approximation​