Paper Info
Title
Efficient MFS algorithms in regular polygonal domains
Abstract
In this work, we apply the Method of Fundamental Solutions (MFS) to harmonic and biharmonic problems in regular polygonal domains. The matrices resulting from the MFS discretization possess a block circulant structure. This structure is exploited to produce efficient Fast Fourier Transform–based Matrix Decomposition Algorithms for the solution of these problems. The proposed algorithms are tested numerically on several examples.
Year
DOI
Venue
2009
10.1007/s11075-008-9224-5
Numerical Algorithms
Keywords
Field
DocType
Method of fundamental solutions,Laplace equation,Biharmonic equation,Circulant matrices,Primary 65N35,Secondary 65N38
Discretization,Mathematical optimization,Polygon,Mathematical analysis,Matrix (mathematics),Matrix decomposition,Algorithm,Circulant matrix,Fast Fourier transform,Method of fundamental solutions,Biharmonic equation,Mathematics
Journal
Volume
Issue
ISSN
50
2
1017-1398
Citations 
PageRank 
References 
3
0.53
4
Authors
1
Name
Order
Citations
PageRank
Andreas Karageorghis120447.54