Matrix decomposition MFS algorithms
Date
2006ISBN
1-84564-164-7978-1-84564-164-1
Source
WIT Transactions on Modelling and Simulation28th World Conference on Boundary Elements and Other Mesh Reduction Methods, BEM/MRM 2006, BE06
Volume
42Pages
61-68Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We describe the application of the Method of Fundamental Solutions (MFS) to elliptic boundary value problems in rotationally symmetric problems. In particular, we show how efficient matrix decomposition MFS algorithms can be developed for such problems. The efficiency of these algorithms is optimized by using Fast Fourier Transforms (FFTs).