A matrix decomposition MFS algorithm for axisymmetric biharmonic problems
Authors: Fairweather, Graeme; Karageorghis, Andreas; Smyrlis, Yiorgos-Sokratis
Source: Advances in Computational Mathematics, Volume 23, Numbers 1-2, July 2005 , pp. 55-71(17)
Abstract: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.
Document Type: Research Article
Affiliations: Department of Mathematical and Computer Sciences, Colorado School of Mines, Golden, CO, 80401, USA, Email: firstname.lastname@example.org
Publication date: July 2005