@Article{cmes.2015.105.251,
AUTHOR = {W.  Chen, C. J.  Liu, Y.  Gu},
TITLE = {A Fast Multipole Accelerated Singular Boundary Method for Potential Problems},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {105},
YEAR = {2015},
NUMBER = {4},
PAGES = {251--270},
URL = {http://www.techscience.com/CMES/v105n4/27219},
ISSN = {1526-1506},
ABSTRACT = {The singular boundary method (SBM) is a recently-developed meshless boundary collocation method. This method overcomes the well-known fictitious boundary issue associated with the method of fundamental solutions (MFS) while remaining the merits of the later of being truly meshless, integral-free, and easy-to-program. Similar to the MFS, this method, however, produces dense and unsymmetrical coefficient matrix, which although much smaller in size compared with domain discretization methods, requires <i>O(N<sup>2</sup>)</i> operations in the iterative solution of the resulting algebraic system of equations. To remedy this bottleneck problem for its application to large-scale problems, this paper makes the first attempt to develop a fast multipole SBM (FM-SBM) formulation for two-dimensional (2D) potential problems. The proposed strategy can solve large-scale problems with several millions boundary discretization nodes on a desktop computer.},
DOI = {10.3970/cmes.2015.105.251}
}