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

基于MIONet求解PDE的混合迭代方法:理论与数值算例

A hybrid iterative method based on MIONet for PDEs: Theory and numerical examples

School of Mathematical Sciences, Peking University(北京大学数学科学学院)

Jun Hu, Pengzhan Jin

AI总结:

提出基于MIONet求解PDE的混合迭代方法,结合传统数值迭代与神经算子,系统分析其收敛条件、谱行为与速度,并通过Poisson方程数值算例验证了其显著的加速效果与应用潜力。

摘要:

我们提出了一种基于MIONet求解偏微分方程(PDE)的混合迭代方法,该方法结合了传统数值迭代求解器和近期强大的神经算子机器学习方法,并进一步系统分析了其理论性质,包括在离散化和模型推断误差方面的收敛条件、谱行为以及收敛速度。我们展示了常用平滑器(即Richardson(阻尼Jacobi)和Gauss-Seidel)的理论结果。我们给出了混合方法关于模型修正周期的收敛速度上界,该上界指出了一个使混合迭代收敛最快的极小值点。我们给出了几个数值算例,包括用于1维(2维)Poisson方程的混合Richardson(Gauss-Seidel)迭代,以验证我们的理论结果,并反映了极佳的加速效果。作为一种无网格加速方法,它在实际应用中具有巨大的潜力。

英文摘要:

We propose a hybrid iterative method based on MIONet for PDEs, which combines the traditional numerical iterative solver and the recent powerful machine learning method of neural operator, and further systematically analyze its theoretical properties, including the convergence condition, the spectral behavior, as well as the convergence rate, in terms of the errors of the discretization and the model inference. We show the theoretical results for the frequently-used smoothers, i.e. Richardson (damped Jacobi) and Gauss-Seidel. We give an upper bound of the convergence rate of the hybrid method w.r.t. the model correction period, which indicates a minimum point to make the hybrid iteration converge fastest. Several numerical examples including the hybrid Richardson (Gauss-Seidel) iteration for the 1-d (2-d) Poisson equation are presented to verify our theoretical results, and also reflect an excellent acceleration effect. As a meshless acceleration method, it is provided with enormous potentials for practice applications.

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

↑