The black-box fast multipole method

被引:185
作者
Fong, William [1 ]
Darve, Eric [1 ,2 ]
机构
[1] Stanford Univ, Inst Computat & Math Engn, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Mech Engn, Stanford, CA 94305 USA
关键词
Fast multipole method; Interpolation; Chebyshev polynomials; Singular value decomposition; INTEGRAL-EQUATIONS; 3; DIMENSIONS; ALGORITHM; COMPRESSION;
D O I
10.1016/j.jcp.2009.08.031
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A new O(N) fast multipole formulation is proposed for non-oscillatory kernels. This algorithm is applicable to kernels K(x,y) which are only known numerically, that is their numerical value can be obtained for any (x,y). This is quite different from many fast multipole methods which depend on analytical expansions of the far-field behavior of K, for vertical bar x - y vertical bar large. Other "black-box" or "kernel-independent" fast multipole methods have been devised. Our approach has the advantage of requiring a small pre-computation time even for very large systems, and uses the minimal number of coefficients to represent the far-field, for a given L-2 tolerance error in the approximation. This technique can be very useful for problems where the kernel is known analytically but is quite complicated, or for kernels which are defined purely numerically. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:8712 / 8725
页数:14
相关论文
共 16 条