A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains
Date
2006Source
Journal of Scientific ComputingVolume
28Issue
1Pages
31-50Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
In this work we apply the Method of Fundamental Solutions (MFS) with fixed singularities and boundary collocation to certain axisymmetric harmonic and biharmonic problems. By exploiting the block circulant structure of the coefficient matrices appearing when the MFS is applied to such problems, we develop efficient matrix decomposition algorithms for their solution. The algorithms are tested on several examples. © 2006 Springer Science+Business Media, Inc.