New fast hybrid matrix multiplication algorithms (Q464981): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A fast algorithm for matrix multiplication and its efficient realization on systolic arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast hybrid matrix multiplication algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Algorithm for Inner Product / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040698 / rank | |||
Normal rank |
Latest revision as of 05:13, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New fast hybrid matrix multiplication algorithms |
scientific article |
Statements
New fast hybrid matrix multiplication algorithms (English)
0 references
30 October 2014
0 references
hybrid matrix multiplication algorithm
0 references
Laderman's algorithm
0 references
0 references