A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (Q2043999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new fast recursive matrix multiplication algorithm / 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
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 New Algorithm for Inner Product / rank
 
Normal rank

Latest revision as of 08:27, 26 July 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
    0 references
    4 August 2021
    0 references
    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
    0 references