We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
On the m-term approximation in L <sup>1</sup>(0, 1) in the Haar system.
- Authors
Gogyan, S. L.
- Abstract
The article considers the m-term L¹-greedy algorithm in the Haar system normalized in L¹ (0,1). It uses the binary numbering of the functions of the Haar system. It describes some notation and proves several lemmas, which will be used in the proof of the theorem. It proves the existence of a function f ε L¹ (0,1) for which there is no L¹-greedy algorithm in the Haar system converging to f.
- Subjects
HAAR system (Mathematics); ORTHOGONAL functions; ALGORITHMS; APPROXIMATION theory; MATHEMATICAL functions
- Publication
Mathematical Notes, 2006, Vol 79, Issue 3/4, p583
- ISSN
0001-4346
- Publication type
Article
- DOI
10.1007/s11006-006-0065-z