Genetic algorithms for discovery of matrix multiplication methods

Research output: Contribution to journalArticle

View graph of relations Save citation

Authors

Research units

Abstract

We present a parallel genetic algorithm for nding matrix multiplication algo-rithms. For 3 x 3 matrices our genetic algorithm successfully discovered algo-rithms requiring 23 multiplications, which are equivalent to the currently best known human-developed algorithms. We also studied the cases with less mul-tiplications and evaluated the suitability of the methods discovered. Although our evolutionary method did not reach the theoretical lower bound it led to an approximate solution for 22 multiplications.

Documents

  • letter-18-04.pdf

    Rights statement: © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

    527 KB, PDF-document

Details

Original languageEnglish
Article number6151102
Pages (from-to)749-751
Number of pages3
JournalIEEE Transactions on Evolutionary Computation
Volume16
Issue5
Early online date10 Feb 2012
DOIs
StatePublished - Oct 2012

Bibliographic note

© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

    Keywords

  • parallel genetic algorithm, matrix multiplication algo-rithms, theoretical lower bound

DOI

Download statistics

No data available

Employable Graduates; Exploitable Research

Copy the text from this field...