Greedy Algorithms for Reduced Bases in Banach Spaces

By Ronald A. DeVore, Guergana Petrova, Przemyslaw Wojtaszczyk. Constructive approximation, 2012

191 citations recorded by the source corpus.

Given a Banach space X and one of its compact sets \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{F}$\end{document}, we consider the problem of finding a good n-dimensional space Xn⊂X which can be used to approximate the elements of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{F}$\end{document}. The best possible error we can achieve for such an approximation is given by the Kolmogorov width \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$d_{n}(\mathcal{F})_{X}$\end{document}. 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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$X=\mathcal{H}$\end{document} 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.

Subfields: Computational Mechanics, Statistical and Nonlinear Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/50e80e11402fd0ed11c0a12dc1401018f8e0c1e2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Ronald A. DeVore
  2. Albert Cohen
  3. Anthony T. Patera
  4. Christoph Schwab
  5. Yvon Maday
  6. Gianluigi Rozza
  7. Claude Jeffrey Gittelson
  8. Peng Chen

In Statistical and Nonlinear Physics

  1. Christoph Schwab
  2. Albert Cohen
  3. Anthony T. Patera
  4. Claude Jeffrey Gittelson
  5. Ronald A. DeVore
  6. Yvon Maday
  7. Masayuki Yano
  8. Dongbin Xiu

In Statistics and Probability

  1. Christoph Schwab
  2. Claude Jeffrey Gittelson
  3. Albert Cohen
  4. Ronald A. DeVore
  5. Dongbin Xiu
  6. Yvon Maday
  7. Akil C. Narayan
  8. Anthony T. Patera

Citations in the corpus