Swarm capability of finding eigenvalues

  • Authors:
  • Jacek Kabziński

  • Affiliations:
  • Institute of Automatic Control, Technical University of Lodz, Lodz, Poland

  • Venue:
  • AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider particle swarm optimization algorithm with a constriction coefficient and investigate its competence in finding matrix eigenvalues. We propose a new objective function formulation and several slight algorithm modifications to compute eigenvalues effectively. We compare obtained results with standard numerical procedures for eigenvalues calculation and illustrate presented critical analysis with numerical examples. The problem generates interesting and challenging objective function landscapes, so it is a good benchmark to test abilities of PSO variants.