Fast commutative matrix algorithms

DOI10.1016/J.JSC.2022.05.002MaRDI QIDQ2156374zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Rosowski

Publication date 18 July 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.07683

zbMATH Keywords

matrix multiplicationcommutativeweakly bilinear

Mathematics Subject Classification ID

Theory of computing (68Qxx) Linear and multilinear algebra; matrix theory (15-XX)

Recommendations

• Fast matrix multiplication and its algebraic neighbourhood
• scientific article; zbMATH DE number 1779892
• scientific article; zbMATH DE number 4058734
• scientific article; zbMATH DE number 1350351
• Fast recursive algorithm for a class of structured matrices
• A practical algorithm for faster matrix multiplication
• Fast hybrid matrix multiplication algorithms
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• A new fast recursive matrix multiplication algorithm
• On practical algorithms for accelerated matrix multiplication

Cites work

• scientific article; zbMATH DE number 3480094 (Why is no real title available?)
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• An algorithm for multiplying 3×3 matrices
• Fast computation of discrete invariants associated to a differential rational mapping
• Gaussian elimination is not optimal
• Improved bound for complexity of matrix multiplication
• Matrix multiplication via arithmetic progressions
• Multiplying matrices faster than coppersmith-winograd
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• On Winograd's Algorithm for Inner Products
• On fast multiplication of a matrix by its transpose
• On multiplication of 2 2 matrices
• On the Asymptotic Complexity of Matrix Multiplication
• On the complexity of the multiplication of matrices of small formats
• Optimization techniques for small matrix multiplication
• Partial and Total Matrix Multiplication
• Powers of tensors and fast matrix multiplication
• Relations between exact and approximate bilinear algorithms. Applications
• Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
• The bilinear complexity and practical algorithms for matrix multiplication
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication

Cited in

(5)

• Generic polynomial algorithms for the knapsack problem in some matrix semigroups
• Fast O(n) complexity algorithms for diagonal innovation matrices
• Fast matrix computations for pairwise and columnwise commute times and Katz scores
• A normal form for matrix multiplication schemes
• Computation of the commutator of 2 × 2 matrices via six multiplications

This page was built for publication: Fast commutative matrix algorithms

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