A new fast recursive matrix multiplication algorithm (Q2281348): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-019-00163-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965436164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Inner Product / 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 noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications / rank
 
Normal rank
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: New fast hybrid matrix multiplication algorithms / rank
 
Normal rank

Latest revision as of 07:31, 21 July 2024

scientific article
Language Label Description Also known as
English
A new fast recursive matrix multiplication algorithm
scientific article

    Statements

    A new fast recursive matrix multiplication algorithm (English)
    0 references
    0 references
    19 December 2019
    0 references
    block-recursive Strassen's algorithm
    0 references
    block-recursive Winograd's-Strassen's algorithm
    0 references
    fast hybrid matrix multiplication algorithms
    0 references

    Identifiers