Login
Register
Submit a Paper
Propose a Special lssue
Open Access
ARTICLE
A Matrix Decomposition MFS Algorithm for Biharmonic Problems in Annular Domains
Department of Mathematics & Statistics, University of Cyprus, Nicosia, Cyprus.
Supported by a University of Cyprus grant.
Computers, Materials & Continua 2004, 1(3), 245-258. https://doi.org/10.3970/cmc.2004.001.245
Download PDFAbstract
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
Cite This Article
APA Style
Tsangaris, T., Smyrlis, Y., Karageorghis, A. (2004). A matrix decomposition MFS algorithm for biharmonic problems in annular domains. Computers, Materials & Continua, 1(3), 245-258. https://doi.org/10.3970/cmc.2004.001.245
Vancouver Style
Tsangaris T, Smyrlis Y, Karageorghis A. A matrix decomposition MFS algorithm for biharmonic problems in annular domains. Comput Mater Contin. 2004;1(3):245-258 https://doi.org/10.3970/cmc.2004.001.245
IEEE Style
T. Tsangaris, Y. Smyrlis, and A. Karageorghis, “A Matrix Decomposition MFS Algorithm for Biharmonic Problems in Annular Domains,” Comput. Mater. Contin., vol. 1, no. 3, pp. 245-258, 2004. https://doi.org/10.3970/cmc.2004.001.245
Copyright © 2004 The Author(s). Published by Tech Science Press.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.
Downloads
Citation Tools
