Journal
NUMERICAL ALGORITHMS
Volume 91, Issue 3, Pages 1381-1405Publisher
SPRINGER
DOI: 10.1007/s11075-022-01306-x
Keywords
Method of fundamental solutions; Laplace equation; Ill conditioning
Categories
Funding
- FCT, Portugal [UIDB/00208/2020]
- Fundação para a Ciência e a Tecnologia [UIDB/00208/2020] Funding Source: FCT
Ask authors/readers for more resources
The method of fundamental solutions (MFS) is a numerical method for solving linear partial differential equations. However, the ill-conditioning of the matrices in the original method limits its accuracy. This study proposes a new algorithm to overcome the ill-conditioning of classical MFS by expanding the basis functions in terms of harmonic polynomials.
The method of fundamental solutions (MFS) is a numerical method for solving boundary value problems involving linear partial differential equations. It is well-known that it can be very effective assuming regularity of the domain and boundary conditions. The main drawback of the MFS is that the matrices involved are typically ill-conditioned and this may prevent the method from achieving high accuracy. In this work, we propose a new algorithm to remove the ill-conditioning of the classical MFS in the context of the Laplace equation defined in planar domains. The main idea is to expand the MFS basis functions in terms of harmonic polynomials. Then, using the singular value decomposition and Arnoldi orthogonalization, we define well conditioned basis functions spanning the same functional space as the MFS's. Several numerical examples show that when possible to be applied, this approach is much superior to previous approaches, such as the classical MFS or the MFS-QR.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available