|
This article is cited in 1 scientific paper (total in 1 paper)
On Faber–Schauder coefficients of continuous functions and divergence of greedy algorighms
A. A. Sargsyan Russian-Armenian University, 123 Hovsep Emin str., Yerevan, 0051 Armenia
Abstract:
We consider relationship between the rate of convergence to zero of the Faber–Schauder coefficients of continuous functions and the behavior of the greedy algorithm. We construct a continuous function $f$ with Faber–Schauder coefficients $|A_n (f)|=O(\log^{-1} n)$ and divergent greedy algorithm.
Keywords:
greedy algorithm, Faber–Schauder system, coefficients of expansion, uniform convergence.
Received: 22.03.2018 Revised: 18.07.2018 Accepted: 26.09.2018
Citation:
A. A. Sargsyan, “On Faber–Schauder coefficients of continuous functions and divergence of greedy algorighms”, Izv. Vyssh. Uchebn. Zaved. Mat., 2019, no. 5, 63–69; Russian Math. (Iz. VUZ), 63:5 (2019), 57–62
Linking options:
https://www.mathnet.ru/eng/ivm9464 https://www.mathnet.ru/eng/ivm/y2019/i5/p63
|
|