Get Free Shipping on orders over $79
Sparse Approximation with Bases - Vladimir Temlyakov

Sparse Approximation with Bases

By: Vladimir Temlyakov

eText | 27 March 2015

At a Glance

eText


$50.00

or 4 interest-free payments of $12.50 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

More in Calculus & Mathematical Analysis

AI Breaking Boundaries - Avinash Vanam

eBOOK

The Monodromy Group - Henryk ?o??dek

eTEXT

Enriques Surfaces I - François Cossec

eTEXT