A platform for research: civil engineering, architecture and urbanism
Universal Bases and Greedy Algorithms for Anisotropic Function Classes
Universal Bases and Greedy Algorithms for Anisotropic Function Classes
Universal Bases and Greedy Algorithms for Anisotropic Function Classes
Temlyakov, V. N. (author)
CONSTRUCTIVE APPROXIMATION ; 18 ; 529-550
2002-01-01
22 pages
Article (Journal)
English
DDC:
511.4
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Greedy Algorithms for Reduced Bases in Banach Spaces
British Library Online Contents | 2013
|The Thresholding Greedy Algorithm, Greedy Bases, and Duality
British Library Online Contents | 2003
|British Library Online Contents | 2011
|Lebesgue-Type Inequalities for Quasi-greedy Bases
British Library Online Contents | 2013
|Greedy Bases Are Best for m-Term Approximation
British Library Online Contents | 2008
|