Greedy expansions in Banach spaces


    loading  Checking for direct PDF access through Ovid

Abstract

We study convergence and rate of convergence of expansions of elements in a Banach space X into series with regard to a given dictionary 𝒟. For convenience we assume that 𝒟 is symmetric: g ∈ 𝒟 implies − g ∈ 𝒟. The primary goal of this paper is to study representations of an element fX by a series. In building such a representation we should construct two sequences: and. In this paper the construction of {gj (f)} j=1 will be based on ideas used in greedy-type nonlinear approximation. This explains the use of the term greedy expansion. We use a norming functional of a residual fm-1 obtained after m-1 steps of an expansion procedure to select the m th element from the dictionary. This approach has been used in previous papers on greedy approximation. The greedy expansions in Hilbert spaces are well studied. The corresponding convergence theorems and estimates for the rate of convergence are known. Much less is known about greedy expansions in Banach spaces. The first substantial result on greedy expansions in Banach spaces has been obtained recently by Ganichev and Kalton. They proved a convergence result for the Lp, 1<p<, spaces. In this paper we find a simple way of selecting coefficients cm (f) that provides convergence of the corresponding greedy expansions in any uniformly smooth Banach space. Moreover, we obtain estimates for the rate of convergence of such greedy expansions for – the closure (in X) of the convex hull of 𝒟

    loading  Loading Related Articles