Fast matrix multiplication by using color algebras

DOI10.1007/S10958-017-3593-ZMaRDI QIDQ1687984zbMATH OpenOpenAlexFDO

Authors R. R. Aidagulov, M. V. Shamolin

Publication date 4 January 2018

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-017-3593-z

zbMATH Keywords

color algebrafast Fourier transformmatrix producttensor product

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Computational aspects of associative rings (general theory) (16Z05) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites work

• A refinement of the Conway algorithm
• Fast matrix multiplication is stable
• Gaussian elimination is not optimal
• Groups of colors.
• scientific article; zbMATH DE number 107985 (Why is no real title available?)
• Integration formulas of tenth order and higher
• Matrix multiplication via arithmetic progressions
• Powers of tensors and fast matrix multiplication

Cited in

(2)

• Sparse Matrix-Matrix Products Executed Through Coloring
• scientific article; zbMATH DE number 4127216 (Why is no real title available?)

This page was built for publication: Fast matrix multiplication by using color algebras

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