caa a22 4500 463246756 CHVBK 20180405153328.0 cr unu---uuuuu 170326e20070201xx s 000 0 eng 10.1007/s00041-006-6033-x doi (NATIONALLICENCE)springer-10.1007/s00041-006-6033-x Temlyakov Vladimir Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA aut Greedy Algorithms with Prescribed Coefficients [Elektronische Daten] [Vladimir Temlyakov] We study greedy algorithms in a Banach space from the point of view of convergence and rate of convergence. We concentrate on studying algorithms that provide expansions into a series. We call such expansions greedy expansions. It was pointed out in our previous article that there is a great flexibility in choosing coefficients of greedy expansions. In that article this flexibility was used for constructing a greedy expansion that converges in any uniformly smooth Banach space. In this article we push the flexibility in choosing the coefficients of greedy expansions to the extreme. We make these coefficients independent of an element f ∈ X. Surprisingly, for a properly chosen sequence of coefficients we obtain results similar to the previous results on greedy expansions when the coefficients were determined by an element f. Birkhauser Boston, 2007 Journal of Fourier Analysis and Applications Birkhäuser-Verlag; www.birkhauser.com 13/1(2007-02-01), 71-86 1069-5869 13:1<71 2007 13 41 https://doi.org/10.1007/s00041-006-6033-x text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00041-006-6033-x text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Temlyakov Vladimir Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA aut NATIONALLICENCE 773 0- Journal of Fourier Analysis and Applications Birkhäuser-Verlag; www.birkhauser.com 13/1(2007-02-01), 71-86 1069-5869 13:1<71 2007 13 41 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer