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

PGD-NO:用于3D百万规模物理模拟的具有预计算几何分解的神经算子

PGD-NO: A Neural Operator with Precomputed Geometry Decomposition for 3D Million-scale Physics Simulations

Weiheng Zhong, Jing Bi, Victor Oancea, Hadi Meidani

AI总结:

针对神经PDE求解器内存消耗大及单节点瓶颈问题,提出PGD-NO神经算子,通过预计算几何分解、迭代算法提取令牌解耦特征提取与解查询,实现线性内存扩展,在工业基准测试中表现佳且具可解释性,为大规模工业设计应用提供方案。

摘要:

虽然神经偏微分方程求解器在加速工程模拟方面显示出巨大潜力,但现有架构仍受高内存消耗和单节点瓶颈的限制,单个计算单元的VRAM严格限制了可处理的最大网格分辨率。为应对这些挑战,我们提出了PGD-NO,一种具有预计算几何分解的神经算子,它将几何编码的计算开销转移到确定性的预计算阶段。通过使用迭代几何分解算法提取几何令牌,我们的模型将特征提取与解查询解耦。这种架构实现了线性内存可扩展性,允许在超过1000万个节点的网格上进行高保真学习,而现有架构在此规模通常会遇到内存耗尽问题。PGD-NO在各种工业基准测试中展示了具有竞争力的预测准确性,并通过注意力机制提供了内在的可解释性。通过有效克服传统网格大小限制,PGD-NO为下一代大规模、高保真工业设计应用提供了强大而高效的解决方案。

英文摘要:

While neural PDE solvers have demonstrated significant potential for accelerating engineering simulations, existing architectures remain constrained by high memory consumption and the single node bottleneck, where the maximum processable mesh resolution is strictly limited by the VRAM of a single compute unit. To address these challenges, we propose PGD-NO, a neural operator with Precomputed Geometry Decomposition, that relocates the computational overhead of geometric encoding to a deterministic pre-computation phase. By utilizing an iterative geometry decomposition algorithm to extract geometry tokens, our model decouples feature extraction from solution querying. This architecture enables linear memory scalability, allowing high fidelity learning on meshes exceeding 10 million nodes, a scale where existing architectures typically encounter memory exhaustion. PGD-NO demonstrates competitive predictive accuracy across diverse industrial benchmarks and provides intrinsic interpretability through attention mechanisms. By effectively overcoming traditional mesh-size constraints, PGD-NO offers a robust and efficient solution for the next generation of large-scale, high-fidelity industrial design applications.

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

↑