A Competition Model Based on Natural Tree Growth for Finding All Zeros of a Polynomial

被引：0
作者：
Guo, Gaiwen [1 ,2 ]
Zhao, Bing [3 ]
Lai, Qingmin [1 ]
Huang, Kama [2 ]
机构：
[1] Henan Inst Educ, Key Discipline Circuit & Syst, Zhengzhou Henan 450014, Peoples R China
[2] Sch Elect & Informat Engn, Chengdu 610065, Peoples R China
[3] North Chian Univ Water Conservany & Elect Power, Dept Informat & Engn, Zhengzhou 450012, Peoples R China
来源：
2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23 | 2008年
基金：
中国国家自然科学基金;
关键词：
natural tree; growth; competition; model; finding all zeros of a polynomial;
D O I：
10.1109/WCICA.2008.4594003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A competition model was established by using the principle of contradictory unity of growth and wilting based on natural tree. To testify the competition model, it was applied in solving polynomial equations of complex coefficients. Then, Sunlight adaptability, nutrition factor and shade factor were defined, and equations of competitive phototropic growth and conditions of fading were described. Finally, it was used in the two examples of finding all zeros of a polynomial, and compared with the Standard Genetic Algorithm (SGA). The results show that the computing precisions are satisfying, and require less runtime than SGA.
引用
收藏
页码：7017 / +
页数：2
相关论文
共 9 条
  • [1] [Anonymous], 1975, ADAPTATION NATURE AR
  • [2] Optimal algorithms for well-conditioned nonlinear systems of equations
    Bianchini, M
    Fanelli, S
    Gori, M
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (07) : 689 - 698
  • [3] Chen J, 2001, CONTROL INSTRUMENTS, P1
  • [4] CHEN ZY, 1998, J WUHAN U NATURAL SC, V44, P577
  • [5] GUO GW, 2007, P 2007 INT C CONV IN, P66
  • [6] Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
  • [7] Krohling RA, 2002, IEEE C EVOL COMPUTAT, P1688, DOI 10.1109/CEC.2002.1004496
  • [8] Liu F., 2007, P 2 INT C PERV COMP, V27, P542
  • [9] VOSE MD, 1999, COM ADAP SY, P1
1