PetRBF——一种用于径向基函数插值的并行O(N)算法
PetRBF--A parallel O(N) algorithm for radial basis function interpolation
AI总结:
提出一种并行径向基函数插值算法,通过GMRES迭代求解器与限制性加性Schwarz方法预条件器实现O(N)复杂度和良好可扩展性,适用于高斯基函数的大规模插值问题。
摘要:
我们开发了一种用于径向基函数(RBF)插值的并行算法,该算法具有O(N)复杂度,需要O(N)存储,并且可扩展到上千个进程。该算法使用GMRES迭代求解器,以限制性加性Schwarz方法(RASM)作为预条件器,并采用快速矩阵-向量算法。先前的快速RBF方法最多达到O(NlogN)复杂度,是使用多二次和多元调和基函数开发的。相比之下,本方法使用小方差的高斯函数(这是流体模拟中粒子方法的常见选择,也是我们的主要目标应用)。高斯基函数的快速衰减使得迭代求解器即使在RASM子域非常小的情况下也能快速收敛。本方法使用PETSc库(开发者版本)并行实现。数值实验证明了其在超过5000万个数据点的RBF插值问题中的能力,在Blue Gene/L(700 MHz PowerPC处理器)的1024个处理器上,误差容限为10^-15时,耗时106秒(19次迭代)。并行代码在开源模型中免费提供。
英文摘要:
We have developed a parallel algorithm for radial basis function (RBF) interpolation that exhibits O(N) complexity,requires O(N) storage, and scales excellently up to a thousand processes. The algorithm uses a GMRES iterative solver with a restricted additive Schwarz method (RASM) as a preconditioner and a fast matrix-vector algorithm. Previous fast RBF methods, --,achieving at most O(NlogN) complexity,--, were developed using multiquadric and polyharmonic basis functions. In contrast, the present method uses Gaussians with a small variance (a common choice in particle methods for fluid simulation, our main target application). The fast decay of the Gaussian basis function allows rapid convergence of the iterative solver even when the subdomains in the RASM are very small. The present method was implemented in parallel using the PETSc library (developer version). Numerical experiments demonstrate its capability in problems of RBF interpolation with more than 50 million data points, timing at 106 seconds (19 iterations for an error tolerance of 10^-15 on 1024 processors of a Blue Gene/L (700 MHz PowerPC processors). The parallel code is freely available in the open-source model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。