63 citations to 10.1007/s00041-001-4021-8 (Crossref Cited-By Service)
  1. V. Temlyakov, 177, Mathematical Analysis, Probability and Applications – Plenary Lectures, 2016, 183  crossref
  2. Rensuo Li, Yongping Liu, “The Best m-Term One-Sided Approximation of Besov Classes by the Trigonometric Polynomials”, APM, 02, № 03, 2012, 183  crossref
  3. Feng Dai, “An extrapolation theorem for nonlinear approximation and its applications”, Journal of Approximation Theory, 143, № 2, 2006, 135  crossref
  4. Mark Kon, Leszek Plaskota, “Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach”, Journal of Complexity, 17, № 2, 2001, 345  crossref
  5. Naoki Saito, Jean-François Remy, “The polyharmonic local sine transform: A new tool for local image analysis and synthesis without edge effect”, Applied and Computational Harmonic Analysis, 20, № 1, 2006, 41  crossref
  6. G. Akishev, “Trigonometric Widths of the Nikol’skii–Besov Classes in the Lebesgue Space with Mixed Norm”, Ukr Math J, 66, № 6, 2014, 807  crossref
  7. Thomas Jahn, Tino Ullrich, Felix Voigtlaender, “Sampling numbers of smoothness classes via ℓ1-minimization”, Journal of Complexity, 79, 2023, 101786  crossref
  8. A. F. Konohrai, S. A. Stasyuk, “Best M-term trigonometric approximations of the classes $ B^{\Omega }_{{p,{\text{ $ \theta $ }}}} $ of periodic functions of many variables in the space L q”, Ukr Math J, 60, № 9, 2008, 1396  crossref
  9. V. Kurkova, M. Sanguineti, “Bounds on rates of variable-basis and neural-network approximation”, IEEE Trans. Inform. Theory, 47, № 6, 2001, 2659  crossref
  10. D. Leviatan, V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv Comput Math, 25, № 1-3, 2006, 73  crossref
1
2
3
4
5
6
7
Следующая