arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.06944cs.LGcs.NAmath.NA
收藏

神经稀疏线性求解器

Towards Neural Sparse Linear Solvers

ZURU Tech(ZURU科技)

Luca Grementieri, Paolo Galeone

摘要:

由于有限元法的广泛应用,大型稀疏对称线性方程组出现在科学和工程的许多分支中。最快的稀疏线性求解器实现混合迭代法。这些方法基于启发式算法来排列行和列或找到预处理矩阵。此外,它们本质上是顺序的,这使得它们无法完全利用GPU的处理能力。我们提出了神经稀疏线性求解器,这是一个深度学习框架,用于学习稀疏对称线性系统的近似求解器。我们的方法依赖于将稀疏对称线性系统表示为无向加权图。这样的图表示是固有的置换等变和尺度不变的,它可以成为一个图神经网络训练回归的解决方案的输入。我们在结构工程的静态线性分析问题上测试神经稀疏线性求解器。我们的方法是不准确的,比经典的算法,但它是硬件无关的,快速的GPU上,并适用于通用稀疏对称系统,没有任何额外的假设。虽然仍然存在许多限制,这项研究表明了一种通用的方法来解决问题,涉及稀疏对称矩阵使用图神经网络。

英文摘要:

Large sparse symmetric linear systems appear in several branches of science and engineering thanks to the widespread use of the finite element method (FEM). The fastest sparse linear solvers available implement hybrid iterative methods. These methods are based on heuristic algorithms to permute rows and columns or find a preconditioner matrix. In addition, they are inherently sequential, making them unable to leverage the GPU processing power entirely. We propose neural sparse linear solvers, a deep learning framework to learn approximate solvers for sparse symmetric linear systems. Our method relies on representing a sparse symmetric linear system as an undirected weighted graph. Such graph representation is inherently permutation-equivariant and scale-invariant, and it can become the input to a graph neural network trained to regress the solution. We test neural sparse linear solvers on static linear analysis problems from structural engineering. Our method is less accurate than classic algorithms, but it is hardware-independent, fast on GPUs, and applicable to generic sparse symmetric systems without any additional hypothesis. Although many limitations remain, this study shows a general approach to tackle problems involving sparse symmetric matrices using graph neural networks.

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

↑