Published December 31, 2009 | Version v1
Journal article Metadata-only

Lower bounds for the rate of convergence of greedy algorithms

Creators

  • 1. M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

Description

We obtain a lower bound for the rate of convergence of a pure greedy algorithm in the spaces A0(D) and A1(D), and this bound turns out to be very close to the best known upper bound. We also obtain a precise lower bound for the rate of convergence of the orthogonal greedy algorithm in the space A0(D).

Availability note (English)

Available from http://dx.doi.org/10.1070/IM2009v073n06ABEH002478

Additional details

Identifiers

DOI
10.1070/IM2009v073n06ABEH002478;

Publishing Information

Journal Title
Izvestiya. Mathematics
Journal Volume
73
Journal Issue
6
Journal Page Range
p. 1197-1215
ISSN
1064-5632

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
41047662
Subject category
S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
ALGORITHMS; CONVERGENCE; MATHEMATICAL SPACE
Descriptors DEC
MATHEMATICAL LOGIC; SPACE