A matrix decomposition MFS algorithm for biharmonic problems in annular domains
SourceComputers, Materials and Continua
Google Scholar check
MetadataShow full item record
The Method of Fundamental Solutions (MFS) is a boundary-type method for the solution of certain elliptic boundary value problems. In this work, we develop an efficient matrix decomposition MFS algorithm for the solution of biharmonic problems in annular domains. The circulant structure of the matrices involved in the MFS discretization is exploited by using Fast Fourier Transforms. The algorithm is tested numerically on several examples.