Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs

A. Cohen, R. DeVore, C. Schwab
{"title":"Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs","authors":"A. Cohen, R. DeVore, C. Schwab","doi":"10.3929/ETHZ-A-010406285","DOIUrl":null,"url":null,"abstract":"Parametric partial dierential equations are commonly used to model physical systems. They also arise when Wiener chaos expansions are used as an alternative to Monte Carlo when solving stochastic elliptic problems. This paper considers a model class of second order, linear, parametric, elliptic PDEs in a bounded domain D with coecients depending on possibly countably many parameters. It shows that the dependence of the solution on the parameters in the diusion coecient is analytically smooth. This analyticity is then exploited to prove that under very weak assumptions on the diusion coecients, the entire family of solutions to such equations can be simultaneously approximated by multivariate polynomials (in the parameters) with coecients taking values in the Hilbert space V = H 1 0(D) of weak solutions of the elliptic problem with a controlled number of terms N. The convergence rate in terms of N does not depend on the number of parameters in V which may be countable, therefore breaking the curse of dimensionality. The discretization of the coecients from a family of continuous, piecewise linear Finite Element functions in D is shown to yield finite dimensional approximations whose convergence rate in terms of the overall number Ndof of degrees of freedom is the minimum of the convergence rates aorded by the best N-term sequence approximations in the parameter space and the rate of Finite Element approximations in D for a single instance of the parametric problem.","PeriodicalId":22276,"journal":{"name":"The annual research report","volume":"154 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2010-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"168","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The annual research report","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3929/ETHZ-A-010406285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 168

Abstract

Parametric partial dierential equations are commonly used to model physical systems. They also arise when Wiener chaos expansions are used as an alternative to Monte Carlo when solving stochastic elliptic problems. This paper considers a model class of second order, linear, parametric, elliptic PDEs in a bounded domain D with coecients depending on possibly countably many parameters. It shows that the dependence of the solution on the parameters in the diusion coecient is analytically smooth. This analyticity is then exploited to prove that under very weak assumptions on the diusion coecients, the entire family of solutions to such equations can be simultaneously approximated by multivariate polynomials (in the parameters) with coecients taking values in the Hilbert space V = H 1 0(D) of weak solutions of the elliptic problem with a controlled number of terms N. The convergence rate in terms of N does not depend on the number of parameters in V which may be countable, therefore breaking the curse of dimensionality. The discretization of the coecients from a family of continuous, piecewise linear Finite Element functions in D is shown to yield finite dimensional approximations whose convergence rate in terms of the overall number Ndof of degrees of freedom is the minimum of the convergence rates aorded by the best N-term sequence approximations in the parameter space and the rate of Finite Element approximations in D for a single instance of the parametric problem.
参数和随机椭圆偏微分方程的解析正则性和多项式逼近
参数偏微分方程通常用于物理系统的建模。当用维纳混沌展开代替蒙特卡罗方法求解随机椭圆问题时,也会出现这种情况。考虑有界区域D上二阶线性参数椭圆偏微分方程的模型类,这些偏微分方程的系数依赖于可能可数的多个参数。结果表明,解对扩散系数参数的依赖是解析光滑的。然后利用此解析性很弱的假设下证明了diusion coecients,全家人同时解决这些方程可以近似的多元多项式(参数)coecients将希尔伯特空间中的值V = H 1 0 (D)的弱解的椭圆问题数量控制的条款N . N的收敛速度上不依赖于参数的数量在V这可能是可数名词,因此打破了维度的诅咒。对D中的一组连续分段线性有限元函数的系数进行离散化可以得到有限维近似,其收敛速度(以自由度的总数Ndof表示)是参数空间中最佳n项序列近似和D中单个参数问题的有限元近似速度所排序的收敛速度的最小值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信