A New Fast Recursive Matrix Multiplication Algorithm

A new recursive algorithm is proposed for multiplying matrices of order n = 2 q ( q > 1). This algorithm is based on a fast hybrid algorithm for multiplying matrices of order n = 4 μ with μ = 2 q −1 ( q > 0). As compared with the well-known recursive Strassen’s and Winograd–Strassen’s algorith...

Full description

Saved in:

Bibliographic Details
Published in:	Cybernetics and systems analysis Vol. 55; no. 4; pp. 547 - 551
Main Author:	Jelfimova, L. D.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2019 Springer Springer Nature B.V
Subjects:	Algebra Algorithms Artificial Intelligence Complexity Control Mathematics Mathematics and Statistics Matrices (mathematics) Multiplication Processor Architectures Software Engineering/Programming and Operating Systems Systems Theory family of fast hybrid matrix multiplication algorithms block-recursive Strassen’s algorithm linear algebra block-recursive Winograd’s–Strassen’s algorithm
ISSN:	1060-0396, 1573-8337
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!