Near best tree approximation
DOI10.1023/A:1014554317692zbMATH Open1031.65157MaRDI QIDQ1599367FDOQ1599367
Richard G. Baraniuk, Ronald DeVore, G. Kyriazis, Xiang Ming Yu
Publication date: 9 June 2002
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Recommendations
Besov spaceapproximation ordertree structure\(n\)-term wavelet approximationbest tree approximationefficient encodingnonlinear wavelet approximation
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for wavelets (65T60) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cited In (9)
- Blind wavelet compression of the solution of a nonlinear PDE with singular forcing term within optimal order cost: stability of restricted approximation to small errors
- Uniform tree approximation by global optimization techniques
- Tree wavelet approximations with applications
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- Tree approximation and optimal encoding
- Hyperbolic wavelet thresholding methods and the curse of dimensionality through the maxiset approach
- Structured Sparsity: Discrete and Convex Approaches
- On the Besov regularity of periodic Lévy noises
This page was built for publication: Near best tree approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599367)