Finding the Maximum Module of the Roots of a Polynomial by Particle Swarm Optimization

被引：0

作者：

Qu, Liangdong ^{[1
]}

He, Dengxu ^{[1
]}

机构：

[1] Guangxi Univ Nationalities, Coll Math & Comp Sci, Nanning, Peoples R China

来源：

ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS | 2010年 / 6145卷

关键词：

polynomial; the maximum module; unit circle; particle swarm optimization; parallel;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Alter the theorem which is used to determine whether all roots of a polynomial are in unit click is given, and two particle swarm optimizations for finding the maximum module of the roots of a polynomial based on the theorem are proposed Finally, several computer simulation results show that using these algorithms to find the maximum module of roots of a polynomial are more efficient and feasible, the convergent speed is much faster and the accuracy of results is much higher

引用

页码：214 / 221

页数：8

共 50 条

[41] Linear Array Synthesis using Schelkunoff Polynomial Method and Particle Swarm Optimization
Banerjee, Smita
Dwivedi, Ved Vyas
2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA), 2015, : 727 - 730
[42] Particle swarm optimization of a modified Bernstein polynomial for conformal array excitation synthesis
Boeringer, DW
Werner, DH
IEEE ANTENNAS AND PROPAGATION SOCIETY SYMPOSIUM, VOLS 1-4 2004, DIGEST, 2004, : 2293 - 2296
[43] Generalized Memory Polynomial Model Dimension Selection Using Particle Swarm Optimization
Abdelhafiz, A.
Behjat, L.
Ghannouchi, F. M.
IEEE MICROWAVE AND WIRELESS COMPONENTS LETTERS, 2018, 28 (02) : 96 - 98
[44] Design of Polynomial Function based Blind Equalizer using Particle Swarm Optimization
Pydi, Sunil Kumar
Majumder, Saikat
2021 SIXTH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, SIGNAL PROCESSING AND NETWORKING (WISPNET), 2021, : 48 - 52
[45] A Particle Swarm Optimization-Based Heuristic for Software Module Clustering Problem
Prajapati, Amarjeet
Chhabra, Jitender Kumar
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2018, 43 (12) : 7083 - 7094
[46] A Particle Swarm Optimization-Based Heuristic for Software Module Clustering Problem
Amarjeet Prajapati
Jitender Kumar Chhabra
Arabian Journal for Science and Engineering, 2018, 43 : 7083 - 7094
[47] PL HOMOTOPY FOR FINDING ALL THE ROOTS OF A POLYNOMIAL
KOJIMA, M
NISHINO, H
ARIMA, N
MATHEMATICAL PROGRAMMING, 1979, 16 (01) : 37 - 62
[48] A Parallel algorithm for finding all the roots of a polynomial
Jin, YM
Zhang, SY
COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY, 2001, : 479 - 482
[49] A parallel iteration method for finding roots of a polynomial
Zhang, Xin
Peng, Hong
Zheng, Qilun
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 2408 - 2412
[50] A Parallel Algorithm for Finding Roots of a Complex Polynomial
程锦松
Journal of Computer Science and Technology, 1990, (01) : 71 - 81

← 1 2 3 4 5 →