Abstract
The asymptotically fast algorithms for nXn matrix multiplication (MM) involving O(n2.496) arithmetical operations are designed with the demonstration of all major techniques historically used for the asymptotic acceleration of MM. The prospects of further progress are briefly discussed in Section 17.KeywordsMatrix MultiplicationCorrection TermKronecker ProductRecursive AlgorithmPrincipal Term
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have