On Winograd's Algorithm for Inner Products

DOI10.1109/T-C.1970.222926MaRDI QIDQ5592615zbMATH OpenFDO

Authors Abraham Waksman

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1970.222926

zbMATH Keywords

numerical analysis

Cited in

(7)

• Using duality for the synthesis of an optimal algorithm involving matrix multiplication
• On the complexity of the multiplication of matrices of small formats
• Fast commutative matrix algorithms
• Geometry and the complexity of matrix multiplication
• Fast matrix multiplication and its algebraic neighbourhood
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• Optimization techniques for small matrix multiplication

This page was built for publication: On Winograd's Algorithm for Inner Products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592615)