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 al- gorithm for the solution of biharmonic problems in an- nular domains. The circulant structure of the matrices involved in the MFS discretization is exploited by using Fast Fourier Transforms. The algorithm is tested numer- ically on several examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
