Back to Search
Start Over
Stability analysis of the method of fundamental solutions with smooth closed pseudo-boundaries for Laplace’s equation: better pseudo-boundaries
- Source :
- Numerical Algorithms. 89:1183-1222
- Publication Year :
- 2021
- Publisher :
- Springer Science and Business Media LLC, 2021.
-
Abstract
- Consider Laplace’s equation in a bounded simply-connected domain S, and use the method of fundamental solutions (MFS). The error and stability analysis is made for circular/elliptic pseudo-boundaries in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020), and polynomial convergence rates and exponential growth rates of the condition number (Cond) are obtained. General pseudo-boundaries are suggested for more complicated solution domains in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020, Section 5). Since the ill-conditioning is severe, the success in computation by the MFS mainly depends on stability. This paper is devoted to stability analysis for smooth closed pseudo-boundaries of source nodes. Bounds of the Cond are derived, and exponential growth rates are also obtained. This paper is the first time to explore stability analysis of the MFS for non-circular/non-elliptic pseudo-boundaries. Circulant matrices are often employed for stability analysis of the MFS; but the stability analysis in this paper is explored based on new techniques without using circulant matrices as in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020). To pursue better pseudo-boundaries, the sensitivity index is proposed from growth/convergence rates of stability via accuracy. Better pseudo-boundaries in the MFS can be found by trial computations, to develop the study in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020) for the selection of pseudo-boundaries. For highly smooth and singular solutions, better pseudo-boundaries are different; an analysis of the sensitivity index is explored. Circular/elliptic pseudo-boundaries are optimal for highly smooth solutions, but not for singular solutions. In this paper, amoeba-like domains are chosen in computation. Several useful types of pseudo-boundaries are developed and their algorithms are simple without using nonlinear solutions. For singular solutions, numerical comparisons are made for different pseudo-boundaries via the sensitivity index.
- Subjects :
- Laplace's equation
Polynomial
Laplace transform
Applied Mathematics
Numerical analysis
010103 numerical & computational mathematics
01 natural sciences
010101 applied mathematics
Bounded function
Applied mathematics
Method of fundamental solutions
0101 mathematics
Condition number
Circulant matrix
Mathematics
Subjects
Details
- ISSN :
- 15729265 and 10171398
- Volume :
- 89
- Database :
- OpenAIRE
- Journal :
- Numerical Algorithms
- Accession number :
- edsair.doi...........a56eb40d5acfc9a4488ae968f720b524
- Full Text :
- https://doi.org/10.1007/s11075-021-01150-5