An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War
Data Structures and Algorithms
2013-08-13 v1
Abstract
In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn dense matrices which computes the product matrix with average complexity Tavg(n) = d1d2n3 with the acknowledgement that the average count is obtained for addition as the basic operation rather than multiplication which is probably the unquestionable choice for basic operation in existing matrix multiplication algorithms.
Cite
@article{arxiv.1308.2400,
title = {An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War},
author = {Niraj Kumar Singh and Soubhik Chakraborty and Dheeresh Kumar Mallick},
journal= {arXiv preprint arXiv:1308.2400},
year = {2013}
}
Comments
No of tables is 1. No of diagrams is 01