期刊
JOURNAL OF COMPUTATIONAL PHYSICS
卷 228, 期 23, 页码 8712-8725出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2009.08.031
关键词
Fast multipole method; Interpolation; Chebyshev polynomials; Singular value decomposition
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据