Lebesgue-Type inequalities for quasi-greedy bases

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-327978

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.