{"title":"Reduced basis method based on a posteriori error estimate for the parameterized Allen-Cahn equation","authors":"Liang Wu , Mejdi Azaïez , Tomás Chacón Rebollo , 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.
期刊介绍:
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.