当前位置: X-MOL 学术arXiv.cs.MS › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems
arXiv - CS - Mathematical Software Pub Date : 2020-09-24 , DOI: arxiv-2009.11742
Francesco Rizzi, Eric J. Parish, Patrick J. Blonigan, John Tencer

This work aims to advance computational methods for projection-based reduced order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern many-core and hybrid computing nodes. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. Finally, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970X more efficient than the full order model, while maintaining excellent accuracy in both the mean and statistics of the field.

中文翻译:

线性时不变动力系统伽辽金模型约简的计算约束公式

这项工作旨在推进线性时不变 (LTI) 动态系统的基于投影的降阶模型 (ROM) 的计算方法。对于此类系统,当前的实践依赖于将状态表示为 1 阶张量(即向量)的 ROM 公式,导致计算内核受内存带宽限制,因此不适用于现代众核上的可扩展性能和混合计算节点。在处理需要运行大量模拟的多查询研究时,这一弱点尤其具有限制性。这项工作引入了 LTI 动态系统的 Galerkin ROM 的称为 rank-2 Galerkin 的重新公式,它将 ROM 问题的性质从内存带宽转换为计算限制。我们介绍了制定及其实施的细节,并使用轴对称域中的弹性地震剪切波模拟作为测试案例,通过数值实验证明其实用性。我们量化和分析不同线程数量和问题大小的性能和扩展结果。最后,我们展示了使用 rank-2 Galerkin ROM 进行 Monte Carlo 抽样研究的端到端演示。我们表明,2 级 Galerkin ROM 比 1 级 Galerkin ROM(当前实践)效率高一个数量级,比全阶模型效率高约 970 倍,同时在均值和统计数据方面保持出色的准确性场。我们量化和分析不同线程数量和问题大小的性能和扩展结果。最后,我们展示了使用 rank-2 Galerkin ROM 进行 Monte Carlo 抽样研究的端到端演示。我们表明,2 级 Galerkin ROM 比 1 级 Galerkin ROM(当前实践)效率高一个数量级,比全阶模型效率高约 970 倍,同时在均值和统计数据方面保持出色的准确性场。我们量化和分析不同线程数量和问题大小的性能和扩展结果。最后,我们展示了使用 rank-2 Galerkin ROM 进行 Monte Carlo 抽样研究的端到端演示。我们表明,2 级 Galerkin ROM 比 1 级 Galerkin ROM(当前实践)效率高一个数量级,比全阶模型效率高约 970 倍,同时在均值和统计数据方面保持出色的准确性场。
更新日期:2020-09-25
down
wechat
bug