Vai al contenuto principale della pagina

Greedy approximation / / Vladimir Temlyakov [[electronic resource]]



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Temlyakov Vladimir <1953-> Visualizza persona
Titolo: Greedy approximation / / Vladimir Temlyakov [[electronic resource]] Visualizza cluster
Pubblicazione: Cambridge : , : Cambridge University Press, , 2011
Descrizione fisica: 1 online resource (xiv, 418 pages) : digital, PDF file(s)
Disciplina: 518/.5
Soggetto topico: Approximation theory
Compressed sensing (Telecommunication)
Classificazione: MAT034000
Note generali: Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 1. Greedy approximation with respect to bases -- 2. Greedy approximation with respect to dictionaries: Hilbert spaces -- 3. Entropy -- 4. Approximation in learning theory -- 5. Approximation in compressed sensing -- 6. Greedy approximation with respect to dictionaries: Banach spaces.
Sommario/riassunto: This first book on greedy approximation gives a systematic presentation of the fundamental results. It also contains an introduction to two hot topics in numerical mathematics: learning theory and compressed sensing. Nonlinear approximation is becoming increasingly important, especially since two types are frequently employed in applications: adaptive methods are used in PDE solvers, while m-term approximation is used in image/signal/data processing, as well as in the design of neural networks. The fundamental question of nonlinear approximation is how to devise good constructive methods (algorithms) and recent results have established that greedy type algorithms may be the solution. The author has drawn on his own teaching experience to write a book ideally suited to graduate courses. The reader does not require a broad background to understand the material. Important open problems are included to give students and professionals alike ideas for further research.
Titolo autorizzato: Greedy approximation  Visualizza cluster
ISBN: 1-107-22690-2
1-283-34243-X
1-139-16037-0
9786613342430
0-511-76229-1
1-139-16137-7
1-139-15580-6
1-139-15932-1
1-139-15755-8
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910781574003321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Cambridge monographs on applied and computational mathematics ; ; 20.