Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set |
| |
Authors: | A. A. Sargsyan |
| |
Affiliation: | (1) Yerevan State University, Armenia |
| |
Abstract: | The paper establishes that there exist a continuum cardinality set E 0 ? [0, 1] and a function f 0(x) ∈ C [0,1], such that the greedy algorithm of f 0(x) with respect to the Faber-Schauder system converges to +∞ at all points of E 0. |
| |
Keywords: | 42C10 42C15 |
本文献已被 SpringerLink 等数据库收录! |
|