Efficient Kansa-type MFS algorithm for elliptic problems
Google Scholar check
MetadataShow full item record
In this study we propose an efficient Kansa-type method of fundamental solutions (MFS-K) for the numerical solution of certain problems in circular geometries. In particular, we consider problems governed by the inhomogeneous Helmholtz equation in disks and annuli. The coefficient matrices in the linear systems resulting from the MFS-K discretization of these problems possess a block circulant structure and can thus be solved by means of a matrix decomposition algorithm and fast Fourier Transforms. Several numerical examples demonstrating the efficacy of the proposed algorithm are presented. © 2009 Springer Science+Business Media, LLC.