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

一种用于子扩散方程的高效且无内存算法:基于增量奇异值分解

An efficient and memory free algorithm for subdiffusion equation using incremental singular value decomposition

University of Nevada, Las Vegas(内华达大学拉斯维加斯分校);University of Louisiana at Lafayette(路易斯安那大学拉斐特分校)

Jichun Li, Yangpeng Zhang, Yangwen Zhang

AI总结:

本文提出基于增量奇异值分解的高效算法,解决时间分数偏微分方程数值解中存储需求随时间步数线性增长的问题,通过减少内存使用验证了理论结果。

摘要:

在本文中,我们针对时间分数偏微分方程(TFPDEs)数值解中已知的挑战,即对所有先前时间层的依赖导致存储需求随时间步数线性增长。为克服这一困难,我们开发了一种基于增量奇异值分解(ISVD)的高效算法,该算法避免了存储完整解历史所带来的过度内存需求。建立了严谨的误差分析,并展示了数值实验以验证理论结果。与直接方法和一种代表性快速评估方法的比较显示,所提出的ISVD方法相对于直接方法显著减少了内存使用,并在测试参数范围内与快速方法具有竞争力。

英文摘要:

In this paper, we address the well-known challenge in the numerical solution of time-fractional partial differential equations (TFPDEs), namely, that the dependence on all previous time levels leads to storage requirements that grow linearly with the number of time steps. To overcome this difficulty, we develop an efficient algorithm based on incremental singular value decomposition (ISVD), which avoids the excessive memory demands associated with storing the full solution history. A rigorous error analysis is established, and numerical experiments are presented to validate the theoretical results. Comparisons with the direct method and a representative fast evaluation method show that the proposed ISVD approach dramatically reduces memory usage relative to the direct method and remains competitive with the fast method over the tested parameter regimes.

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

↑