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

From MaRDI portal
Revision as of 06:39, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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