Greedy Approximation and the Multivariate Haar System

Abstract

We study nonlinear m-term approximation in a Banach space with regard to a basis. It is known that in the case of greedy basis (like the Haar basis H in L[sub p][0,1], 1 < p < infinity) a greedy type algorithm realizes near best m-term approximation for any individual function (element). In this paper we generalize the known result in two directions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2002
Accession Number
ADA640659

Entities

People

  • A. Kamont
  • 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

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Approximation Theory.

Technology Areas

  • Space