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

POD-Greedy算法的若干新收敛性分析及应用

Some New Convergence Analysis and Applications of POD-Greedy Algorithms

Yuwen Li, Yupeng Wang

AI总结:

该研究推导了弱POD-Greedy方法的新熵数收敛估计,提出结合EIM的EIM-POD-Greedy方法并给出熵基收敛分析,数值实验验证其优于传统方法。

摘要:

本文针对含多POD模态与可变贪婪阈值的弱POD-Greedy方法,基于参数化解流形的熵数推导了一种全新的收敛估计。将POD与经验插值法(Empirical Interpolation Method, EIM)相结合,我们还提出了一种EIM-POD-Greedy方法,并给出了基于熵的收敛性分析,该方法可通过可分逼近式同时逼近参数化目标函数。文中开展了若干数值实验,结果表明所提算法相比传统方法更具有效性。

英文摘要:

In this article, we derive a novel convergence estimate for the weak POD-Greedy method with multiple POD modes and variable greedy thresholds in terms of the entropy numbers of the parametric solution manifold. Combining the POD with the Empirical Interpolation Method (EIM), we also propose an EIM-POD-Greedy method with entropy-based convergence analysis for simultaneously approximating parametrized target functions by separable approximants. Several numerical experiments are presented to demonstrate the effectiveness of the proposed algorithm compared to traditional methods.

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

↑