Tree wavelet approximations with applications (Q2574698): Difference between revisions

In the first part of this interesting paper, the authors present a constructive greedy scheme (CGS) which generates a partition of an invariant set according to a given multivariate function. The partition is then used to construct a piecewise polynomial approximation to a given multivariate function. Optimal order of convergence is obtained for Sobolev and Besov norms. Tree wavelet approximation is an important development of nonlinear approximation. In the second part of this paper, the authors develop tree wavelet approximations by using the partition generated by CGS which have optimal order of convergence. A difficulty in the construction of such an approximation is to obtain a suitable index set. The authors show that this can be done by a tree index set associated with the partition generated by CGS. They provide sufficient conditions on a tree index set and on biorthogonal wavelet bases which ensure optimal order of convergence for wavelet approximations. Finally, some numerical examples are given.