Universal bases and greedy algorithms for anisotropic function classes

DOI10.1007/s00365-002-0514-1zbMath1025.41009OpenAlexW2048008303MaRDI QIDQ1862756

Vladimir N. Temlyakov

Publication date: 2 December 2003

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-002-0514-1

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items

Greedy approximation of characteristic functions, Asymptotic performance of projection estimators in standard and hyperbolic wavelet bases, On the stability in weak topology of the set of global solutions to the Navier-Stokes equations, The best \(m\)-term approximations on generalized Besov classes \(M\, B_{q, \theta}^{\Omega}\) with regard to orthogonal dictionaries, Greedy approximation with regard to non-greedy bases, Optimal approximation of elliptic problems by linear and nonlinear mappings. III: Frames, Hyperbolic wavelet thresholding methods and the curse of dimensionality through the maxiset approach, Representation and \(m\)-term approximation for anisotropic Besov classes, Optimal approximation of elliptic problems by linear and nonlinear mappings. II, Greedy algorithm for functions with low mixed smoothness

Cites Work

• Entropy numbers of diagonal operators between symmetric Banach spaces
• Nonlinear Kolmogorov widths
• Hyperbolic wavelet approximation
• On best continuous methods in \(n\)-term approximation
• Greedy algorithms with regard to multivariate systems with special structure
• On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
• On unconditional polynomial bases in \(L_ p\) and Bergman spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item