COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM

DOI10.1142/S1469026805001647zbMath1161.65328WikidataQ115384156 ScholiaQ115384156MaRDI QIDQ3424487

Fei Gao, Heng-Qing Tong

Publication date: 16 February 2007

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

zbMATH Keywords

topological degreeuniform designdifferential evolution algorithmdeflection and stretchingtwo linchpins

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

Identification of unknown parameters and orders via cuckoo search oriented statistically by differential evolution for noncommensurate fractional-order chaotic systems

Cites Work

• Unnamed Item
• On the complexity of isolating real roots and computing with certainty the topological degree
• Global optimization and simulated annealing
• Computing the topological degree of a mapping in \(R^n\)
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• An efficient method for locating and computing periodic orbits of nonlinear mappings
• Taboo Search: An Approach to the Multiple Minima Problem
• Structure and Breakdown of Invariant Tori in a 4-D Mapping Model of Accelerator Dynamics
• The topological degree theory for the localization and computation of complex zeros of bessel functions
• PERIODIC ORBITS AND INVARIANT SURFACES OF 4D NONLINEAR MAPPINGS
• An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions

This page was built for publication: COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM