4.4 Article

CONVERGENCE RATES OF THE POD-GREEDY METHOD

出版社

EDP SCIENCES S A
DOI: 10.1051/m2an/2012045

关键词

Greedy approximation; proper orthogonal decomposition; convergence rates; reduced Basis methods

资金

  1. Baden-Wurttemberg Stiftung gGmbH
  2. German Research Foundation (DFG) within the Cluster of Excellence in Simulation Technology at the University of Stuttgart [EXC 310/1]

向作者/读者索取更多资源

Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a priori convergence rate statements for this algorithm have been given (Buffa et al. 2009, Binev et al. 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD-Greedy algorithm (Haasdonk and Ohlberger 2008). In this algorithm, each greedy step is invoking a temporal compression step by performing a proper orthogonal decomposition (POD). Using a suitable coefficient representation of the POD-Greedy algorithm, we show that the existing convergence rate results of the Greedy algorithm can be extended. In particular, exponential or algebraic convergence rates of the Kolmogorov n-widths are maintained by the POD-Greedy algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据