arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.3846math.NAcs.NA
收藏

各向异性参数缩减基空间的局部自适应贪婪逼近

Locally adaptive greedy approximations for anisotropic parameter reduced basis spaces

UPMC University Paris 06(巴黎第六大学);Laboratoire Jacques-Louis Lions(雅克-路易·利翁斯实验室);Division of Applied Mathematics, Brown University(布朗大学应用数学系);CNRS(法国国家科学研究中心)

Yvon Maday, Benjamin Stamm

AI总结:

提出一种在参数空间中使用局部逼近空间的自适应贪婪算法,以控制在线计算成本并适应各向异性行为,通过数值实验验证了有效性。

摘要:

降阶模型,特别是缩减基方法,依赖于离线阶段经验构建且问题依赖的基函数。在线阶段,可以使用预计算的问题依赖解空间(由基函数张成)来减小计算问题的规模。对于复杂问题,为保证一定误差容限所需的基函数数量可能过大,从而无法从模型降阶中获得计算优势。为了克服这一点,本工作引入了一个框架,其中使用局部逼近空间(在参数空间中)来定义降阶逼近,以便显式控制在线成本。该方法还使局部逼近空间适应参数空间中的局部各向异性行为。我们给出了算法和大量数值测试。

英文摘要:

Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line stage. In the on-line stage, the precomputed problem-dependent solution space, that is spanned by the basis functions, can then be used in order to reduce the size of the computational problem. For complex problems, the number of basis functions required to guarantee a certain error tolerance can become too large in order to benefit computationally from the model reduction. To overcome this, the present work introduces a framework where local approximation spaces (in parameter space) are used to define the reduced order approximation in order to have explicit control over the on-line cost. This approach also adapts the local approximation spaces to local anisotropic behavior in the parameter space. We present the algorithm and numerous numerical tests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑