The Thresholding Greedy Algorithm, Greedy Bases and Duality

Abstract

Some new conditions that arise naturally in the study of the Thresholding Greedy Algorithm are introduced for bases of Banach spaces. We relate these conditions to best n-term approximation and we study their duality theory. In particular, we obtain a complete duality theory for greedy bases.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 17, 2001
Accession Number
ADA640677

Entities

People

  • D. Kutzarova
  • N. J. Kalton
  • S. J. Dilworth
  • V. N. Temlyakov

Organizations

  • University of South Carolina

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Banach Space
  • Classification
  • Contracts
  • Information Operations
  • Instructions
  • Mathematics
  • Monitoring
  • Security
  • South Carolina
  • Standards
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space