Paper Info
Title
Efficient Kansa-type MFS algorithm for elliptic problems
Abstract
In this study we propose an efficient Kansa-type method of fundamental solutions (MFS-K) for the numerical solution of certain problems in circular geometries. In particular, we consider problems governed by the inhomogeneous Helmholtz equation in disks and annuli. The coefficient matrices in the linear systems resulting from the MFS-K discretization of these problems possess a block circulant structure and can thus be solved by means of a matrix decomposition algorithm and fast Fourier Transforms. Several numerical examples demonstrating the efficacy of the proposed algorithm are presented.
Year
DOI
Venue
2010
10.1007/s11075-009-9334-8
Numerical Algorithms
Keywords
Field
DocType
Method of fundamental solutions,Elliptic boundary value problems,Circulant matrices,Fast Fourier transforms,Primary 65N35,Secondary 65N38,65K10
Discretization,Mathematical optimization,Linear system,Matrix (mathematics),Mathematical analysis,Matrix decomposition,Algorithm,Fast Fourier transform,Circulant matrix,Helmholtz equation,Method of fundamental solutions,Mathematics
Journal
Volume
Issue
ISSN
54
2
1017-1398
Citations 
PageRank 
References 
5
0.52
4
Authors
1
Name
Order
Citations
PageRank
Andreas Karageorghis120447.54