Greedy Algorithms for Reduced Bases in Banach Spaces

Abstract

Given a Banach space X and one of its compact sets $\mathcal{F}$, we consider the problem of finding a good n-dimensional space X _n ⊂X which can be used to approximate the elements of $\mathcal{F}$. The best possible error we can achieve for such an approximation is given by the Kolmogorov width $d_{n}(\mathcal{F})_{X}$. However, finding the space which gives this performance is typically numerically intractable. Recently, a new greedy strategy for obtaining good spaces was given in the context of the reduced basis method for solving a parametric family of PDEs. The performance of this greedy algorithm was initially analyzed in Buffa et al. (Modél. Math. Anal. Numér. 46:595–603, 2012) in the case $X=\mathcal{H}$ is a Hilbert space. The results of Buffa et al. (Modél. Math. Anal. Numér. 46:595–603, 2012) were significantly improved upon in Binev et al. (SIAM J. Math. Anal. 43:1457–1472, 2011). The purpose of the present paper is to give a new analysis of the performance of such greedy algorithms. Our analysis not only gives improved results for the Hilbert space case but can also be applied to the same greedy procedure in general Banach spaces.