DocumentCode
3487553
Title
Computing periodic orbits of nondifferentiable/discontinuous mappings through particle swarm optimization
Author
Parsopoulos, K.E. ; Vrahatis, M.N.
Author_Institution
Dept. of Math., Patras Univ., Greece
fYear
2003
fDate
24-26 April 2003
Firstpage
34
Lastpage
41
Abstract
Periodic orbits of nonlinear mappings play a central role in the study of dynamical systems. Traditional root finding algorithms, such as the Newton-family algorithms, have been widely applied for the detection of periodic orbits. However, in the case of discontinuous/nondifferentiable mappings and mappings with poorly behaved partial derivatives, this approach is not valid. In such cases, stochastic optimization algorithms have proved to be a valuable tool. In this paper, a new approach for computing periodic orbits through particle swarm optimization is introduced. The results indicate that the algorithm is robust and efficient. Moreover, the method can be combined with established techniques, such as deflection, to detect several periodic orbits of a mapping. Finally, the minor effort which is required to implement the proposed approach renders it an efficient alternative for computing periodic orbits of nonlinear mappings.
Keywords
Newton method; evolutionary computation; nonlinear dynamical systems; optimisation; search problems; Newton-family algorithms; deflection; dynamical systems; nondifferentiable/discontinuous mappings; nonlinear mappings; particle swarm optimization; periodic orbits; poorly behaved partial derivatives; root finding algorithms; Approximation algorithms; Artificial intelligence; Linear approximation; Mathematics; Orbits; Organisms; Particle swarm optimization; Polynomials; Robustness; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Swarm Intelligence Symposium, 2003. SIS '03. Proceedings of the 2003 IEEE
Print_ISBN
0-7803-7914-4
Type
conf
DOI
10.1109/SIS.2003.1202244
Filename
1202244
Link To Document