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

基于图自编码的模型降阶方法:适用于非结构化网格

Projection-based model-order reduction via graph autoencoders suited for unstructured meshes

Lehigh University(利哈伊大学);U. S. Naval Research Laboratory(美国海军研究实验室);Virginia Tech(弗吉尼亚理工大学)

Liam K. Magargal, Parisa Khodabakhshi, Steven N. Rodriguez, Justin W. Jaworski, John G. Michopoulos

AI总结:

本文提出一种图自编码架构,通过非线性流形最小二乘 Petrov-Galerkin 投影方案实现基于投影的模型降阶,适用于非结构化网格中的对流主导流场。

摘要:

本文提出了一种图自编码架构,能够通过非线性流形最小二乘 Petrov-Galerkin(LSPG)投影方案实现基于投影的模型降阶(PMOR)。该架构特别适用于由非结构化网格建模的对流主导流场,因为它提供了稳健的非线性映射,可在PMOR设置中利用。所提出的图自编码器由两部分过程组成:(1) 生成层次化的降阶图以模拟卷积神经网络(CNN)的压缩能力;(2) 在降阶图的每个层次中训练消息传递操作以模拟CNN的滤波过程。所得到的框架比传统CNN-based自编码器更具灵活性,因为它可以扩展到非结构化网格。我们分析了图自编码器潜在状态变量的可解释性,发现所提出图自编码器的解码器雅可比矩阵提供了类似于传统正交分解模式的可解释模式形状。为了突出所提出框架(命名为几何深度最小二乘 Petrov-Galerkin,GD-LSPG)的能力,我们在一维Burgers模型上进行了基准测试,并通过部署在两个二维欧拉方程的非结构化网格测试案例上展示了GD-LSPG的灵活性。所提出的框架比传统CNN-based自编码器更灵活,并且在非常低维的潜在空间中相比传统仿射投影提供了显著的精度提升。

英文摘要:

This paper presents the development of a graph autoencoder architecture capable of performing projection-based model-order reduction (PMOR) using a nonlinear manifold least-squares Petrov-Galerkin (LSPG) projection scheme. The architecture is particularly useful for advection-dominated flows modeled by unstructured meshes, as it provides a robust nonlinear mapping that can be leveraged in a PMOR setting. The presented graph autoencoder is constructed with a two-part process that consists of (1) generating a hierarchy of reduced graphs to emulate the compressive abilities of convolutional neural networks (CNNs) and (2) training a message passing operation at each step in the hierarchy of reduced graphs to emulate the filtering process of a CNN. The resulting framework provides improved flexibility over traditional CNN-based autoencoders because it is readily extendable to unstructured meshes. We provide an analysis of the interpretability of the graph autoencoder's latent state variables, where we find that the Jacobian of the decoder for the proposed graph autoencoder provides interpretable mode shapes akin to traditional proper orthogonal decomposition modes. To highlight the capabilities of the proposed framework, which is named geometric deep least-squares Petrov-Galerkin (GD-LSPG), we benchmark the method on a one-dimensional Burgers' model with a structured mesh and demonstrate the flexibility of GD-LSPG by deploying it on two test cases for two-dimensional Euler equations that use an unstructured mesh. The proposed framework is more flexible than using a traditional CNN-based autoencoder and provides considerable improvement in accuracy for very low-dimensional latent spaces in comparison with traditional affine projections.

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

↑