.png){kind=icon}
.png){kind=icon}
Return
PetRBF - A parallel O(N) algorithm for radial basis function interpolation with Gaussians
.png){kind=icon}
OA
AI
DOI：10.1016/j.cma.2010.02.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 GMHS 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 with respect to the domain, but with sufficient overlap. This is 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. At the same time we show that the accuracy of the interpolation can achieve machine precision. 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 s (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. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Radial basis function interpolation
Domain decomposition methods
GMRES
Order-N algorithms
Particle methods
Parallel computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W
View more organizations