A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (Q2043999): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10559-021-00345-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3143939112 / rank | |||
Normal rank | |||
Revision as of 20:27, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) |
scientific article |
Statements
A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (English)
0 references
4 August 2021
0 references
linear algebra
0 references
Laderman's block-recursive matrix multiplication algorithm
0 references
family of fast hybrid matrix multiplication algorithms
0 references
Winograd's algorithm for inner product
0 references
