4.7 Article

A posteriori error estimation and basis adaptivity for reduced-basis approximation of nonaffine-parametrized linear elliptic partial differential equations

期刊

JOURNAL OF COMPUTATIONAL PHYSICS
卷 227, 期 2, 页码 983-1006

出版社

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2007.08.031

关键词

nonaffine-parametrized partial differential equations; reduced basis methods; Galerkin approximation; coefficient-function approximation; output bounds; a posteriori error estimation; basis adaptivity

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

In this paper, we extend the earlier work [M. Barrault, Y. Maday, N. C. Nguyen, A.T. Patera, An empirical interpolation method: application to efficient reduced-basis discretization of partial differential equations, C.R. Acad. Sci. Paris, Serie 1339 (2004) 667-672; M.A. Grepl, Y. Maday, N.C. Nguyen, A.T. Patera, Efficient reduced-basis treatment of non-affine and nonlinear partial differential equations, M2AN Math. Model. Numer. Anal. 41 (3) (2007) 575-605.] to provide a posteriori error estimation and basis adaptivity for reduced-basis approximation of linear elliptic partial differential equations with nonaffine parameter dependence. The essential components are (i) rapidly convergent reduced-basis approximations-(Galerkin) projection onto a space W-N spanned by N global hierarchical basis functions which are constructed from solutions of the governing partial differential equation at judiciously selected points in parameter space; (ii) stable and inexpensive interpolation procedures - methods which allow us to replace nonaffine parameter functions with a coefficient-function expansion as a sum of M products of parameter-dependent coefficients and parameter-independent functions; (iii) a posteriori error estimation - relaxations of the error-residual equation that provide inexpensive yet sharp error bounds for the error in the outputs of interest; (iv) optimal basis construction - processes which make use of the error bounds as an inexpensive surrogate for the expensive true error to explore the parameter space in the quest for an optimal sampling set; and (v) offline/online computational procedures - methods which decouple the generation and projection stages of the approximation process. The operation count for the online stage - in which, given a new parameter value, we calculate the output of interest and associated error bounds - depends only on N, M, and the affine parametric complexity of the problem; the method is thus ideally suited for repeated and reliable evaluation of input-output relationships in the many-query or real-time contexts. Published by Elsevier Inc.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据