A matrix decomposition MFS algorithm for axisymmetric biharmonic problems
Date
2005ISSN
1019-7168Source
Advances in Computational MathematicsVolume
23Issue
1-2Pages
55-71Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We consider the approximate solution of axisymmetric biharmonic problems using a boundary-type meshless method, the Method of Fundamental Solutions (MFS) with fixed singularities and boundary collocation. For such problems, the coefficient matrix of the linear system defining the approximate solution has a block circulant structure. This structure is exploited to formulate a matrix decomposition method employing fast Fourier transforms for the efficient solution of the system. The results of several numerical examples are presented. © Springer 2005.