arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.04024math.NAcs.NAstat.ML
收藏

数据驱动低秩矩阵分解用于加速 Vlasov 方程求解的评估

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Bhavana Jonnalagadda, Stephen Becker

AI总结:

本文提出基于卷积神经网络的数据驱动低秩分解以加速 Vlasov 模拟,验证其插值和推理加速效果,但发现其难以对时间序列后 30% 进行有效外推。

摘要:

低秩方法已在加速由 Vlasov 方程描述的无碰撞等离子体模拟方面取得成功,但在每个时间步仍依赖计算成本高昂的线性代数。本文提出一种使用人工神经网络的数据驱动分解方法,具体采用卷积层架构,并在已有模拟数据上进行训练。在推理阶段,该模型输出带电粒子分布场的低秩分解;我们证明这一步骤比标准线性代数技术更快。数值实验表明,该方法能够有效插值时间序列数据,并以不只是记忆训练数据的方式泛化到未见过的测试数据;分解中的模式也内在地遵循与代数方法(例如截断奇异值分解)相同的数值趋势。然而,当在时间序列数据的前 70% 上训练并在剩余 30% 上测试时,该方法无法进行有意义的外推。尽管存在这一局限性结果,该技术对于处于统计稳态或表现出时间稳定性的模拟仍可能有益。

英文摘要:

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method effectively interpolates time-series data, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability.

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

↑