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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Cybernetics and systems analysis Ročník 55; číslo 4; s. 547 - 551
Hlavný autor:	Jelfimova, L. D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2019 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!