Ultraconveniently finding multiple solutions of complex transcendental equations based on genetic algorithm

被引:13
作者
Tian, YB [1 ]
Qian, J
机构
[1] Jiangsu Univ Sci & Technol, Sch Elect & Informat, Zhenjiang 212003, Jiangsu, Peoples R China
[2] Nanjing Univ, Dept Elect Sci & Engn, Nanjing 210093, Jiangsu, Peoples R China
关键词
D O I
10.1163/156939306776117090
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Getting all multiple solutions of complex transcendental equations is very important in scientific computing. A new and effective algorithm combining Genetic Algorithm (CA) with Parameter 'Racking Scheme (PTS) and Dynamic Searching Area (DSA) is developed. By using the algorithm, the rooting problem of all kinds of complex and transcendental equations ill electromagnetic field can be solved successfully, such as the eigenvalue equation of surface wave of microstrip antenna fed with coaxial line, the complex transcendental equation of medium permittivity that is measured by the method of terminal short circuit, and the characteristic equation of rectangular waveguide that is filled partially by magnetic materials and so forth. The computing results have good agreements with known outcomes of these questions obtained by other methods, for instance, Kuhn algorithm and iterative method. As compared with other schemes, the algorithm has some advantages, such as initial value and gradient information free, completeness, robustness, generalization., and precision etc.
引用
收藏
页码:475 / 488
页数:14
相关论文
共 14 条
[1]  
[Anonymous], SPIEP INTELL CONTROL
[2]   Microwave imaging of buried inhomogeneous objects using parallel genetic algorithm combined with FDTD method [J].
Chen, X. ;
Huang, K. ;
Xu, X. -B. .
PROGRESS IN ELECTROMAGNETICS RESEARCH-PIER, 2005, 53 :283-298
[3]   A versatile enhanced genetic algorithm for planar array design [J].
Donelli, M ;
Caorsi, S ;
De Natale, F ;
Franceschini, D ;
Massa, A .
JOURNAL OF ELECTROMAGNETIC WAVES AND APPLICATIONS, 2004, 18 (11) :1533-1548
[4]  
Goldberg D. E., 1992, Complex Systems, V6, P333
[5]  
JOHNSON JJ, 1997, COLORADO WHEAT FARME, V39, P4
[6]   Kuhn algorithm: Ultraconvenient solver to complex polynomial and transcendental equations without initial value selection [J].
Long, YL ;
Yung, EKN .
INTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, 2002, 12 (06) :540-547
[7]  
LONG YL, 1997, J SUN YAT SEN U, V36, P27
[8]  
Lucci L, 2004, PROG EL RES, V46, P127, DOI 10.2528/PIER03090501
[9]   Finding multiple solutions in job shop scheduling by niching genetic algorithms [J].
Pérez, E ;
Herrera, F ;
Hernández, C .
JOURNAL OF INTELLIGENT MANUFACTURING, 2003, 14 (3-4) :323-339
[10]  
Press W.H., 2002, Numerical recipes, V2nd