Efficient implementation of the MFS: The three scenarios
Date
2009Source
Journal of Computational and Applied MathematicsVolume
227Issue
1Pages
83-92Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
In this study we investigate the approximation of the solutions of harmonic problems subject to Dirichlet boundary conditions by the Method of Fundamental Solutions (MFS). In particular, we study the application of the MFS to Dirichlet problems in a disk. The MFS discretization yields systems which possess special features which can be exploited by using Fast Fourier transform (FFT)-based techniques. We describe three possible formulations related to the ratio of boundary points to sources, namely, when the number of boundary points is equal, larger and smaller than the number of sources. We also present some numerical experiments and provide an efficient MATLAB implementation of the resulting algorithms. © 2008 Elsevier B.V. All rights reserved.