Range Particle Algorithm Application in the Solving Inverse Problem of Line Source

Abstract:

Now mature and effective algorithms for the numerical solution of inverse problem of line source are few, so the researching of algorithms for the problem is urgent and necessary. Firstly, a brief introduction to the characteristics of solving the inverse problem of the line source is given, and the mathematical solution model of inverse problem is established based on the Line source equation, Secondly a new algorithm (Range Particle algorithm) based on range searching algorithm is proposed for the numerical solving the inverse problem of the line source particle and the basic implementation steps and parameter adjustment of the algorithm also be discussed. Finally, simulated and measured data were used to test the effect of the algorithm. The results show that the range particle algorithm is an algorithm of high precision, fast convergence and computational stability for the solving the inverse problem of the line source and it do can be applied in Engineering.

• Periodical: Advanced Materials Research (Volumes 532-533)
• Pages: 1492-1496
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.532-533.1492
• Online since: June 2012
• Authors: Ke Guang Yu
• Keywords: Component, Experimental Analysis, Inverse Problem of Line Source, Numerical Solution, Range Particle Algorithm (RPA)

References

[1] Yang Huajun. Methods of the Mathematical Physics and Computer Simulation [M]. Beijing: Publishing house of electronics industry, (2005).

[2] Zheng peng, Zhou Hangxia, and Yu Keguang. Application of simulated annealing in solving the inverse problem of line heat sources [J]. Journal of China Jiliang University, 2010, 21(3): 246–250.

[3] Vries D A. A nonstationary method for determining thermal conductivity of soil in situ[J]. Soil Science, 1952, 73(2): 83–90.

DOI: 10.1097/00010694-195202000-00001

[4] Kluitenberg G. J, Ham J M, and Bristow K. L. Error Analysis of the Heat Pulse Method for Measuring Soil Volumetric Heat Capacity[J]. Soil Sci. Soc. Am. J., 1993, VOL. 57: 1444–1451.

DOI: 10.2136/sssaj1993.03615995005700060008x

[5] Hansen E R. Global Optimization Using Interval Analysis-The Multi-Dimensional Case [J]. Number. Math, 1980, 34: 249–251.

[6] Shen Peiping and Li Wenqiang. An interval method for constrained global optimization [J], Mathematics in practice and throry, 35(11), 2005: 148-149.

[7] Liu Jianhua. The research of basic theory and improvement on particle swarm optimization [D]. Hunan: Central south University, (2009).

[8] Alsuwaiyel M H. Algorithms Design Techniques and Analysis [M]. Translated by Wu Weixu, Fang Shichang, Beijing: Publishing house of electronics industry, 2004, 10–18.

[9] Wang Changsong and Zhao Xiang. General method for evaluating optimization algorithm and its application [J]. Journal of Computer Application, 2010, 30(1): 76–79.