Derivation of an upper bound of the constant in the error bound for a near best m-term approximation

Details Derivation of an upper bound of the constant in the error bound for a near best m-term approximation Derivation of an upper bound of the constant in the error bound for a near best m-term approximation

2009-10-07

arxiv.org/abs/0910.1202v1

Mathematics

Numerical Analysis

20 pages, 1 figure

Scientific paper

In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p is greater than one and less than infinity and d is a natural number. The bound includes a constant C(p) that is not given explicitly. The goal of this paper is to find an upper bound of the constant for the Haar system.

Affiliated with

Also associated with

No associations

Rating

Derivation of an upper bound of the constant in the error bound for a near best m-term approximation 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 Derivation of an upper bound of the constant in the error bound for a near best m-term approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derivation of an upper bound of the constant in the error bound for a near best m-term approximation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35871