Reduced basis method based on a posteriori error estimate for the parameterized Allen-Cahn equation

IF 3.8 2区 物理与天体物理 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Liang Wu , Mejdi Azaïez , Tomás Chacón Rebollo , Chuanju Xu
{"title":"Reduced basis method based on a posteriori error estimate for the parameterized Allen-Cahn equation","authors":"Liang Wu ,&nbsp;Mejdi Azaïez ,&nbsp;Tomás Chacón Rebollo ,&nbsp;Chuanju Xu","doi":"10.1016/j.jcp.2025.114278","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper we propose an efficient and accurate reduced-order method for the parameterized Allen-Cahn equation. The proposed method aims to construct efficient low-dimensional reduced basis to approximate the Allen-Cahn equation with desired accuracy for all parameters of interest. The key is to select minimal parameters for which the snapshots are collected to generate the reduced basis. The selection of these parameters is guided by a residual estimator. To this end, we first derive a posteriori error estimates for this residual estimator. Then, we propose a POD-greedy algorithm based on the derived a posteriori error estimates to construct the efficient reduced basis. The established a posteriori error estimate and the accuracy of the proposed reduced-order method are verified through several numerical examples. Specifically, our numerical experiments show that the obtained a posteriori error estimate is sharp and that the convergence of the error with respect to the POD-greedy iteration is exponential. In addition, the efficiency of the POD-greedy sampling procedure is demonstrated by some practical examples.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"540 ","pages":"Article 114278"},"PeriodicalIF":3.8000,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999125005613","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we propose an efficient and accurate reduced-order method for the parameterized Allen-Cahn equation. The proposed method aims to construct efficient low-dimensional reduced basis to approximate the Allen-Cahn equation with desired accuracy for all parameters of interest. The key is to select minimal parameters for which the snapshots are collected to generate the reduced basis. The selection of these parameters is guided by a residual estimator. To this end, we first derive a posteriori error estimates for this residual estimator. Then, we propose a POD-greedy algorithm based on the derived a posteriori error estimates to construct the efficient reduced basis. The established a posteriori error estimate and the accuracy of the proposed reduced-order method are verified through several numerical examples. Specifically, our numerical experiments show that the obtained a posteriori error estimate is sharp and that the convergence of the error with respect to the POD-greedy iteration is exponential. In addition, the efficiency of the POD-greedy sampling procedure is demonstrated by some practical examples.
基于后验误差估计的参数化Allen-Cahn方程的降基方法
本文提出了一种高效、精确的参数化Allen-Cahn方程降阶方法。提出的方法旨在构造高效的低维降维基来近似Allen-Cahn方程,并对所有感兴趣的参数具有期望的精度。关键是选择收集快照所需的最小参数,以生成简化基。这些参数的选择由残差估计量指导。为此,我们首先推导出残差估计量的后验误差估计。然后,我们提出了一种基于后验误差估计的pod贪心算法来构造有效的约简基。通过几个数值算例验证了所建立的后验误差估计和所提出的降阶方法的准确性。具体而言,我们的数值实验表明,得到的后验误差估计是明显的,并且误差相对于pod贪婪迭代的收敛性是指数的。此外,通过实例验证了贪心pod采样方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Computational Physics
Journal of Computational Physics 物理-计算机:跨学科应用
CiteScore
7.60
自引率
14.60%
发文量
763
审稿时长
5.8 months
期刊介绍: Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries. The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信