國立虎尾科技大學 |

Sparse Approximation with Bases

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Sparse Approximation with Bases/ by Vladimir Temlyakov ; edited by Sergey Tikhonov.
Author:	Temlyakov, Vladimir.
other author:	Tikhonov, Sergey.
Description:	XI, 261 p.online resource. :
Contained By:	Springer Nature eBook
Subject:	Approximation theory. -
Online resource:	https://doi.org/10.1007/978-3-0348-0890-3
ISBN:	9783034808903

Sparse Approximation with Bases
Temlyakov, Vladimir.

Sparse Approximation with Bases[electronic resource] /by Vladimir Temlyakov ; edited by Sergey Tikhonov. - 1st ed. 2015. - XI, 261 p.online resource. - Advanced Courses in Mathematics - CRM Barcelona,2297-0304. - Advanced Courses in Mathematics - CRM Barcelona,.

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.

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.

ISBN: 9783034808903

Standard No.: 10.1007/978-3-0348-0890-3doiSubjects--Topical Terms:

527707
Approximation theory.

LC Class. No.: QA401-425

Dewey Class. No.: 511.4

Sparse Approximation with Bases
LDR:02748nam a22003975i 4500 001 967806
003 DE-He213
005 20200701072513.0
007 cr nn 008mamaa
008 201211s2015 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
035 $a 978-3-0348-0890-3
050 4 $a QA401-425
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. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1210558
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-0304
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. $3 527707
650 0 $a Functional analysis. $3 527706
650 0 $a Algorithms. $3 527865
650 1 4 $a Approximations and Expansions. $3 672153
650 2 4 $a Functional Analysis. $3 672166
700 1 $a Tikhonov, Sergey. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1065978
710 2 $a SpringerLink (Online service) $3 593884
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-0304 $3 1257135
856 4 0 $u https://doi.org/10.1007/978-3-0348-0890-3
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)