東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Sparse approximation with bases

Temlyakov, Vladimir.

Linked to FindBook

Google Book

Amazon

博客來

Sparse approximation with bases

Record Type:	Electronic resources : Monograph/item
Title/Author:	Sparse approximation with bases/ by Vladimir Temlyakov ; edited by Sergey Tikhonov.
Author:	Temlyakov, Vladimir.
other author:	Tikhonov, Sergey.
Published:	Basel :Springer Basel : : 2015.,
Description:	xi, 261 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Approximation theory. -
Online resource:	http://dx.doi.org/10.1007/978-3-0348-0890-3
ISBN:	9783034808903 (electronic bk.)

Sparse approximation with bases
Temlyakov, Vladimir.

Sparse approximation with bases[electronic resource] /by Vladimir Temlyakov ; edited by Sergey Tikhonov. - Basel :Springer Basel :2015. - xi, 261 p. :ill., digital ;24 cm. - 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 (electronic bk.)

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

628068
Approximation theory.

LC Class. No.: QA221

Dewey Class. No.: 511.4

Sparse approximation with bases
LDR:02405nmm a2200325 a 4500 001 1998064
003 DE-He213
005 20151028171432.0
006 m d
007 cr nn 008maaau
008 151112s2015 sz s 0 eng d
020 $a 9783034808903 (electronic bk.)
020 $a 9783034808897 (paper)
024 7 $a 10.1007/978-3-0348-0890-3 $2 doi
035 $a 978-3-0348-0890-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA221
072 7 $a PBKJ $2 bicssc
072 7 $a MAT034000 $2 bisacsh
082 0 4 $a 511.4 $2 23
090 $a QA221 $b .T279 2015
100 1 $a Temlyakov, Vladimir. $3 2139580
245 1 0 $a Sparse approximation with bases $h [electronic resource] / $c by Vladimir Temlyakov ; edited by Sergey Tikhonov.
260 $a Basel : $b Springer Basel : $b Imprint: Birkhauser, $c 2015.
300 $a xi, 261 p. : $b ill., digital ; $c 24 cm.
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 628068
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Approximations and Expansions. $3 897324
650 2 4 $a Functional Analysis. $3 893943
650 2 4 $a Algorithms. $3 536374
700 1 $a Tikhonov, Sergey. $3 2072789
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Advanced courses in mathematics, CRM Barcelona. $3 2070343
856 4 0 $u http://dx.doi.org/10.1007/978-3-0348-0890-3
950 $a Mathematics and Statistics (Springer-11649)