The bilinear complexity and practical algorithms for matrix multiplication
From MaRDI portal
Recommendations
- On practical algorithms for accelerated matrix multiplication
- Matrix multiplication via arithmetic progressions
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- On the approximate bilinear complexity of matrix multiplication
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Gaussian elimination is not optimal
- Geometry and the complexity of matrix multiplication
- scientific article; zbMATH DE number 4018239 (Why is no real title available?)
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 2 matrices
- On practical algorithms for accelerated matrix multiplication
- On the complexity of some algorithms of matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- Open problems in computational linear algebra
- Partial and Total Matrix Multiplication
- Relations between exact and approximate bilinear algorithms. Applications
- Stability of fast algorithms for matrix multiplication
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Cited in
(62)- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
- On practical algorithms for accelerated matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Tensor decomposition and homotopy continuation
- The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
- A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\)
- Equivalent polyadic decompositions of matrix multiplication tensors
- Fast commutative matrix algorithms
- An introduction to the computational complexity of matrix multiplication
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
- Symmetric matrices whose entries are linear functions
- New ways to multiply \(3 \times 3\)-matrices
- Improved method for finding optimal formulas for bilinear maps in a finite field
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- Tensor surgery and tensor rank
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
- Improving the numerical stability of fast matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
- Addition requirements for matrix and transposed matrix products
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
- scientific article; zbMATH DE number 4124896 (Why is no real title available?)
- scientific article; zbMATH DE number 1464691 (Why is no real title available?)
- Fast matrix multiplication and its algebraic neighbourhood
- New fast hybrid matrix multiplication algorithms
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- On the Reuse of Additions in Matrix Multiplication
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- On obtaining upper bounds on the complexity of matrix multiplication
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
- scientific article; zbMATH DE number 7650266 (Why is no real title available?)
- An adaptive prefix-assignment technique for symmetry reduction
- Оценивание множеств решений линейных систем обыкновенных дифференциальных уравнений с возмущениями на основе оператора Коши;The estimation of solutions sets of linear systems of ordinary differential equations with perturbations based on the Cauchy operator
- Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
- Flip Graphs for Matrix Multiplication
- The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- A normal form for matrix multiplication schemes
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- Numerical stability and tensor nuclear norm
- New lower bounds for matrix multiplication and
- Finding complex-valued solutions of brent equations using nonlinear least squares
- Semi-analytical solution of Brent equations
- The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
- Tensor rank and complexity
- Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
- Deflation Conjecture and Local Dimensions of Brent Equations
- Stability improvements for fast matrix multiplication
- Some new non-commutative matrix multiplication algorithms of size (n, m, 6)
- On the local dimensions of solutions of Brent equations
- Adaptive flip graph algorithm for matrix multiplication
- Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
- On the automorphism group of a possible short algorithm for multiplying 3 3 matrices
- Flip graphs with symmetry and new matrix multiplication schemes
- How to multiply matrices faster
- On commutativity and approximation
- On the approximate bilinear complexity of matrix multiplication
This page was built for publication: The bilinear complexity and practical algorithms for matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940335)
