A. A. Sargsyan, “Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set”, J. Contemp. Mathemat. Anal., 42, № 2, 2007, 109
V.N. Temlyakov, “Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries”, Journal of Approximation Theory, 98, № 1, 1999, 117
Wei-Shih Du, Marko Kostić, Manuel Pinto, Antonio Masiello, “Almost Periodic Functions and Their Applications: A Survey of Results and Perspectives”, Journal of Mathematics, 2021, 2021, 1
Morten Nielsen, “Trigonometric Quasi-Greedy Bases for $L^p(T;w)$”, Rocky Mountain J. Math., 39, № 4, 2009
A. S. Romanyuk, “Best trigonometric and bilinear approximations of classes of functions of several variables”, Math Notes, 94, № 3-4, 2013, 379
P. Wojtaszczyk, “Greedy Algorithm for General Biorthogonal Systems”, Journal of Approximation Theory, 107, № 2, 2000, 293
Анатолий Сергеевич Романюк, Anatolii Sergeevich Romanyuk, “Наилучшие $M$-членные тригонометрические приближения классов Бесова периодических функций многих переменных”, Изв. РАН. Сер. матем., 67, № 2, 2003, 61
Martin G. Grigoryan, 70, Mechanical and Materials Engineering of Modern Structure and Component Design, 2015, 269
Serhii A. Stasyuk, “Best m-term trigonometric approximation of periodic functions of several variables from Nikol’skii–Besov classes for small smoothness”, Journal of Approximation Theory, 177, 2014, 1
V. S. Romanyuk, “Multiple Haar Basis and m-term Approximations for Functions from the Besov Classes. I”, Ukr Math J, 68, № 4, 2016, 625