Mathematics – Functional Analysis
Scientific paper
2011-11-02
Mathematics
Functional Analysis
8 pages
Scientific paper
We show that for quasi-greedy bases in real Banach spaces the error of the
thresholding greedy algorithm of order N is bounded by the best N-term error of
approximation times a constant which depends on the democracy functions and the
quasi-greedy constant of the basis.
No associations
LandOfFree
Lebesgue-Type inequalities for quasi-greedy bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lebesgue-Type inequalities for quasi-greedy bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lebesgue-Type inequalities for quasi-greedy bases will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-327978