2002
DOI: 10.1007/s00466-001-0276-9
|View full text |Cite
|
Sign up to set email alerts
|

Application of a simulated annealing algorithm in the optimal placement of the source points in the method of the fundamental solutions

Abstract: The placement of source points constitutes a key issue for the method of the fundamental solutions. In particular, for problems with singularities of any kind the determination of the optimal placement of source points becomes relevant, as no linear combination of arbitrarily located source points can guarantee a reasonable approximation to the solution. This paper investigates the use of a ''Simulated Annealing'' algorithm in the optimal placement of source points in singular problems. The algorithm is essent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
11
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(11 citation statements)
references
References 9 publications
0
11
0
Order By: Relevance
“…Fairweather and Karageorghis [18][19][20] proposed the adaptive scheme, in which the coefficients of the linear representation of the solution as well as the position of the sources, which are given as a fixed number, are chosen by a non-linear least-squares algorithm. In paper [21], a simulated annealing algorithm was used for the optimal placement of source points in singular problems. Nishimura [22][23][24] proposed the genetic algorithm for the optimal arrangement of the source positions.…”
Section: Introductionmentioning
confidence: 99%
“…Fairweather and Karageorghis [18][19][20] proposed the adaptive scheme, in which the coefficients of the linear representation of the solution as well as the position of the sources, which are given as a fixed number, are chosen by a non-linear least-squares algorithm. In paper [21], a simulated annealing algorithm was used for the optimal placement of source points in singular problems. Nishimura [22][23][24] proposed the genetic algorithm for the optimal arrangement of the source positions.…”
Section: Introductionmentioning
confidence: 99%
“…For the first question, we refer to [7,20] for the choice of points. And for the second question, we will describe the regularize methods for solving an ill-posed linear system in the next subsection.…”
Section: Yuan and X Chengmentioning
confidence: 99%
“…However, the key issue for the MFS is how to collocate the sources. For the best choice of the positions of the equivalent sources, the residual between the approximate and the exact boundary can be minimized [15].…”
Section: Introductionmentioning
confidence: 99%