Greedy Type Algorithms in Banach Spaces and Applications
Abstract
We continue to study efficiency of approximation and convergence of greedy type algorithms in uniformly smooth Banach spaces. Two greedy type approximation methods the Weak Chebyshev Greedy Algorithm (WCGA) and the Weak Relaxed Greedy Algorithm (WRGA) have been introduced and studied in. These methods (WCGA and WRGA) are very general approximation methods that work well in an arbitrary uniformly smooth Banach space X for any dictionary D. It turned out that these general approximation methods are also very good for specific dictionaries.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2002
- Accession Number
- ADA640660
Entities
People
- V. N. Temlyakov
Organizations
- University of South Carolina