用图神经网络优化压力求解器,提速4%到37%。
Acceleration of an algebraic multigrid pressure solver using graph neural networks

- 用图神经网络预测多项式系数,构建自适应平滑器。
- 减少40%以上迭代次数,最高提速37%。
- 在超大网格和工业级问题上仍保持高效。
求解不可压缩非结构化流场中的压力泊松方程仍是计算瓶颈,主要源于传统线性求解器对网格不规则性的敏感。本文提出一种数据驱动的代数多重网格(AMG)平滑器,采用改进的图卷积同构网络(GCIN),从稀疏系数矩阵中直接捕捉系统代数结构,预测最优多项式系数以构造稀疏伪逆算子。该方法在保持求解器线性的同时,适应非结构网格的局部各向异性。实验表明,该框架显著降低达到给定容差所需的V型循环次数,在多样化基准测试中实现4%至37%的墙时加速。模型表现出强泛化能力:在训练时未见、最大达128倍的更大网格上仍有效,并能加速如AirfRANS等工业级问题的收敛。
原文摘要 · Abstract (English)
Solving the pressure-Poisson equation remains the primary computational bottleneck in incompressible unstructured flow solvers primarily due to the inherent sensitivity of traditional linear solvers to mesh irregularities. This work introduces a data-driven algebraic multigrid (AMG) smoother that uses a modified graph convolutional isomorphism network (GCIN). The graph neural network predicts optimal polynomial coefficients to construct a sparse pseudo-inverse operator across diverse grid topologies. The coefficients are optimized to reduce the residual after each V-cycle iteration. By directly capturing the algebraic structure of the system from the sparse coefficient matrix, the proposed method maintains the solver's linearity while adapting to local anisotropies in unstructured grids. Our framework demonstrates significant performance gains by reducing the number of V-cycles required for a given tolerance and delivering wall-clock speedups from 4% to 37% across diverse benchmarks. Notably, the model exhibits robust generalization by maintaining efficiency on meshes up to 128 times larger than those seen in training, and by accelerating the solver's convergence on unseen industry-relevant problems such as the AirfRANS dataset.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。