arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.17159math.NAcs.NA
收藏

不含差商的POD方法中的逐点误差界

Pointwise error bounds in POD methods without difference quotients

Bosco García-Archilla, Julia Novo

AI总结:

研究不含差商的POD方法,在快照函数具一定光滑度时,通过推导Sobolev空间中Agmon与插值不等式的离散形式,获得了不随快照数退化且收敛速率接近含差商方法的逐点误差界。

摘要:

本文研究数据集中不包含快照差商(DQs)的本征正交分解(POD)方法。文献表明,包含DQs是获得不随快照数量增加而退化的误差界的关键因素。近期,包含DQs使得能够获得与平均误差界具有相同收敛速率(就POD奇异值而言)的逐点(而非平均)误差界。本文针对数据集中不包含DQs的POD方法,在提取快照的函数具有某种光滑度的情况下,获得了不随快照数量增加而退化的误差界。此外,其收敛速率与包含DQs的方法一样接近,这取决于提供快照的函数的光滑度允许程度。我们通过在Sobolev空间中获取Agmon不等式和插值不等式的离散对应物来实现这一点。同时给出了验证这些估计的数值实验。

英文摘要:

In this paper we consider proper orthogonal decomposition (POD) methods that do not include difference quotients (DQs) of snapshots in the data set. The inclusion of DQs have been shown in the literature to be a key element in obtaining error bounds that do not degrade with the number of snapshots. More recently, the inclusion of DQs has allowed to obtain pointwise (as opposed to averaged) error bounds that decay with the same convergence rate (in terms of the POD singular values) as averaged ones. In the present paper, for POD methods not including DQs in their data set, we obtain error bounds that do not degrade with the number of snapshots if the function from where the snapshots are taken has certain degree of smoothness. Moreover, the rate of convergence is as close as that of methods including DQs as the smoothness of the function providing the snapshots allows. We do this by obtaining discrete counterparts of Agmon and interpolation inequalities in Sobolev spaces. Numerical experiments validating these estimates are also presented.

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

↑