arXiv:2605.13343cs.GRcs.DC2026-05

用分层变压器提升物理模拟的实时求解速度,支持复杂材料系统。

Hierarchical Transformer Preconditioning for Interactive Physics Simulation

论文配图:Hierarchical Transformer Preconditioning for Interactive Physics Simulation
图 1 · 摘自论文原文
  • 基于多尺度结构先验设计神经预条件器,实现全图近似逆计算。
  • 在100:1密度比下,最大16384个节点时达21帧/秒,比传统方法快28倍。
  • 适合需要高精度实时交互的仿真应用,如游戏与虚拟现实。

用于实时物理仿真的神经预条件器虽具潜力,但常因继承局部消息传递或稀疏操作模式而难以高效捕捉长程耦合。本文提出分层变压器预条件器,基于弱可适性H-矩阵划分,该划分提供多尺度结构先验(密集对角叶节点与粗化非对角块)。此结构使全图近似逆计算达到O(N)复杂度(固定块大小)。网络通过低秩远场因子建模逆,并利用高速公路连接(轴向缓冲与全局汇总标记)在变换器深度中传播上下文。每次共轭梯度迭代中,预条件器应用仅需批量稠密GEMM且内存访问规律。关键训练贡献为余弦-Hutchinson探测目标,学习MA在收敛关键谱子空间上的作用,优化MAz与z之间的角度对齐,而非强制特征值聚类至指定位置。这消除了SAI类目标中的额外谱定位约束,在不规则谱上改善条件数。由于推理和应用均为稠密、无依赖张量程序,整个求解循环可封装为单一CUDA Graph。在刚性多相泊松系统(密度比高达100:1,节点数N=1,024–16,384)上,求解器性能从约143提升至约21帧/秒。当N=8,192时,每帧耗时17.9毫秒,较GPU Jacobi快2.2倍,较GPU IC/DILU(AMGX multicolor_dilu)快约28倍,较同基准上按比例重训练的神经SPAI快2.7倍。

原文摘要 · Abstract (English)

Neural preconditioners for real-time physics simulation offer promising data-driven priors, but they often fail to capture long-range couplings efficiently because they inherit local message passing or sparse-operator access patterns. We introduce the Hierarchical Transformer Preconditioner, a neural preconditioner anchored to a weak-admissibility H-matrix partition. The partition provides a multiscale structural prior (dense diagonal leaves plus coarsening off-diagonal tiles) that enables full-graph approximate-inverse computation with O(N) scaling at fixed block sizes. The network models the inverse through low-rank far-field factors and uses highway connections (axial buffers plus a global summary token) to propagate context across transformer depth. At each PCG iteration, preconditioner application reduces to batched dense GEMMs with regular memory access. The key training contribution is a cosine-Hutchinson probe objective that learns the action of MA on convergence-critical spectral subspaces, optimizing angular alignment of MAz with z rather than forcing eigenvalue clusters to a prescribed location. This removes unnecessary spectral-placement constraints from SAI-style objectives and improves conditioning on irregular spectra. Because both inference and apply are dense, dependency-free tensor programs, the full solve loop is captured as a single CUDA Graph. On stiff multiphase Poisson systems (up to 100:1 density contrast, N = 1,024-16,384), the solver runs from ~143 to ~21 fps. At N = 8,192, it reaches 17.9 ms/frame, with 2.2x speedup over GPU Jacobi, ~28x over GPU IC/DILU (AMGX multicolor_dilu), and 2.7x over neural SPAI retrained per scale on the same benchmark.

物理仿真变压器预条件器实时计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。