期刊
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS
卷 424, 期 1, 页码 685-695出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jmaa.2014.11.054
关键词
Non-linear approximation; Greedy algorithm; Reduced basis method; Kolmogorov widths
资金
- Polish Narodowe Centrum Nauki grant [DEC2011/03/B/ST1/04902]
The greedy algorithm to produce n-dimensional subspaces X-n to approximate a compact set F contained in a Hilbert space was introduced in the context of reduced basis method in [12,13]. The same algorithm works for a general Banach space and in this context was studied in [4]. In this paper we study the case F subset of L-p. If Kolmogorov diameters d(n)(F) of F decay as n(-alpha) we give an almost optimal estimate for the decay of sigma(n) := dist(F,X-n). We also give some direct estimates of the form sigma(n) <= C(n)d(n)(F). (C) 2014 Published by Elsevier Inc.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据