Fast commutative matrix algorithms
From MaRDI portal
Publication:2156374
DOI10.1016/J.JSC.2022.05.002OpenAlexW4281400593WikidataQ114154436 ScholiaQ114154436MaRDI QIDQ2156374FDOQ2156374
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
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
- Powers of tensors and fast matrix multiplication
- Gaussian elimination is not optimal
- Improved bound for complexity of matrix multiplication
- Partial and Total Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- Matrix multiplication via arithmetic progressions
- On multiplication of 2 \(\times\) 2 matrices
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On the Asymptotic Complexity of Matrix Multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Relations between exact and approximate bilinear algorithms. Applications
- On the complexity of the multiplication of matrices of small formats
- The bilinear complexity and practical algorithms for matrix multiplication
- On Winograd's Algorithm for Inner Products
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Optimization techniques for small matrix multiplication
- Title not available (Why is that?)
- An algorithm for multiplying 3×3 matrices
- Fast computation of discrete invariants associated to a differential rational mapping
- Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- On fast multiplication of a matrix by its transpose
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)
