Successive Over-Relaxation Method Based on PSO

Liang Tang; Zhi Chao Wang; Lei Gao

doi:10.4028/www.scientific.net/AMM.734.522

Paper Titles

Research on the Optimization Model of Flights Alternate Based on Linear Programming
p.499

Research on Unconstrained Handwritten Numeral Recognition by BP Feature Screening Based on Fuzzy Clustering
p.504

Short-Term Traffic Flow Forecasting Based on SVR with Improved Artificial Fish Swarm Algorithm
p.508

Study on the Prediction Meth of Automobile Braking Distance Based on Artificial Neural Network
p.515

Successive Over-Relaxation Method Based on PSO
p.522

The Fractal Interpolating Algorithm of 3D Terrain Surface Reconstruction
p.526

The Study of Ant Colony Algorithm in Hydraulic Breakdown Diagnosis
p.530

Using Kernel Fisher Criterion for Gaussian Kernel Optimization
p.534

Zero-Displacement-Error ITAE Standard Forms Based on Modified Particle Swarm Optimization
p.539

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 734Successive Over-Relaxation Method Based on PSO

Successive Over-Relaxation Method Based on PSO

Abstract:

To solve large linear equations using SOR method, the most important thing is to ascertain relaxation factor. Considering current methods can not get the factor from global aspect, iteration times become larger and speed become slower. We pose a method to fix optimal factor using global search quality, genetic operational quality and compare the factor value obtaining from PSO algorithm and genetic algorithm, parabolic method. As a result, it shows that it is easier for PSO method to get optimal value than genetic and parabolic method from simulation result. PSO algorithm has huge advantage on solving global optimal problems. It is definite that PSO algorithm has great advantage then other methods and this method, and another advantage is it’s feasibility and convenience.

You might also be interested in these eBooks

Electronics, Automation and Engineering of Power Systems

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 734)

Pages:

522-525

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.734.522

Citation:

Cite this paper

Online since:

February 2015

Authors:

Liang Tang*, Zhi Chao Wang, Lei Gao

Keywords:

Genetic Algorithm (GA), Iteration Method, Relaxation Factor, Relaxation Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Zhang Tie, Yan Jiabin, Numerical Analysis, Metallurgical Industry Press, 2011, pp.120-128.

Google Scholar

[2] Richard L. Burden and J. Douglas Faires, Numerical Analysis, Higher Education Press，Beijing, 2001, pp.362-373.

Google Scholar

[3] HU Feng and YU Fuxi, Journal of Qinghai Normal University，2006, 1, 42.

Google Scholar

[4] Zhang Dexuan, Du Chenbin and Sun Liguo, , Science and Technology Inovation Herald, 2010, pp.217-220.

Google Scholar

[5] Wu Feng, Li Xiumei, Zhu Xuhui and Huang Zhehua, Some important improvement for steepest descent method, Journal of Guangxi University, 2010, 35, 596.

Google Scholar

[6] Kennedy, Eberhart and Yuhui Shi, Swarm intelligence, People's Posts and Telecommunications Press, Beijing, 2009, pp.142-145.

Google Scholar

[7] Cui Zhihua and Zhen Jianchao, Particle swarm optimization algorithm, Science Press, Beijing, 2011, p, 102-112.

Google Scholar

[8] Liu Guohua, packet Hong and Li Wenchao, Computer Application and Research, 2010, 8, 81.

Google Scholar

[9] Yao X and Xu Y, Recent advances in evolutionary computation, Journal of Computer Science and Technology, 2006, p.1–18.

Google Scholar