# Greedy Approximation with Regard to Bases and General Minimal Systems

Serdica Mathematical Journal (2002)

- Volume: 28, Issue: 4, page 305-328
- ISSN: 1310-6600

## Access Full Article

top## Abstract

top## How to cite

topKonyagin, S., and Temlyakov, V.. "Greedy Approximation with Regard to Bases and General Minimal Systems." Serdica Mathematical Journal 28.4 (2002): 305-328. <http://eudml.org/doc/11566>.

@article{Konyagin2002,

abstract = {*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003This paper is a survey which also contains some new results on
the nonlinear approximation with regard to a basis or, more generally, with
regard to a minimal system. Approximation takes place in a Banach or in
a quasi-Banach space. The last decade was very successful in studying nonlinear
approximation. This was motivated by numerous applications. Nonlinear
approximation is important in applications because of its increased
efficiency. Two types of nonlinear approximation are employed frequently
in applications. Adaptive methods are used in PDE solvers. The m-term
approximation considered here is used in image and signal processing as well
as the design of neural networks. The basic idea behind nonlinear approximation
is that the elements used in the approximation do not come from
a fixed linear space but are allowed to depend on the function being approximated.
The fundamental question of nonlinear approximation is how
to construct good methods (algorithms) of nonlinear approximation. In this
paper we discuss greedy type and thresholding type algorithms.},

author = {Konyagin, S., Temlyakov, V.},

journal = {Serdica Mathematical Journal},

keywords = {Greedy Bases; Quasi-Greedy Bases; Almost Greedy Bases; M-term Approximation; Weak Greedy Algorithms; Thresholding Approximation; Minimal Systems; A-Convergence; greedy bases; -term approximation; minimal system; A-convergence},

language = {eng},

number = {4},

pages = {305-328},

publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},

title = {Greedy Approximation with Regard to Bases and General Minimal Systems},

url = {http://eudml.org/doc/11566},

volume = {28},

year = {2002},

}

TY - JOUR

AU - Konyagin, S.

AU - Temlyakov, V.

TI - Greedy Approximation with Regard to Bases and General Minimal Systems

JO - Serdica Mathematical Journal

PY - 2002

PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences

VL - 28

IS - 4

SP - 305

EP - 328

AB - *This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003This paper is a survey which also contains some new results on
the nonlinear approximation with regard to a basis or, more generally, with
regard to a minimal system. Approximation takes place in a Banach or in
a quasi-Banach space. The last decade was very successful in studying nonlinear
approximation. This was motivated by numerous applications. Nonlinear
approximation is important in applications because of its increased
efficiency. Two types of nonlinear approximation are employed frequently
in applications. Adaptive methods are used in PDE solvers. The m-term
approximation considered here is used in image and signal processing as well
as the design of neural networks. The basic idea behind nonlinear approximation
is that the elements used in the approximation do not come from
a fixed linear space but are allowed to depend on the function being approximated.
The fundamental question of nonlinear approximation is how
to construct good methods (algorithms) of nonlinear approximation. In this
paper we discuss greedy type and thresholding type algorithms.

LA - eng

KW - Greedy Bases; Quasi-Greedy Bases; Almost Greedy Bases; M-term Approximation; Weak Greedy Algorithms; Thresholding Approximation; Minimal Systems; A-Convergence; greedy bases; -term approximation; minimal system; A-convergence

UR - http://eudml.org/doc/11566

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.