Efficient MFS algorithms in regular polygonal domains
Ημερομηνία
2009ISSN
1017-1398Source
Numerical AlgorithmsVolume
50Issue
2Pages
215-240Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
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. © 2008 Springer Science+Business Media, LLC.