Greedy Algorithms in Banach Spaces

Abstract

We study efficiency of approximation and convergence of two greedy type algorithms in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA) is defined for an arbitrary dictionary D and provides nonlinear m-term approximation with regard to D. This algorithm is defined inductively with the m-th step consisting of two basic substeps.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2000
Accession Number
ADA637095

Entities

People

  • V. N. Temlyakov

Organizations

  • University of South Carolina

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Banach Space
  • Functional Analysis
  • Information Operations
  • Mathematical Analysis
  • Mathematics
  • South Carolina

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Linear Algebra

Technology Areas

  • Space