Vol.1, No.3, 2004, pp.245-258, doi:10.3970/cmc.2004.001.245
OPEN ACCESS
ARTICLE
A Matrix Decomposition MFS Algorithm for Biharmonic Problems in Annular Domains
  • T. Tsangaris1, Y.–S. Smyrlis1, 2, A. Karageorghis1, 2
Department of Mathematics & Statistics, University of Cyprus, Nicosia, Cyprus.
Supported by a University of Cyprus grant.
Abstract
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.
Keywords
Method of fundamental solutions, biharmonic equation, circulant matrices, annular domains, fast Fourier transform.
Cite This Article
. , "A matrix decomposition mfs algorithm for biharmonic problems in annular domains," Computers, Materials & Continua, vol. 1, no.3, pp. 245–258, 2004.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.